cs.AIOct 30, 2026

Quantifying Local and Global Fidelity of Nonlinear Embeddings

Authors: Henry Han

Organizations: Data Science and AI Innovation Laboratory, Baylor University, Waco, Texas, USA.

Abstract

Dimension reduction rests on a claim: t-SNE and UMAP preserve local structure, PCA global structure. Our DLP curve is the share of each point's k nearest neighbors a map keeps. Corrected for chance, it gives L at k=10 and G over 30 to 50% of the data, local and global fidelity. At the midpoint the curve is provably a rank correlation of distances. The LG reversal test decides, with a stated error rate, which of two maps is local and which global. On twelve datasets of up to 1.38 million points, G agrees with established global scores at 0.84 and 0.93, and the area under R_NX at 0.22 and 0.30. The entity fidelity E, read at each point's entity size, predicts which entities a map loses beyond L and G where entity sizes differ. In an agent memory of one million passages, t-SNE and PCA cross at 150,000 passages (p=2.6e-5).

Figures & tables

Explore similar work

CardsList
  1. DiRe-RAPIDS: Topology-faithful dimensionality reduction at scale

    Apr 28, 2026Alexander Kolpakov, Igor RivinData VisualizationManifold Learning

  2. Understanding Differentiable Embeddings Through Differential and Integral Geometry

    Aug 7, 2026Xinyu Zhang, Klaus MuellerDimensionality Reduction