SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Online Control with Adversarial Disturbances
0 references·5 citing·10 second hop
Online Control with Adversarial Disturbances (2019)Online Control with Adversarial Disturban…Online Optimization with Memory and Competitive Control (2020)Online Optimization with Memo…Naive Exploration is Optimal for Online LQR (2020)Naive Exploration is Optimal …Logarithmic Regret for Learning Linear Quadratic Regulators Efficiently (2020)Logarithmic Regret for Learni…Logarithmic Regret for Adversarial Online Control (2020)Logarithmic Regret for Advers…Improper Learning for Non-Stochastic Control (2020)Improper Learning for Non-Sto…Prediction, Learning, and Games (2006)Regret Bounds for the Adaptive Control of Linear Quadratic Systems (2011)On the Complexity of Best Arm Identification in Multi-Armed Bandit Models (2014)Logarithmic regret algorithms for online convex optimization (2007)Near-optimal Regret Bounds for Reinforcement Learning (2010)Improved Algorithms for Linear Stochastic Bandits (2011)Information Theoretic Regret Bounds for Online Nonlinear Control (2020)Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator (2018)Introduction to Online Convex Optimization (2016)Online Convex Optimization Using Predictions (2015)
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
  • 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