Metraipolis › archive › dc_875d3d8716cc

Distributed online learning with growing dimensions for stochastic large regression — arXiv:2610.39197

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.39197
License (as archived)
CC0-1.0
Archived
2026-11-01T02:32:11.679Z
SHA-256 of the archived text
d04625e10b8d9b68b9f2e21dbe37802cd32012744d575bfa39d0e3056c711a12
Stable URL of this page
https://metraipolis.com/documento/dc_875d3d8716cc

How to cite

Distributed online learning with growing dimensions for stochastic large regression — arXiv:2610.39197 — arXiv (en), https://arxiv.org/abs/2610.39197 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_875d3d8716cc (Metraipolis archive dc_875d3d8716cc, sha256 d04625e10b8d9b68b9f2e21dbe37802cd32012744d575bfa39d0e3056c711a12)
BibTeX
@misc{dc875d3d8716cc,
  title = {Distributed online learning with growing dimensions for stochastic large regression — arXiv:2610.39197},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.39197},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_875d3d8716cc; sha256 d04625e10b8d9b68b9f2e21dbe37802cd32012744d575bfa39d0e3056c711a12},
  year = {2026}
}

Archived text

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

This paper investigates distributed online estimation and prediction for stochastic large regression models with infinitely many unknown parameters. Existing distributed estimation methods are mostly restricted to finite-dimensional parameter spaces, making them inadequate for emerging infinite-dimensional modeling applications. To tackle this problem, this paper proposes a fully distributed online recursive least squares algorithm with dynamically growing model this http URL algorithm is constructed with an incrementally augmentable recursive structure, where new parameter dimensions can be embedded in the recursion via zero-padded covariance and estimate augmentation without this http URL almost sure convergence of the algorithm is established under a weak cooperative non-persistent excitation condition, without requiring independence or stationarity assumptions on the this http URL condition integrates spatio-temporal network information and extends existing finite-dimensional results. The paper further derives an almost sure upper bound on the accumulated prediction regret without any excitation conditions. It is proven that the average regret converges to zero almost surely for a broad class of dimension growth sequences, with the optimal finite-dimensional regret bound recovered as a special case. Finally, numerical simulations are conducted to verify the effectiveness of our theoretical findings.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.39197 — 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-11-01T02:14:28.313Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).