{"total":29,"rows":[{"id":"2112.14368","title":"Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization","created":"2021-12-29","cited_by_count":66,"area":null},{"id":"2207.02121","title":"Adapting to Online Label Shift with Provable Guarantees","created":"2022-07-05","cited_by_count":26,"area":null},{"id":"2302.02552","title":"Adapting to Continuous Covariate Shift via Online Density Ratio Estimation","created":"2023-02-06","cited_by_count":15,"area":null},{"id":"2309.08911","title":"Efficient Methods for Non-stationary Online Learning","created":"2023-09-16","cited_by_count":15,"area":null},{"id":"2202.03519","title":"Smoothed Online Optimization with Unreliable Predictions","created":"2022-02-07","cited_by_count":10,"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":"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":"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":"2306.10158","title":"Learning-Augmented Decentralized Online Convex Optimization in Networks","created":"2023-06-16","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":"2507.07581","title":"CHOMET: Conditional Handovers via Meta-Learning","created":"2025-07-10","cited_by_count":1,"area":null},{"id":"2509.07901","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","created":"2025-09-09","cited_by_count":1,"area":null},{"id":"2609.20968","title":"From Switching to Dynamic Regret: A Simple Reduction via Unbiased Random Sequences","created":"2026-09-17","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":"2504.03499","title":"Optimistic Learning for Communication Networks","created":"2025-04-04","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":"2512.22022","title":"Meta-Learning-Based Handover Management in NextG O-RAN","created":"2025-12-26","cited_by_count":0,"area":null},{"id":"2601.09042","title":"SCaLE: Switching Cost aware Learning and Exploration","created":"2026-01-14","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}