{"total":24,"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":"2106.05135","title":"Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints","created":"2021-06-09","cited_by_count":39,"area":null},{"id":"2202.06151","title":"Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits","created":"2022-02-12","cited_by_count":22,"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":"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":"2202.07890","title":"Online Control of Unknown Time-Varying Dynamical Systems","created":"2022-02-16","cited_by_count":13,"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":"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":"2210.09385","title":"Adaptive Oracle-Efficient Online Learning","created":"2022-10-17","cited_by_count":7,"area":null},{"id":"2103.11370","title":"Online Convex Optimization with Continuous Switching Constraint","created":"2021-03-21","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":"2310.14085","title":"Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback","created":"2023-10-21","cited_by_count":6,"area":null},{"id":"2405.19705","title":"Universal Online Convex Optimization with $1$ Projection per Round","created":"2024-05-30","cited_by_count":6,"area":null},{"id":"2105.03681","title":"Universal Online Convex Optimization Meets Second-order Bounds","created":"2021-05-08","cited_by_count":4,"area":null},{"id":"2210.14998","title":"One Arrow, Two Kills: An Unified Framework for Achieving Optimal Regret Guarantees in Sleeping Bandits","created":"2022-10-26","cited_by_count":3,"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":"2609.34423","title":"On the Relation Between Interval Regret and Dynamic Regret","created":"2026-09-28","cited_by_count":1,"area":null},{"id":"2306.08320","title":"Nearly Optimal Algorithms with Sublinear Computational Complexity for Online Kernel Regression","created":"2023-06-14","cited_by_count":0,"area":null},{"id":"2408.06257","title":"Reciprocal Learning","created":"2024-08-12","cited_by_count":0,"area":null},{"id":"2511.23347","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","created":"2025-11-28","cited_by_count":0,"area":null},{"id":"2601.13519","title":"Small Gradient Norm Regret for Online Convex Optimization","created":"2026-01-20","cited_by_count":0,"area":null}],"next_cursor":null}