Sign inGet started
Paper · arXiv

A Universal Nearest-Neighbor Estimator for Intrinsic Dimensionality

Estimating the intrinsic dimensionality (ID) of data is a fundamental problem in machine learning and computer vision, providing insight into the true degrees of freedom underlying high-dimensional observations. Existing methods often rely on geometric or distributional assumptions and can significantly fail when these assumptions are violated. In this paper, we introduce a novel ID estimator based on nearest-neighbor distance ratios that involves simple calculations and achieves state-of-the-art results. Most importantly, we provide a theoretical analysis proving that our estimator is \emph{universal}, namely, it converges to the true ID independently of the distribution generating the d...

AuthorsEng-Jon Ong, Omer Bobrowski, Gesine Reinert et al.
Primary categorycs.LG
Published11 March 2026
Last updated at source11 March 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/b9511815-a8af-467c-ad4f-b42b230c9c36" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.