{"total":33,"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.06933","title":"Revisiting Smoothed Online Learning","created":"2021-02-13","cited_by_count":29,"area":null},{"id":"2110.13116","title":"Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds","created":"2021-10-25","cited_by_count":20,"area":null},{"id":"2206.11780","title":"Chasing Convex Bodies and Functions with Black-Box Advice","created":"2022-06-23","cited_by_count":19,"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":"2102.03803","title":"Lazy OCO: Online Convex Optimization on a Switching Budget","created":"2021-02-07","cited_by_count":14,"area":null},{"id":"2202.03519","title":"Smoothed Online Optimization with Unreliable Predictions","created":"2022-02-07","cited_by_count":10,"area":null},{"id":"2310.20598","title":"Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms","created":"2023-10-31","cited_by_count":10,"area":null},{"id":"2101.09438","title":"An Optimal Reduction of TV-Denoising to Adaptive Online Learning","created":"2021-01-23","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":"2107.13657","title":"Competitive Control","created":"2021-07-28","cited_by_count":8,"area":null},{"id":"2403.07413","title":"Learning-Augmented Algorithms with Explicit Predictors","created":"2024-03-12","cited_by_count":8,"area":null},{"id":"2103.11370","title":"Online Convex Optimization with Continuous Switching Constraint","created":"2021-03-21","cited_by_count":6,"area":null},{"id":"2204.08572","title":"Expert-Calibrated Learning for Online Optimization with Switching Costs","created":"2022-04-18","cited_by_count":6,"area":null},{"id":"2205.00741","title":"Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor","created":"2022-05-02","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":"2111.00095","title":"Online Optimization with Feedback Delay and Nonlinear Switching Cost","created":"2021-10-29","cited_by_count":5,"area":null},{"id":"2305.00677","title":"Robustified Learning for Online Optimization with Memory Costs","created":"2023-05-01","cited_by_count":4,"area":null},{"id":"2402.14012","title":"Chasing Convex Functions with Long-term Constraints","created":"2024-02-21","cited_by_count":4,"area":null},{"id":"2605.07386","title":"Convex Optimization with Nested Evolving Feasible Sets","created":"2026-05-08","cited_by_count":4,"area":null},{"id":"2310.11880","title":"Online Convex Optimization with Switching Cost and Delayed Gradients","created":"2023-10-18","cited_by_count":3,"area":null},{"id":"2310.20098","title":"Robust Learning for Smoothed Online Convex Optimization with Feedback Delay","created":"2023-10-31","cited_by_count":3,"area":null},{"id":"2311.00181","title":"Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization","created":"2023-10-31","cited_by_count":2,"area":null},{"id":"2601.15984","title":"Partially Lazy Gradient Descent for Smoothed Online Learning","created":"2026-01-22","cited_by_count":2,"area":null},{"id":"2602.06902","title":"Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory","created":"2026-02-06","cited_by_count":2,"area":null},{"id":"2303.11522","title":"Online Learning for Equilibrium Pricing in Markets under Incomplete Information","created":"2023-03-21","cited_by_count":1,"area":null},{"id":"2306.10158","title":"Learning-Augmented Decentralized Online Convex Optimization in Networks","created":"2023-06-16","cited_by_count":1,"area":null},{"id":"2408.07831","title":"Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints","created":"2024-08-14","cited_by_count":1,"area":null},{"id":"2507.04133","title":"Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation","created":"2025-07-05","cited_by_count":1,"area":null},{"id":"2403.17480","title":"Capacity Provisioning Motivated Online Non-Convex Optimization Problem with Memory and Switching Cost","created":"2024-03-26","cited_by_count":0,"area":null},{"id":"2512.11131","title":"Fairness-Regularized Online Optimization with Switching Costs","created":"2025-12-11","cited_by_count":0,"area":null},{"id":"2608.09366","title":"Beyond Binary: Continuous State Optimization with Graph-Structured Objectives","created":"2026-08-10","cited_by_count":0,"area":null},{"id":"2609.30556","title":"Dynamic Regret in Online Convex Optimization with Indicator Switching Costs","created":"2026-09-24","cited_by_count":0,"area":null}],"next_cursor":null}