{"total":24,"rows":[{"id":"2102.03758","title":"Non-stationary Online Learning with Memory and Non-stochastic Control","created":"2021-02-07","cited_by_count":33,"area":null},{"id":"2102.01623","title":"Adversarial Tracking Control via Strongly Adaptive Online Learning with Memory","created":"2021-02-02","cited_by_count":14,"area":null},{"id":"2310.11428","title":"Butterfly Effects of SGD Noise: Error Amplification in Behavior Cloning and Autoregression","created":"2023-10-17","cited_by_count":14,"area":null},{"id":"2202.07890","title":"Online Control of Unknown Time-Varying Dynamical Systems","created":"2022-02-16","cited_by_count":13,"area":null},{"id":"2106.12097","title":"Regret-optimal Estimation and Control","created":"2021-06-22","cited_by_count":10,"area":null},{"id":"2104.05087","title":"Learning from Censored and Dependent Data: The case of Linear Dynamics","created":"2021-04-11","cited_by_count":9,"area":null},{"id":"2205.06846","title":"Optimal Comparator Adaptive Online Learning with Switching Cost","created":"2022-05-13","cited_by_count":9,"area":null},{"id":"2102.13478","title":"A Regret Minimization Approach to Iterative Learning Control","created":"2021-02-26","cited_by_count":8,"area":null},{"id":"2305.15352","title":"Optimal Rates for Bandit Nonstochastic Control","created":"2023-05-24","cited_by_count":7,"area":null},{"id":"2206.09257","title":"Optimal Dynamic Regret in LQR Control","created":"2022-06-18","cited_by_count":6,"area":null},{"id":"2211.11219","title":"Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret","created":"2022-11-21","cited_by_count":6,"area":null},{"id":"2402.10036","title":"Predictive Linear Online Tracking for Unknown Targets","created":"2024-02-15","cited_by_count":5,"area":null},{"id":"2203.01170","title":"Efficient Online Linear Control with Stochastic Convex Costs and Unknown Dynamics","created":"2022-03-02","cited_by_count":4,"area":null},{"id":"2310.02261","title":"Adaptive Online Non-stochastic Control","created":"2023-10-02","cited_by_count":3,"area":null},{"id":"2404.03309","title":"Optimistic Online Non-stochastic Control via FTRL","created":"2024-04-04","cited_by_count":3,"area":null},{"id":"2406.01799","title":"Online Control in Population Dynamics","created":"2024-06-03","cited_by_count":3,"area":null},{"id":"2407.11069","title":"Combining Federated Learning and Control: A Survey","created":"2024-07-12","cited_by_count":3,"area":null},{"id":"2512.23190","title":"A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization","created":"2025-12-29","cited_by_count":3,"area":null},{"id":"2206.01782","title":"Optimal Competitive-Ratio Control","created":"2022-06-03","cited_by_count":2,"area":null},{"id":"2305.17552","title":"Online Nonstochastic Model-Free Reinforcement Learning","created":"2023-05-27","cited_by_count":2,"area":null},{"id":"2410.00993","title":"Tight Rates for Bandit Control Beyond Quadratics","created":"2024-10-01","cited_by_count":2,"area":null},{"id":"2510.16208","title":"Explore-then-Commit for Nonstationary Linear Bandits with Latent Dynamics","created":"2025-10-17","cited_by_count":2,"area":null},{"id":"2305.00154","title":"Learning to Seek: Multi-Agent Online Source Seeking Against Non-Stochastic Disturbances","created":"2023-04-29","cited_by_count":0,"area":null},{"id":"2506.18814","title":"Online Multi-Agent Control with Adversarial Disturbances","created":"2025-06-23","cited_by_count":0,"area":null}],"next_cursor":null}