AI RESEARCH
Denoising data using convex relaxations
arXiv CS.LG
•
ArXi:2605.02327v1 Announce Type: cross We study the problem of denoising observations \(Y_i=X_i+Z_i\), where the latent variables \(X_i\) are sampled from a low-dimensional manifold in \(\mathbb{R}^n\) and the noise variables \(Z_i\) are isotropic Gaussian. We propose a convex-relaxation estimator that first reduces dimension by principal component analysis and then projects the observations onto the convex hull of the projected latent manifold. We construct a statistical oracle that estimates its ing hyperplanes from empirical Gaussian tail probabilities of the noisy sample.