mlsanityData to 14 Oct 2026

Adaptive Metric Dimensionality Reduction

arXiv 1302.2752 ↗First posted 12 Feb 2013cs.LG cs.DS stat.MLcited by 14

Not on the map. Why?

Abstract (arXiv)

We study adaptive data-dependent dimensionality reduction in the context of supervised learning in general metric spaces. Our main statistical contribution is a generalization bound for Lipschitz functions in metric spaces that are doubling, or nearly doubling. On the algorithmic front, we describe an analogue of PCA for metric spaces: namely an efficient procedure that approximates the data's intrinsic dimension, which is often much lower than the ambient dimension. Our approach thus leverages the dual benefits of low dimensionality: (1) more efficient algorithms, e.g., for proximity search, and (2) more optimistic generalization bounds.

Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). First posted on arXiv 12 Feb 2013.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 2; 2023: 6; 2024: 3; 2025: 1; 2026: 1.

14 papers.

Sort: