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.
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$.
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
DeepMVSA is proposed, which re-expresses the minimum-volume principle in neural implicit form and proves a non-asymptotic sample-complexity bound of the polynomial-time benchmark order for a localized surrogate estimator.
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
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...
It is shown that the JL bound can therefore be uninformative about retained geometry: an independent Gaussian replacement map can satisfy it even though the replacement cloud is independent of the original data.
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.