{"total":46,"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":"2102.01046","title":"Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications","created":"2021-02-01","cited_by_count":52,"area":null},{"id":"2109.04504","title":"Bootstrapped Meta-Learning","created":"2021-09-09","cited_by_count":45,"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":"2102.06622","title":"MetaGrad: Adaptation using Multiple Learning Rates in Online Learning","created":"2021-02-12","cited_by_count":26,"area":null},{"id":"2309.08911","title":"Efficient Methods for Non-stationary Online Learning","created":"2023-09-16","cited_by_count":15,"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":"2408.09074","title":"Gradient-Variation Online Learning under Generalized Smoothness","created":"2024-08-17","cited_by_count":11,"area":null},{"id":"2206.06900","title":"Grad-GradaGrad? A Non-Monotone Adaptive Stochastic Gradient Method","created":"2022-06-14","cited_by_count":9,"area":null},{"id":"2307.08360","title":"Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach","created":"2023-07-17","cited_by_count":9,"area":null},{"id":"2501.14349","title":"Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound","created":"2025-01-24","cited_by_count":9,"area":null},{"id":"2102.00729","title":"Stochastic Online Convex Optimization. Application to probabilistic time series forecasting","created":"2021-02-01","cited_by_count":8,"area":null},{"id":"2302.05620","title":"Improved Dynamic Regret for Online Frank-Wolfe","created":"2023-02-11","cited_by_count":8,"area":null},{"id":"2112.14332","title":"Adaptive Client Sampling in Federated Learning via Online Learning with Bandit Feedback","created":"2021-12-28","cited_by_count":7,"area":null},{"id":"2303.03272","title":"Accelerated Rates between Stochastic and Adversarial Online Convex Optimization","created":"2023-03-06","cited_by_count":7,"area":null},{"id":"2506.10616","title":"Non-stationary Online Learning for Curved Losses: Improved Dynamic Regret via Mixability","created":"2025-06-12","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":"2302.08652","title":"Minimizing Dynamic Regret on Geodesic Metric Spaces","created":"2023-02-17","cited_by_count":6,"area":null},{"id":"2302.12120","title":"Sequential Counterfactual Risk Minimization","created":"2023-02-23","cited_by_count":6,"area":null},{"id":"2401.17401","title":"Step-size Optimization for Continual Learning","created":"2024-01-30","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":"2603.20826","title":"Simple Projection-Free Algorithm for Contextual Recommendation with Logarithmic Regret and Robustness","created":"2026-03-21","cited_by_count":6,"area":null},{"id":"2102.07521","title":"Distributed Online Learning for Joint Regret with Communication Constraints","created":"2021-02-15","cited_by_count":5,"area":null},{"id":"2507.05478","title":"Dynamic Regret Reduces to Kernelized Static Regret","created":"2025-07-07","cited_by_count":5,"area":null},{"id":"2602.04761","title":"Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variations","created":"2026-02-04","cited_by_count":5,"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":"2209.01608","title":"Dynamic Regret of Adaptive Gradient Methods for Strongly Convex Problems","created":"2022-09-04","cited_by_count":4,"area":null},{"id":"2405.14273","title":"Exact Solution to Data-Driven Inverse Optimization of MILPs in Finite Time via Gradient-Based Methods","created":"2024-05-23","cited_by_count":4,"area":null},{"id":"2305.12131","title":"Non-stationary Delayed Online Convex Optimization: From Full-information to Bandit Setting","created":"2023-05-20","cited_by_count":3,"area":null},{"id":"2301.03236","title":"Optimistic Meta-Gradients","created":"2023-01-09","cited_by_count":2,"area":null},{"id":"2505.17277","title":"Comparator-Adaptive $\\Phi$-Regret: Improved Bounds, Simpler Algorithms, and Applications to Games","created":"2025-05-22","cited_by_count":2,"area":null},{"id":"2505.19491","title":"Discounted Online Convex Optimization: Uniform Regret Across a Continuous Interval","created":"2025-05-26","cited_by_count":2,"area":null},{"id":"2607.22263","title":"Explicit Iteration Complexity of Exact Data-Driven Inverse Optimization for Integer Linear Programs","created":"2026-07-24","cited_by_count":2,"area":null},{"id":"2609.27206","title":"Prediction with Expert Advice: Anytime Regret with Many Experts Matches the Fixed-Time Constant","created":"2026-09-23","cited_by_count":2,"area":null},{"id":"2210.12663","title":"No-Regret Learning in Two-Echelon Supply Chain with Unknown Demand Distribution","created":"2022-10-23","cited_by_count":1,"area":null},{"id":"2402.12868","title":"Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets","created":"2024-02-20","cited_by_count":1,"area":null},{"id":"2405.19015","title":"Distributed Management of Fluctuating Energy Resources in Dynamic Networked Systems","created":"2024-05-29","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":"2607.27073","title":"Parameter-Free Dynamic Regret under Heavy-Tailed Noise","created":"2026-07-29","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":"2202.05996","title":"Mixture of Online and Offline Experts for Non-stationary Time Series","created":"2022-02-12","cited_by_count":0,"area":null},{"id":"2203.14520","title":"Optimistic Online Convex Optimization in Dynamic Environments","created":"2022-03-28","cited_by_count":0,"area":null},{"id":"2302.06066","title":"Universal Online Optimization in Dynamic Environments via Uniclass Prediction","created":"2023-02-13","cited_by_count":0,"area":null},{"id":"2306.06613","title":"Parameter-free version of Adaptive Gradient Methods for Strongly-Convex Functions","created":"2023-06-11","cited_by_count":0,"area":null},{"id":"2402.17720","title":"The SMART approach to instance-optimal online learning","created":"2024-02-27","cited_by_count":0,"area":null},{"id":"2602.13177","title":"Block-Norm Geometries for Online Mirror Descent with Sparse Losses","created":"2026-02-13","cited_by_count":0,"area":null}],"next_cursor":null}