Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
[2404.03211] Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Computer Science > Machine Learning arXiv:2404.03211 (cs) [Submitted on 4 Apr 2024 ( v1 ), last revised 17 Aug 2026 (this version, v7)] Title: Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data Authors: Yan Chen , Tao Li , Xiwei Zhang View a PDF of the paper titled Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data, by Yan Chen and 1 other authors View PDF HTML (experimental) Abstract: We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure. Subjects: Machine Learning (cs.LG) ; Systems and Control (eess.SY) Cite as: arXiv:2404.03211 [cs.LG] (or arXiv:2404.03211v7 [cs.LG] for this version) https://doi.org/10.48550/arXiv.2404.03211 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Tao Li [ view email ] [v1] Thu, 4 Apr 2024 05:35:59 UTC (149 KB) [v2] Sun, 26 May 2024 10:09:37 UTC (149 KB) [v3] Wed, 29 May 2024 11:48:59 UTC (149 KB) [v4] Sun, 9 Jun 2024 13:11:36 UTC (149 KB) [v5] Tue, 23 Sep 2025 06:21:41 UTC (211 KB) [v6] Thu, 23 Oct 2025 08:32:49 UTC (223 KB) [v7] Mon, 17 Aug 2026 02:15:48 UTC (1,687 KB) Full-text links: Access Paper: View a PDF of the paper titled Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data, by Yan Chen and 1 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cs.LG < prev | next > new | recent | 2024-04 Change to browse by: cs cs.SY eess eess.SY References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) IArxiv recommender toggle IArxiv Recommender ( What is IArxiv? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from
Related documents
- Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data#611243
- A Smoothed Discrepancy Principle for Random Feature Methods and Neural Networks#1034987
- Full-Covariance Smoothing of Bayesian Neural Networks for Online Adaptation#1063455
- Statistical inverse learning and $\ell^1$-regularization#349639
- Fast Generalized Neural Tangent Kernel Statistics via Trace Estimation#1144741
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive