SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator
0 references·5 citing·10 second hop
Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator (2018)Regret Bounds for Robust Adaptive Control…Naive Exploration is Optimal for Online LQR (2020)Naive Exploration is Optimal …Information Theoretic Regret Bounds for Online Nonlinear Control (2020)Information Theoretic Regret …Improper Learning for Non-Stochastic Control (2020)Improper Learning for Non-Sto…The Nonstochastic Control Problem (2019)The Nonstochastic Control Pro…Learning Linear-Quadratic Regulators Efficiently with only $\sqrt{T}$ Regret (2019)Learning Linear-Quadratic Reg…Near-optimal Regret Bounds for Reinforcement Learning (2010)Improved Algorithms for Linear Stochastic Bandits (2011)Regret Bounds for the Adaptive Control of Linear Quadratic Systems (2011)Prediction, Learning, and Games (2006)Online Learning and Online Convex Optimization (2011)Introduction to Online Convex Optimization (2016)On the Complexity of Best Arm Identification in Multi-Armed Bandit Models (2014)Logarithmic regret algorithms for online convex optimization (2007)Stochastic Linear Optimization Under Bandit Feedback (2008)An Empirical Evaluation of Thompson Sampling (2011)
this work references cited by second hop

References

No references inside the corpus for this window.

Cited by

  • 2020Improper Learning for Non-Stochastic Control76 cited
  • 2020Naive Exploration is Optimal for Online LQR70 cited
  • 2019Learning Linear-Quadratic Regulators Efficiently with only $\sqrt{T}$ Regret48 cited
  • 2019The Nonstochastic Control Problem47 cited
  • 2020Information Theoretic Regret Bounds for Online Nonlinear Control41 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work