mlsanityData to 14 Oct 2026

Efficient Estimation of High Information Projections using Nearest Neighbours

arXiv 2608.25887 ↗First posted 26 Aug 2026stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

An intuitive method for dimensionality reduction is proposed, which is highly effective for finding interesting projections of multivariate data. Following similar intuitive motivation to a number of existing techniques, the proposed method is based on enhancing the nearest neighbour relationships in the data. The proposed projection arises from the spectral decomposition of a matrix designed to encode the local covariance structure in the data, where the local covariance at a point is captured by pairs of its nearest neighbours. We show that under standard regularity conditions this matrix is a consistent estimator of the so-called ``Density Information Matrix'' (DIM); a non-parametric analogue of the Fisher Information Matrix. Spectral decompositions of DIMs have been shown to be connected with the important problems of Independent Components Analysis and, in the supervised context, Sufficient Dimension Reduction. However, existing estimators of the DIM are computationally expensive to compute and only target the DIM of a surrogate density, which is proportional to the square of the true underlying density. In addition, we go on to explore the practical utility of our method in aiding the downstream tasks of cluster analysis and outlier detection.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 30 references that are in the map. First posted on arXiv 26 Aug 2026.

Builds on

1 of 30 references.

References · 1

  1. 2025Clustering by Nonparametric Smoothingcited by 1

Built on by

Not cited yet.