A convex-relaxation denoiser projects PCA-reduced noisy manifold data onto the convex hull using a Gaussian-tail oracle, with finite-sample error bounds under a lower-mass condition on the latent distribution.
On the complexity of bandit and derivative-free stochastic convex optimization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ME 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Denoising data using convex relaxations
A convex-relaxation denoiser projects PCA-reduced noisy manifold data onto the convex hull using a Gaussian-tail oracle, with finite-sample error bounds under a lower-mass condition on the latent distribution.