Metraipolis › archive › dc_4ef4a77927da

Rotation-Based Subspace Tracking for Robust Kernel PCA on Streaming Data — arXiv:2609.15488

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15488
License (as archived)
CC0-1.0
Archived
2026-10-16T00:11:42.915Z
SHA-256 of the archived text
f5e6517739a8351dec4299445a82dd5a46c741c87d13674ee8088a6ee2a0575f
Stable URL of this page
https://metraipolis.com/documento/dc_4ef4a77927da

How to cite

Rotation-Based Subspace Tracking for Robust Kernel PCA on Streaming Data — arXiv:2609.15488 — arXiv (en), https://arxiv.org/abs/2609.15488 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4ef4a77927da (Metraipolis archive dc_4ef4a77927da, sha256 f5e6517739a8351dec4299445a82dd5a46c741c87d13674ee8088a6ee2a0575f)
BibTeX
@misc{dc4ef4a77927da,
  title = {Rotation-Based Subspace Tracking for Robust Kernel PCA on Streaming Data — arXiv:2609.15488},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15488},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4ef4a77927da; sha256 f5e6517739a8351dec4299445a82dd5a46c741c87d13674ee8088a6ee2a0575f},
  year = {2026}
}

Archived text

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

Machine learning models process large amounts of data, and Principal Component Analysis (PCA) is a widely used technique to reduce the dimensionality of the data and extract useful features. In practice, datasets often change over time (data drift) and/or arrive one sample at a time (streaming data), making it infeasible to process the entire dataset at once in batch mode. Real-world data also often contains nonlinear patterns, which traditional PCA cannot extract. Kernel PCA addresses this by implicitly mapping samples into a Reproducing Kernel Hilbert Space (RKHS). Raw data also often contains outliers, which can have an outsized effect on the estimated subspace unless the algorithm is made robust. However, existing online robust kernel PCA algorithms are designed to converge to a subspace that is assumed to be fixed, and gradient-descent-based updates lose their effectiveness at tracking further changes once this initial alignment is achieved. This paper introduces a rotation-based update mechanism, which updates the subspace estimate by rotating it toward each new incoming feature vector in Reproducing Kernel Hilbert Space, rather than relying on gradient descent alone. We present two complementary rotation strategies, and show that the extent of rotation can be moderated by a robust influence function to mitigate the effect of outliers. Through experiments on synthetic streaming data with a known ground-truth subspace, we show that per-sample rotations converge faster than gradient descent alone, demonstrating an effective mechanism for dynamically tracking a nonlinear subspace in streaming data.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-15 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.15488 — 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-15T23:54:14.765Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).