paper-with-me

홈 › Papers

Local Averaging Accurately Distills Manifold Structure From Noisy Data

2025-06-23 · Yihan Shen, Shiyu Wang, Arnaud Lamy, Mariam Avagyan, John Wright

High-dimensional data are ubiquitous, with examples ranging from natural images to scientific datasets, and often reside near low-dimensional manifolds. Leveraging this geometric structure is vital for downstream tasks, including signal denoising, reconstruction, and generation. However, in practice, the manifold is typically unknown and only noisy samples are available. A fundamental approach to uncovering the manifold structure is local averaging, which is a cornerstone of state-of-the-art provable methods for manifold fitting and denoising. However, to the best of our knowledge, there are no works that rigorously analyze the accuracy of local averaging in a manifold setting in high-noise regimes. In this work, we provide theoretical analyses of a two-round mini-batch local averaging method applied to noisy samples drawn from a $d$-dimensional manifold $\mathcal M \subset \mathbb{R}^D$, under a relatively high-noise regime where the noise size is comparable to the reach $\tau$. We show that with high probability, the averaged point $\hat{\mathbf q}$ achieves the bound $d(\hat{\mathbf q}, \mathcal M) \leq \sigma \sqrt{d\left(1+\frac{\kappa\mathrm{diam}(\mathcal {M})}{\log(D)}\right)}$, where $\sigma, \mathrm{diam(\mathcal M)},\kappa$ denote the standard deviation of the Gaussian noise, manifold's diameter and a bound on its extrinsic curvature, respectively. This is the first analysis of local averaging accuracy over the manifold in the relatively high noise regime where $\sigma \sqrt{D} \approx \tau$. The proposed method can serve as a preprocessing step for a wide range of provable methods designed for lower-noise regimes. Additionally, our framework can provide a theoretical foundation for a broad spectrum of denoising and dimensionality reduction methods that rely on local averaging techniques.

📄 PDF Abstract BibTeX arXiv:2506.18761

Code (0)

등록된 구현이 없습니다.

Tasks

DenoisingDimensionality Reduction

Similar Papers 제목 키워드 기반

Shonan Rotation Averaging: Global Optimality by Surfing SO(p)(n)

2020-08-01 · ECCV 2020 8 · Frank Dellaert, David M. Rosen, Jing Wu, Robert Mahony 외

Shonan Rotation Averaging is a fast, simple, and elegant rotation averaging algorithm that is guaranteed to recover globally optimal solutions under mild assumptions on the measurement noise. Our method employs semidefin…

Shonan Rotation Averaging: Global Optimality by Surfing $SO(p)^n$

2020-08-06 · Frank Dellaert, David M. Rosen, Jing Wu, Robert Mahony 외

Shonan Rotation Averaging is a fast, simple, and elegant rotation averaging algorithm that is guaranteed to recover globally optimal solutions under mild assumptions on the measurement noise. Our method employs semidefin…

PDD: Manifold-Prior Diverse Distillation for Medical Anomaly Detection

2026-03-07 · Xijun Lu, Hongying Liu, Fanhua Shang, Yanming Hui 외 arxiv

Medical image anomaly detection faces unique challenges due to subtle, heterogeneous anomalies embedded in complex anatomical structures. Through systematic Grad-CAM analysis, we reveal that discriminative activation map…

Anomaly Detection

Exploiting Manifold Structured Data Priors for Improved MR Fingerprinting Reconstruction

2023-10-09 · Peng Li, Yuping Ji, Yue Hu

Estimating tissue parameter maps with high accuracy and precision from highly undersampled measurements presents one of the major challenges in MR fingerprinting (MRF). Many existing works project the recovered voxel fin…

GPU

On the Local Linear Rate of Consensus on the Stiefel Manifold

2021-01-22 · Shixiang Chen, Alfredo Garcia, Mingyi Hong, Shahin Shahrampour

We study the convergence properties of Riemannian gradient method for solving the consensus problem (for an undirected connected graph) over the Stiefel manifold. The Stiefel manifold is a non-convex set and the standard…