arXiv AI
Clustering as Approximation by Constrained Projectors: Theory and Guarantees
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
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.
arXiv Machine Learning
Jun 30
Nonlinear mixture model motivated subspace clustering
arXiv:2606. 29261v1 Announce Type: new Abstract: We derive the linear union-of-subspaces (UoS) model for subspace clustering (SC) from the nonlinear mixture model (NMM) used in blind source separation (BSS) to represent a D-dimensional observation vector as an unknown multivariate nonlinear mapping of C latent variables.
arXiv Machine Learning
Aug 14
Manifold constrained steepest descent for smooth and closed-set optimization
arXiv:2601. 21487v2 Announce Type: replace-cross Abstract: We study minimization of smooth functions over feasible sets that have smooth embedded-manifold structure throughout or only on selected regions, using linear minimization oracles (LMOs) to determine search directions under user-chosen norms.
arXiv Machine Learning
Jun 15
Concatenated Matrix SVD: Compression Bounds, Incremental Approximation, and Error-Constrained Clustering
arXiv:2601. 11626v2 Announce Type: replace-cross Abstract: Large collections of matrices arise throughout modern machine learning, signal processing, and scientific computing, where they are commonly compressed by concatenation followed by truncated singular value decomposition (SVD).
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.
arXiv Machine Learning
Aug 17
Connected Subspace Clustering: Hardness, a Scalable Heuristic, and an Application to Sea Level Geodesy
arXiv:2608. 14215v1 Announce Type: new Abstract: Constrained optimization extends classical optimization by integrating side information, making it widely applicable across scientific and engineering domains.