arXiv Machine Learning August 4, 2026 By Adel Kaleche

How fine a change can moments see? A scale law for detecting distribution shift, with a kernel calibration rule

Read the original on arXiv Machine Learning →

arXiv:2608. 01268v1 Announce Type: cross Abstract: Detecting that a stream of high-dimensional embeddings has changed is usually framed as a choice of statistic.

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

Sep 15

Low-Dimensional Embeddings for Gaussian Kernels on Manifolds

arXiv:2609.15179v1 Announce Type: cross Abstract: The Gaussian kernel is a widely used similarity measure underlying kernel methods such as kernel PCA and spectral clustering, but computing Gaussian...

By Soumik Dutta, Kunal Dutta

rag

arXiv Machine Learning

Aug 14

Dimension-Calibrated Unexplained Mass: An Interpretable Drift Statistic for Contamination Monitoring in Data Streams

arXiv:2607. 16811v4 Announce Type: replace Abstract: Drift detectors that work tend not to explain themselves, and drift detectors that explain themselves tend to fail in high dimension.

By Behnam Asadi

benchmarks

arXiv Machine Learning

Jun 9

Are Two Datasets Close Enough With Statistical Significance? A Kernel Distributional Closeness Testing Approach

arXiv:2507. 12843v3 Announce Type: replace Abstract: Are two distributions close to each other with statistical significance?

By Zhijian Zhou, Liuhua Peng, Xunye Tian, Mingming Gong, Feng Liu

arXiv AI

Jun 2

UR-JEPA: Uniform Rectifiability as a Regularizer for Joint-Embedding Predictive Architectures

arXiv:2606. 01443v1 Announce Type: cross Abstract: A central difficulty in training Joint-Embedding Predictive Architectures (JEPAs) is preventing representation collapse.

By Triet M. Le

rag

arXiv Machine Learning

Aug 17

High-dimensional nonparametric changepoint detection via low-rank degree-two density projection

arXiv:2608. 13922v1 Announce Type: new Abstract: Detecting distributional changes in high dimension is difficult when neither the pre-change nor post-change density is parametrically specified.

By Guoqing Zhang, Zhaixin Chen

efficiency benchmarks

arXiv Machine Learning

Sep 3

Exact Limits of Random Projections for Preserving Geometry: Distance Recovery, Nearest-Neighbor Rankings, and Covariance Shape in Gaussian Models

arXiv:2609. 02155v1 Announce Type: new Abstract: The Johnson-Lindenstrauss (JL) lemma guarantees that a random projection of $n$ points to $m=O(\varepsilon^{-2}\log n)$ dimensions preserves pairwise squared distances within relative error $\varepsilon$ with high probability, and this dimension order is asymptotically optimal.

By Piyush Sao

One email a morning, machine-written

Related stories

Low-Dimensional Embeddings for Gaussian Kernels on Manifolds

Dimension-Calibrated Unexplained Mass: An Interpretable Drift Statistic for Contamination Monitoring in Data Streams

Are Two Datasets Close Enough With Statistical Significance? A Kernel Distributional Closeness Testing Approach

UR-JEPA: Uniform Rectifiability as a Regularizer for Joint-Embedding Predictive Architectures

High-dimensional nonparametric changepoint detection via low-rank degree-two density projection

Exact Limits of Random Projections for Preserving Geometry: Distance Recovery, Nearest-Neighbor Rankings, and Covariance Shape in Gaussian Models