arXiv Machine Learning August 6, 2026 By R\'emi Delogne, Laurent Jacques

Random features for Grassmannian kernel approximation with bounded rank-one projections

Read the original on arXiv Machine Learning →

arXiv:2608. 04227v1 Announce Type: new Abstract: We propose a family of random feature maps for scalable kernel machines on low-dimensional subspaces, ie on the Grassmannian manifold.

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

Jun 30

Geometrically Principled Randomized Optimization for Efficient LLM Training

arXiv:2510. 01878v2 Announce Type: replace Abstract: Low-rank gradient optimization for large language models is currently divided into two categories: structured methods that rigorously identify subspaces, and randomized approaches employed primarily for computational efficiency.

By Sahar Rajabi, Nayeema Nonta, Sirisha Rambhatla

llms benchmarks

arXiv Machine Learning

2d ago

Dimension-Free Rank Lifting from Random Hyperplane Arrangements

arXiv:2609.39855v1 Announce Type: new Abstract: We study the width required for a randomly initialized hidden layer of a neural network to achieve rank lifting. Namely, given a dataset $X \in \mathbb...

By Luca Becchetti, Matteo Russo, Ruben Skorupinski

arXiv Machine Learning

Jul 15

Kernel PCA for Out-of-Distribution Detection: Non-Linear Kernel Selection and Approximation

arXiv:2505. 15284v2 Announce Type: replace Abstract: Out-of-Distribution (OoD) detection is vital for the reliability of deep neural networks, the key of which lies in effectively characterizing the disparities between OoD and In-Distribution (InD) data.

By Kun Fang, Qinghua Tao, Mingzhen He, Kexin Lv, Runze Yang, Haibo Hu, Xiaolin Huang, Jie Yang, Longbing Cao

arXiv Machine Learning

Sep 15

Rotation-Based Subspace Tracking for Robust Kernel PCA on Streaming Data

arXiv:2609.15488v1 Announce Type: new Abstract: Machine learning models process large amounts of data, and Principal Component Analysis (PCA) is a widely used technique to reduce the dimensionality o...

By Kris Lokere, John Fossaceca

safety

arXiv Machine Learning

Jul 27

gp2Scale: A Class of Compactly Supported Non-Stationary Kernels and Distributed Computing for Exact Gaussian Processes on 10 Million Data Points

arXiv:2512. 06143v2 Announce Type: replace Abstract: Despite a large corpus of recent work on scaling up Gaussian processes, a stubborn trade-off between computational speed, prediction and uncertainty quantification accuracy, and customizability persists.

By Marcus M. Noack, Mark D. Risser, Hengrui Luo, Vardaan Tekriwal, Ronald J. Pandolfi

benchmarks

arXiv Machine Learning

Jun 17

Expanding SPHERE-JEPA: A Family of Statistical Regularizers for the Hypersphere

arXiv:2606. 17603v1 Announce Type: new Abstract: In Self-Supervised Learning (SSL), preventing representation collapse by explicitly enforcing a uniform distribution on the unit hypersphere has proven to be effective.

By L\'eo Nicollier (CB, ATT), Enric Meinhardt-Llopis (CB), Max Dunitz (ATT), Marc Pic (ATT), Pablo Mus\'e (CB, IFUMI), Gabriele Facciolo (CB)

diffusion safety

One email a morning, machine-written

Related stories

Geometrically Principled Randomized Optimization for Efficient LLM Training

Dimension-Free Rank Lifting from Random Hyperplane Arrangements

Kernel PCA for Out-of-Distribution Detection: Non-Linear Kernel Selection and Approximation

Rotation-Based Subspace Tracking for Robust Kernel PCA on Streaming Data

gp2Scale: A Class of Compactly Supported Non-Stationary Kernels and Distributed Computing for Exact Gaussian Processes on 10 Million Data Points

Expanding SPHERE-JEPA: A Family of Statistical Regularizers for the Hypersphere