SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Logarithmic Regret for Online Control
0 references·5 citing·10 second hop
Logarithmic Regret for Online Control (2019)Logarithmic Regret for Online ControlOnline Optimization with Memory and Competitive Control (2020)Online Optimization with Memo…Logarithmic Regret for Learning Linear Quadratic Regulators Efficiently (2020)Logarithmic Regret for Learni…Logarithmic Regret for Adversarial Online Control (2020)Logarithmic Regret for Advers…Information Theoretic Regret Bounds for Online Nonlinear Control (2020)Information Theoretic Regret …The Nonstochastic Control Problem (2019)The Nonstochastic Control Pro…Prediction, Learning, and Games (2006)Online Learning and Online Convex Optimization (2011)Introduction to Online Convex Optimization (2016)Improved Algorithms for Linear Stochastic Bandits (2011)Regret Bounds for the Adaptive Control of Linear Quadratic Systems (2011)Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator (2018)Logarithmic regret algorithms for online convex optimization (2007)Online Control with Adversarial Disturbances (2019)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

  • 2019The Nonstochastic Control Problem47 cited
  • 2020Information Theoretic Regret Bounds for Online Nonlinear Control41 cited
  • 2020Logarithmic Regret for Adversarial Online Control37 cited
  • 2020Logarithmic Regret for Learning Linear Quadratic Regulators Efficiently35 cited
  • 2020Online Optimization with Memory and Competitive Control31 cited

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