arXiv Machine Learning August 11, 2026 By Zeqin Lin, Guangming Pan, Zhixiang Zhang, Yinbing Zhou

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

Read the original on arXiv Machine Learning →

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.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jul 13

Group Invariant Spectral Embedding

arXiv:2607. 08987v1 Announce Type: new Abstract: Spectral embedding methods are widely used for dimensionality reduction and clustering of high-dimensional datasets with intrinsic low-dimensional structures.

By Yeari Vigder, Paulina Hoyos, David Thong, Joakim and\'en, Joe Kileel, Amit Moscovich

rag

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 Machine Learning

Jun 9

Entropic Optimal Transport Eigenmaps for Nonlinear Alignment and Joint Embedding of High-Dimensional Datasets

arXiv:2407. 01718v2 Announce Type: replace-cross Abstract: Embedding high-dimensional data into a low-dimensional space is an indispensable component of data analysis.

By Boris Landa, Yuval Kluger, Rong Ma

rag diffusion safety

arXiv Machine Learning

Jul 27

Data eccentricity, asymptotics of Gaussian RBF reproducing kernel Hilbert space, and kernel PCA

arXiv:2607. 21823v1 Announce Type: new Abstract: We show that, up to isotropic scaling, the Gaussian RBF reproducing kernel Hilbert space (RKHS) is asymptotically isometric to Euclidean space in the large bandwidth limit.

By Sergio A. Alvarez

rag

arXiv Machine Learning

Jun 24

Mixtures Closest to a Given Measure: A Semidefinite Programming Approach

arXiv:2509. 22879v2 Announce Type: replace-cross Abstract: Mixture models, such as Gaussian mixture models, are widely used in machine learning to represent complex data distributions.

By Sre\'cko {\DJ}ura\v{s}inovi\'c, Jean-Bernard Lasserre, Victor Magron

arXiv Machine Learning

6d ago

Spectral graph clustering with inhomogeneous latent geometry

arXiv:2608. 11321v1 Announce Type: cross Abstract: We study spectral clustering in the presence of a confounding latent geometry.

By Konstantin Avrachenkov, Lucas S. Sibemberg, Alexander Van Werde

Related stories

Group Invariant Spectral Embedding

Regularized Optimization on Grassmann Manifold: Theory, Algorithm and Applications

Entropic Optimal Transport Eigenmaps for Nonlinear Alignment and Joint Embedding of High-Dimensional Datasets

Data eccentricity, asymptotics of Gaussian RBF reproducing kernel Hilbert space, and kernel PCA

Mixtures Closest to a Given Measure: A Semidefinite Programming Approach

Spectral graph clustering with inhomogeneous latent geometry