ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2402.10252
63
0
v1v2 (latest)

Online Control of Linear Systems under Unbounded Noise

15 February 2024
Kaito Ito
Taira Tsuchiya
ArXiv (abs)PDFHTML
Main:39 Pages
1 Tables
Appendix:2 Pages
Abstract

This paper investigates the problem of controlling a linear system under possibly unbounded stochastic noise with unknown convex cost functions, known as an online control problem. In contrast to the existing work, which assumes the boundedness of noise, we show that an O~(T) \tilde{O}(\sqrt{T}) O~(T​) high-probability regret can be achieved under unbounded noise, where T T T denotes the time horizon. Notably, the noise is only required to have a finite fourth moment. Moreover, when the costs are strongly convex and the noise is sub-Gaussian, we establish an O(poly(log⁡T)) O({\rm poly} (\log T)) O(poly(logT)) regret bound.

View on arXiv
@article{ito2025_2402.10252,
  title={ Online Control of Linear Systems under Unbounded Noise },
  author={ Kaito Ito and Taira Tsuchiya },
  journal={arXiv preprint arXiv:2402.10252},
  year={ 2025 }
}
Comments on this paper