Metraipolis › archive › dc_c7344ced0739

LoomSC: Scalable Deep Subspace Clustering with Projector Factorization and Exact Spectral Reduction — arXiv:2610.10266

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.10266
License (as archived)
CC0-1.0
Archived
2026-10-08T11:12:02.407Z
SHA-256 of the archived text
ef1e1e55b4137277a6e5450711dcac2e0edf43b2f39284cfbc016eca10105613
Stable URL of this page
https://metraipolis.com/documento/dc_c7344ced0739

How to cite

LoomSC: Scalable Deep Subspace Clustering with Projector Factorization and Exact Spectral Reduction — arXiv:2610.10266 — arXiv (en), https://arxiv.org/abs/2610.10266 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c7344ced0739 (Metraipolis archive dc_c7344ced0739, sha256 ef1e1e55b4137277a6e5450711dcac2e0edf43b2f39284cfbc016eca10105613)
BibTeX
@misc{dcc7344ced0739,
  title = {LoomSC: Scalable Deep Subspace Clustering with Projector Factorization and Exact Spectral Reduction — arXiv:2610.10266},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.10266},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c7344ced0739; sha256 ef1e1e55b4137277a6e5450711dcac2e0edf43b2f39284cfbc016eca10105613},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10266. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Dense self-expression matrices and full-affinity spectral clustering limit the scalability of subspace clustering. We introduce the Latent Orthogonal Optimization Model for Subspace Clustering (LoomSC), a framework that addresses both bottlenecks through projector factorization and exact spectral reduction. Motivated by the spectral structure of least-squares regression, LoomSC jointly learns latent features and a projector self-representation through two thin factors. Alternating Procrustes and least-squares updates preserve the sample factor's orthogonality while keeping the coefficient matrix implicit. We construct a nonnegative quadratic affinity that preserves the projector's support. An exact feature map then reduces its normalized spectral problem to an eigenproblem whose dimension depends only on the factor width. Neither the full affinity nor the sample Laplacian needs to be formed. Our analysis quantifies the projector approximation and identifies conditions for subspace preservation and within-subspace connectivity. For fixed dimensions and iteration budgets, the complete pipeline has linear time and memory complexity in the number of samples. Across five image-clustering benchmarks, LoomSC ranks first or second in all 15 dataset-metric comparisons against 9 state-of-the-art baselines. Its mean accuracy exceeds the highest baseline mean by 6.66 percentage points. Synthetic experiments scale to 500,000 samples while maintaining at least 99.8% accuracy.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2610.10266 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T10:14:06.170Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).