Skip to content
Preprint

Low Dimensional Sampling under Reconstructed Constraints

Sep 2026 · 0 citations · 40 references
Mathematics

Abstract

We study sampling from a distribution supported on an unknown compact $d$-dimensional $C^2$ manifold $M\subset\mathbb{R}^D$, observed only through i.i.d. uniform points from $M$. We reconstruct the constraint using an adaptive local-convex-hull estimator and target an ambient distribution penalized by squared distance to the reconstruction. Although the reconstructed set may be nonsmooth or fail to be a manifold, its Hausdorff accuracy alone suffices to control the Wasserstein error. We quantify the tradeoff between reconstruction accuracy and penalty strength and show that optimal tuning gives an error proportional to the square root of the Hausdorff error. A planar example proves that this dependence is sharp for the proposed scheme. For a $d$ dimensional constraint reconstructed from $N$ observations, the error becomes $\mathcal{O}( (N/N)^{1/d})$. Finally, we prove uniform geometric ergodicity of a Gaussian random-walk Metropolis--Hastings sampler and combine reconstruction, approximation, and mixing into an explicit finite-time guarantee.

View source

Similar papers

Preprint Aug 2026

Sharp proper estimation of fixed-component Gaussian location mixtures in polynomial time

Exhaustive moment fitting in this constant-dimensional space produces a proper mixture and, together with the dimension-free moment characterization of Gaussian mixtures, achieves the optimal Hellinger rate in polynomial arithmetic time for every fixed $k$.

Heng-Zhi He, Guang Cheng · 0 citations
Preprint Aug 2026

Algorithmic threshold for high-dimensional projection pursuit I: general theory

The main innovation is to develop stochastic control theory within the branching OGP framework, significantly expanding the settings in which it locates an exact algorithmic threshold.

Brice Huang, Mark Sellke, Ni-Ke Sun · 3 citations · ⚡1
#machine learning Preprint Sep 2026

Scalable Minimum-Volume Simplex Estimation with Non-asymptotic Analysis

We study the estimation of a $K$-dimensional simplex from $N$ i.i.d.\ points sampled uniformly from its interior; the observations are convex combinations of $K+1$ unknown prototypes. Existing polynomial-time estimators need cubic per-sample work or $O(NK)$ storage and are impractical at $N\sim 10^6$--$10^8$. We propos...

Jun Li, Yan-Long Guo, Zhao-Zhao Zeng · 0 citations
Preprint Sep 2026

Approximating Measures on Function Spaces: Transport and Truncation

This work introduces the class $\mathcal{P}_\psi(\mu)$ of measures that differ from a reference measure only through a finite-dimensional map $\psi$ while preserving the reference conditionals on its fibers, and develops approximation theory for fitting within it.

R. Baptista, Bamdad Hosseini, Alexander Hsu · 0 citations
#machine learning Preprint Sep 2026

Recovering linear images of sparse signals from indirect observations

In this paper, we develop and analyze techniques for recovering a linear image $Bx$ of an unknown signal $x$ from indirect noisy observation $\omega=Ax+\xi$. It is {\em a priori} known that $x\in \cX$, a given convex compact set, and that $x$ is $s$-sparse---has at most $s$ nonvanishing entries. The proposed estimates...

A. Juditsky, A. Nemirovski · 0 citations
#machine learning Preprint Sep 2026

Exact Limits of Random Projections for Preserving Geometry: Distance Recovery, Nearest-Neighbor Rankings, and Covariance Shape in Gaussian Models

The Johnson-Lindenstrauss (JL) lemma guarantees that a random projection of $n$ points to $m=O(\varepsilon^{-2}\log n)$ dimensions preserves pairwise squared distances within relative error $\varepsilon$ with high probability, and this dimension order is asymptotically optimal. In high dimensions, however, distances co...

Piyush Sao · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.