Controlling unknown linear dynamics with almost optimal regret
Here and in a companion paper, we consider a simple control problem in which the underlying dynamics depend on a parameter a that is unknown and must be learned. In this paper, we assume that a can be any real number and we do not assume that we have a prior belief about a . We seek a control strategy that minimizes a quantity called the regret. Given any \varepsilon>0 , we produce a strategy that minimizes the regret to within a multiplicative factor of (1+\varepsilon) .
Authors
- Maximilian F. Eggl (ORCID: https://orcid.org/0000-0001-5815-1045)
- Jacob Carruth
- Charles Fefferman (ORCID: https://orcid.org/0000-0002-9565-6488)
- Clarence W. Rowley (ORCID: https://orcid.org/0000-0002-9099-5739)
Institutions
- University of Bonn (DE)
- Princeton University (US)
Publication Details
- Journal
- Revista Matemática Iberoamericana
- Published
- 2024-11-21
- DOI
- https://doi.org/10.4171/rmi/1511
- Primary Topic
- Advanced Bandit Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Joachim Herz Stiftung
- Air Force Office of Scientific Research