Variance-Reduced Manifold Sampling via Polynomial-Maximization Density Estimation
Serhii Zabolotnii

TL;DR
This paper introduces a polynomial-maximization density estimator to improve uniform sampling on manifolds, reducing density estimation errors in motion planning and machine learning applications.
Contribution
It proposes a novel PMM-MASEM module that adaptively replaces the plug-in density rule with a polynomial-maximization estimator based on local spacing statistics.
Findings
Reduces density MSE by 22-36% on certain regimes.
The fallback to MLE is effective on flat homogeneous manifolds.
PMM3 can worsen performance on some spacing distributions.
Abstract
Uniform sampling on implicitly defined manifolds is a core primitive in motion planning, constrained simulation, and probabilistic machine learning. MASEM addresses this problem by entropy-maximizing resampling, but its resampling weights depend on a local k-nearest-neighbour density estimate whose errors can be amplified by aggressive resampling temperatures. We ask whether a polynomial-maximization moment estimator can replace the plug-in density rule without changing the surrounding MASEM architecture. The proposed PMM-MASEM module computes shell spacings from nested k-nearest-neighbour radii, estimates their standardized cumulants, and uses a gated PMM2/PMM3 estimator only when the spacing distribution departs from the flat Exp(1) regime; otherwise it falls back to the plug-in/MLE rule. This fallback is essential: on a flat homogeneous manifold the plug-in estimator is already the…
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.
