{"total":31,"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":"2103.05324","title":"A Simple Approach for Non-stationary Linear Bandits","created":"2021-03-09","cited_by_count":54,"area":null},{"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":"2207.02121","title":"Adapting to Online Label Shift with Provable Guarantees","created":"2022-07-05","cited_by_count":26,"area":null},{"id":"2205.11264","title":"Adaptive Fairness-Aware Online Meta-Learning for Changing Environments","created":"2022-05-20","cited_by_count":17,"area":null},{"id":"2207.02829","title":"Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods","created":"2022-07-06","cited_by_count":15,"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":"2102.01623","title":"Adversarial Tracking Control via Strongly Adaptive Online Learning with Memory","created":"2021-02-02","cited_by_count":14,"area":null},{"id":"2203.07322","title":"Efficient Model-based Multi-agent Reinforcement Learning via Optimistic Equilibrium Computation","created":"2022-03-14","cited_by_count":14,"area":null},{"id":"2305.11726","title":"Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees","created":"2023-05-19","cited_by_count":13,"area":null},{"id":"2210.05584","title":"On Adaptivity in Non-stationary Stochastic Optimization With Bandit Feedback","created":"2022-10-11","cited_by_count":11,"area":null},{"id":"2306.01007","title":"Towards Fair Disentangled Online Learning for Changing Environments","created":"2023-05-31","cited_by_count":11,"area":null},{"id":"2108.06411","title":"Optimal and Efficient Algorithms for General Mixable Losses against Switching Oracles","created":"2021-08-13","cited_by_count":10,"area":null},{"id":"2203.01400","title":"Adaptive Gradient Methods with Local Guarantees","created":"2022-03-02","cited_by_count":8,"area":null},{"id":"2208.10790","title":"Event-Triggered Time-Varying Bayesian Optimization","created":"2022-08-23","cited_by_count":7,"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":"2301.09808","title":"On Dynamic Regret and Constraint Violations in Constrained Online Convex Optimization","created":"2023-01-24","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":"2207.00646","title":"On the Computational Efficiency of Adaptive and Dynamic Regret Minimization","created":"2022-07-01","cited_by_count":2,"area":null},{"id":"2402.12319","title":"Dynamic Environment Responsive Online Meta-Learning with Fairness Awareness","created":"2024-02-19","cited_by_count":2,"area":null},{"id":"2606.03831","title":"Online Learning with Gradient-Variation Interval Regret","created":"2026-06-02","cited_by_count":2,"area":null},{"id":"2109.13786","title":"Near-Linear Time Algorithm with Near-Logarithmic Regret Per Switch for Mixable/Exp-Concave Losses","created":"2021-09-28","cited_by_count":1,"area":null},{"id":"2205.00473","title":"A Survey on Distributed Online Optimization and Game","created":"2022-05-01","cited_by_count":1,"area":null},{"id":"2401.09278","title":"Adaptive Regret for Bandits Made Possible: Two Queries Suffice","created":"2024-01-17","cited_by_count":1,"area":null},{"id":"2506.02980","title":"Non-stationary Bandit Convex Optimization: A Comprehensive Study","created":"2025-06-03","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":"2609.34423","title":"On the Relation Between Interval Regret and Dynamic Regret","created":"2026-09-28","cited_by_count":1,"area":null},{"id":"2504.03499","title":"Optimistic Learning for Communication Networks","created":"2025-04-04","cited_by_count":0,"area":null},{"id":"2610.02258","title":"Parameter-Free Interval-Dynamic Regret under Heavy-Tailed Noise","created":"2026-09-30","cited_by_count":0,"area":null}],"next_cursor":null}