Moving Least Squares without Quasi-Uniformity: A Stochastic Approach
Shir Tapiro-Moshe, Yariv Aizenbud, Barak Sober

TL;DR
This paper develops a stochastic analysis of Moving Least Squares (MLS), showing that classical approximation and smoothness properties hold under random sampling, and applies this to manifold estimation.
Contribution
It provides the first unified probabilistic analysis of MLS, extending deterministic results to random samples and applying it to manifold reconstruction.
Findings
Approximation error decays as $h_n^{k-|m|}$ with high probability.
MLS approximant is smooth with high probability.
Hausdorff distance between manifold and MLS reconstruction decays as $h_n^k$.
Abstract
Local Polynomial Regression (LPR) and Moving Least Squares (MLS) are closely related nonparametric estimation methods, developed independently in statistics and approximation theory. While statistical LPR analysis focuses on overcoming sampling noise under probabilistic assumptions, the deterministic MLS theory studies smoothness properties and convergence rates with respect to the \textit{fill-distance} (a resolution parameter). Despite this similarity, the deterministic assumptions underlying MLS fail to hold under random sampling. We begin by quantifying the probabilistic behavior of the fill-distance and \textit{separation} of an i.i.d. random sample. That is, for a distribution satisfying a mild regularity condition, and . We then prove that, for MLS of degree , the approximation error…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Markov Chains and Monte Carlo Methods · Statistical Methods and Inference
