mlsanityData to 7 Oct 2026

Adversarial Tracking Control via Strongly Adaptive Online Learning with Memory

arXiv 2102.01623 ↗First posted 2 Feb 2021cs.LG cs.SY eess.SYcited by 14

Not on the map. Why?

Abstract (arXiv)

We consider the problem of tracking an adversarial state sequence in a linear dynamical system subject to adversarial disturbances and loss functions, generalizing earlier settings in the literature. To this end, we develop three techniques, each of independent interest. First, we propose a comparator-adaptive algorithm for online linear optimization with movement cost. Without tuning, it nearly matches the performance of the optimally tuned gradient descent in hindsight. Next, considering a related problem called online learning with memory, we construct a novel strongly adaptive algorithm that uses our first contribution as a building block. Finally, we present the first reduction from adversarial tracking control to strongly adaptive online learning with memory. Summarizing these individual techniques, we obtain an adversarial tracking controller with a strong performance guarantee even when the reference trajectory has a large range of movement.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 32 of its 65 references that are in the map. First posted on arXiv 2 Feb 2021.

Builds on

32 of 65 references.

References · 32

  1. 2019Introduction to Online Convex Optimizationcited by 793
  2. 2019Online Learning: A Modern Introduction Using Convex Optimizationcited by 407
  3. 2017On the Sample Complexity of the Linear Quadratic Regulatorcited by 151
  4. 2013Online Learning under Delayed Feedbackcited by 137
  5. 2016Coin Betting and Parameter-Free Online Learningcited by 131
  6. 2018Black-Box Reductions for Parameter-free Online Learning in Banach Spacescited by 124
  7. 2015Strongly Adaptive Online Learningcited by 102
  8. 2015Online Optimization : Competing with Dynamic Comparatorscited by 99
  9. 2019Online Control with Adversarial Disturbancescited by 92
  10. 2020Improper Learning for Non-Stochastic Controlcited by 83
  11. 2013Online Learning with Switching Costs and Other Adaptive Adversariescited by 60
  12. 2020Lipschitz and Comparator-Norm Adaptivity in Online Learningcited by 57
20 more
  1. 2018Online Linear Quadratic Controlcited by 55
  2. 2016Improved Strongly Adaptive Online Learning using Coin Bettingcited by 48
  3. 2014Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximationscited by 46
  4. 2016Improved Dynamic Regret for Non-degenerate Functionscited by 46
  5. 2019An Optimal Algorithm for Adversarial Bandits with Arbitrary Delayscited by 44
  6. 2020Logarithmic Regret for Adversarial Online Controlcited by 41
  7. 2019Online Optimal Control with Linear Dynamics and Predictions: Algorithms and Regret Analysiscited by 40
  8. 2019Logarithmic Regret for Online Controlcited by 38
  9. 2020Adaptive Regret for Control of Time-Varying Dynamicscited by 38
  10. 2018Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descentcited by 33
  11. 2019Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimizationcited by 31
  12. 2020The Power of Predictions in Online Controlcited by 31
  13. 2020Minimizing Dynamic Regret and Adaptive Regret Simultaneouslycited by 30
  14. 2019Adaptive Regret of Convex and Smooth Functionscited by 24
  15. 2020Making Non-Stochastic Control (Almost) as Easy as Stochasticcited by 24
  16. 2015Online Convex Optimization Using Predictionscited by 16
  17. 2015Online Gradient Boostingcited by 15
  18. 2019Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functionscited by 15
  19. 2018Online Learning: Sufficient Statistics and the Burkholder Methodcited by 13
  20. 2020Online learning with dynamics: A minimax perspectivecited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 5; 2023: 3; 2024: 2; 2025: 1; 2026: 2.

14 papers.

Sort: