Adversarial Tracking Control via Strongly Adaptive Online Learning with Memory
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
- 2019Introduction to Online Convex Optimizationcited by 793
- 2019Online Learning: A Modern Introduction Using Convex Optimizationcited by 407
- 2017On the Sample Complexity of the Linear Quadratic Regulatorcited by 151
- 2013Online Learning under Delayed Feedbackcited by 137
- 2016Coin Betting and Parameter-Free Online Learningcited by 131
- 2018Black-Box Reductions for Parameter-free Online Learning in Banach Spacescited by 124
- 2015Strongly Adaptive Online Learningcited by 102
- 2015Online Optimization : Competing with Dynamic Comparatorscited by 99
- 2019Online Control with Adversarial Disturbancescited by 92
- 2020Improper Learning for Non-Stochastic Controlcited by 83
- 2013Online Learning with Switching Costs and Other Adaptive Adversariescited by 60
- 2020Lipschitz and Comparator-Norm Adaptivity in Online Learningcited by 57
20 more
- 2018Online Linear Quadratic Controlcited by 55
- 2016Improved Strongly Adaptive Online Learning using Coin Bettingcited by 48
- 2014Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximationscited by 46
- 2016Improved Dynamic Regret for Non-degenerate Functionscited by 46
- 2019An Optimal Algorithm for Adversarial Bandits with Arbitrary Delayscited by 44
- 2020Logarithmic Regret for Adversarial Online Controlcited by 41
- 2019Online Optimal Control with Linear Dynamics and Predictions: Algorithms and Regret Analysiscited by 40
- 2019Logarithmic Regret for Online Controlcited by 38
- 2020Adaptive Regret for Control of Time-Varying Dynamicscited by 38
- 2018Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descentcited by 33
- 2019Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimizationcited by 31
- 2020The Power of Predictions in Online Controlcited by 31
- 2020Minimizing Dynamic Regret and Adaptive Regret Simultaneouslycited by 30
- 2019Adaptive Regret of Convex and Smooth Functionscited by 24
- 2020Making Non-Stochastic Control (Almost) as Easy as Stochasticcited by 24
- 2015Online Convex Optimization Using Predictionscited by 16
- 2015Online Gradient Boostingcited by 15
- 2019Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functionscited by 15
- 2018Online Learning: Sufficient Statistics and the Burkholder Methodcited by 13
- 2020Online learning with dynamics: A minimax perspectivecited by 8
Built on by
Citing papers per year: 2021: 1; 2022: 5; 2023: 3; 2024: 2; 2025: 1; 2026: 2.
14 papers.
Sort:
- 2023Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversioncited by 42
- 2021Non-stationary Online Learning with Memory and Non-stochastic Controlcited by 33
- 2022PDE-Based Optimal Strategy for Unconstrained Online Learningcited by 27
- 2022Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learningcited by 10
- 2022Optimal Comparator Adaptive Online Learning with Switching Costcited by 9
- 2022Adaptive Gradient Methods with Local Guaranteescited by 8
- 2022Smoothed Online Convex Optimization Based on Discounted-Normal-Predictorcited by 6
- 2023Efficient Online Learning with Memory via Frank-Wolfe Optimization: Algorithms with Bounded Dynamic Regret and Applications to Controlcited by 5
- 2024Predictive Linear Online Tracking for Unknown Targetscited by 5
- 2023Adaptive Online Non-stochastic Controlcited by 3
- 2024Optimistic Online Non-stochastic Control via FTRLcited by 3
- 2026Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memorycited by 2
- 2026Self-Adaptive Learning and Model Predictive Control for Tracking Unknown Dynamics with No Regret29 Jul 2026
- 2026Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory6 Feb 2026
- 2025Smoothed Online Optimization for Target Tracking: Robust and Learning-Augmented Algorithms7 Sep 2025
- 2024Optimistic Online Non-stochastic Control via FTRL4 Apr 2024
- 2024Predictive Linear Online Tracking for Unknown Targets15 Feb 2024
- 2023Adaptive Online Non-stochastic Control2 Oct 2023
- 2023Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion7 Feb 2023
- 2023Efficient Online Learning with Memory via Frank-Wolfe Optimization: Algorithms with Bounded Dynamic Regret and Applications to Control2 Jan 2023
- 2022Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning23 May 2022
- 2022Optimal Comparator Adaptive Online Learning with Switching Cost13 May 2022
- 2022Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor2 May 2022
- 2022Adaptive Gradient Methods with Local Guarantees2 Mar 2022
2 more
- 2023Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversioncited by 42
- 2021Non-stationary Online Learning with Memory and Non-stochastic Controlcited by 33
- 2022PDE-Based Optimal Strategy for Unconstrained Online Learningcited by 27
- 2022Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learningcited by 10
- 2022Optimal Comparator Adaptive Online Learning with Switching Costcited by 9
- 2022Adaptive Gradient Methods with Local Guaranteescited by 8
- 2022Smoothed Online Convex Optimization Based on Discounted-Normal-Predictorcited by 6
- 2023Efficient Online Learning with Memory via Frank-Wolfe Optimization: Algorithms with Bounded Dynamic Regret and Applications to Controlcited by 5
- 2024Predictive Linear Online Tracking for Unknown Targetscited by 5
- 2023Adaptive Online Non-stochastic Controlcited by 3
- 2024Optimistic Online Non-stochastic Control via FTRLcited by 3
- 2026Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memorycited by 2
12 most cited of 14 All 14 (JSON)
- 2026Self-Adaptive Learning and Model Predictive Control for Tracking Unknown Dynamics with No Regret29 Jul 2026
- 2026Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory6 Feb 2026
- 2025Smoothed Online Optimization for Target Tracking: Robust and Learning-Augmented Algorithms7 Sep 2025
- 2024Optimistic Online Non-stochastic Control via FTRL4 Apr 2024
- 2024Predictive Linear Online Tracking for Unknown Targets15 Feb 2024
- 2023Adaptive Online Non-stochastic Control2 Oct 2023
- 2023Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion7 Feb 2023
- 2023Efficient Online Learning with Memory via Frank-Wolfe Optimization: Algorithms with Bounded Dynamic Regret and Applications to Control2 Jan 2023
- 2022Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning23 May 2022
- 2022Optimal Comparator Adaptive Online Learning with Switching Cost13 May 2022
- 2022Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor2 May 2022
- 2022Adaptive Gradient Methods with Local Guarantees2 Mar 2022
12 newest of 14 All 14 (JSON)