Approximate Thompson Sampling for Learning Linear Quadratic Regulators with $O(\sqrtT)$ Regret
<|reference_start|>Approximate Thompson Sampling for Learning Linear Quadratic Regulators with $O(\sqrtT)$ Regret: We propose an approximate Thompson sampling algorithm that learns linear quadratic regulators (LQR) with an improved Bayesian regret bound of $O(\sqrt{T})$. Our method leverages Langevin dynamics with a meticulously designed preconditioner as well as a simple excitation mechanism. We show that the excitation signal induces the minimum eigenvalue of the preconditioner to grow over time, thereby accelerating the approximate posterior sampling process. Moreover, we identify nontrivial concentration properties of the approximate posteriors generated by our algorithm. These properties enable us to bound the moments of the system state and attain an $O(\sqrt{T})$ regret bound without the unrealistic restrictive assumptions on parameter sets that are often used in the literature.<|reference_end|>
@article{kim2024approximate,
    title={Approximate Thompson Sampling for Learning Linear Quadratic Regulators
  with $O(\sqrt{T})$ Regret},
    author={Yeoneung Kim, Gihun Kim, Insoon Yang},
    journal={arXiv preprint arXiv:2405.19380},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.19380},
    primaryClass={stat.ML cs.LG cs.SY eess.SY}
}