arXiv Machine Learning August 27, 2026 By David P. Hofmeyr

Efficient Estimation of High Information Projections using Nearest Neighbours

Read the original on arXiv Machine Learning →

The paper introduces a new dimensionality reduction technique that enhances nearest‑neighbour relationships to estimate high‑information projections. It constructs a matrix encoding local covariance via nearest‑neighbour pairs and shows that, under standard regularity conditions, this matrix consistently estimates the Density Information Matrix (DIM), a non‑parametric analogue of the Fisher Information Matrix. The authors also demonstrate the method’s practical usefulness for clustering and outlier detection.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Aug 11

Multi-kernel spectral clustering: Entrywise eigenvector perturbation bounds and exact recovery

arXiv:2608. 08704v1 Announce Type: cross Abstract: Kernel spectral clustering with a single bandwidth can be inadequate for data exhibiting multiple characteristic pairwise-distance scales, a problem particularly prevalent in the high-dimensional regime.

By Zeqin Lin, Guangming Pan, Zhixiang Zhang, Yinbing Zhou

rag

arXiv Machine Learning

Jun 29

Supervised Quadratic Feature Analysis: Information Geometry Approach for Dimensionality Reduction

arXiv:2502. 00168v5 Announce Type: replace-cross Abstract: Supervised dimensionality reduction maps labeled data into a low-dimensional feature space while preserving class separation.

By Daniel Herrera-Esposito, Johannes Burge

benchmarks

arXiv Machine Learning

Jun 2

Cellwise and Casewise Robust Covariance in High Dimensions

arXiv:2505. 19925v2 Announce Type: replace-cross Abstract: The sample covariance matrix is a cornerstone of multivariate statistics, but it is highly sensitive to outliers.

By Fabio Centofanti, Mia Hubert, Peter J. Rousseeuw

arXiv Machine Learning

Jul 24

Regularized Optimization on Grassmann Manifold: Theory, Algorithm and Applications

arXiv:2607. 21039v1 Announce Type: new Abstract: Spectral methods are among the most widely used techniques for community detection, clustering, and graph learning.

By Zhuan Liang, Zheng Zhai

arXiv AI

Aug 18

Shape Operator PCA: Curvature-Aware Projections for Geometric Machine Learning

arXiv:2608. 15313v1 Announce Type: cross Abstract: In this paper, we propose SHOPCA (Shape Operator-based Principal Component Analysis), a novel method for unsupervised metric learning and dimensionality reduction that incorporates differential geometric information into the covariance structure of classical PCA.

By Alexandre L. M. Levada

rag benchmarks

arXiv Machine Learning

Jun 30

Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization

arXiv:2510. 02308v2 Announce Type: replace Abstract: Estimating the tangent spaces of a data manifold is a fundamental problem in geometric data analysis.

By Dhruv Kohli, Sawyer J. Robertson, Gal Mishne, Alexander Cloninger

One email a morning, machine-written

Related stories

Multi-kernel spectral clustering: Entrywise eigenvector perturbation bounds and exact recovery

Supervised Quadratic Feature Analysis: Information Geometry Approach for Dimensionality Reduction

Cellwise and Casewise Robust Covariance in High Dimensions

Regularized Optimization on Grassmann Manifold: Theory, Algorithm and Applications

Shape Operator PCA: Curvature-Aware Projections for Geometric Machine Learning

Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization