{"total":36,"rows":[{"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":"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":"2305.16284","title":"DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Method","created":"2023-05-25","cited_by_count":35,"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":"2102.00968","title":"CRPS Learning","created":"2021-02-01","cited_by_count":21,"area":null},{"id":"2306.00144","title":"Mechanic: A Learning Rate Tuner","created":"2023-05-31","cited_by_count":20,"area":null},{"id":"2405.09831","title":"Nearly Minimax Optimal Regret for Multinomial Logistic Bandit","created":"2024-05-16","cited_by_count":20,"area":null},{"id":"2507.11847","title":"Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update","created":"2025-07-16","cited_by_count":16,"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":"2402.07793","title":"Tuning-Free Stochastic Optimization","created":"2024-02-12","cited_by_count":13,"area":null},{"id":"2402.10898","title":"The Price of Adaptivity in Stochastic Convex Optimization","created":"2024-02-16","cited_by_count":11,"area":null},{"id":"2408.09074","title":"Gradient-Variation Online Learning under Generalized Smoothness","created":"2024-08-17","cited_by_count":11,"area":null},{"id":"2205.11470","title":"Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning","created":"2022-05-23","cited_by_count":10,"area":null},{"id":"2211.01357","title":"Quasi-Newton Steps for Efficient Online Exp-Concave Optimization","created":"2022-11-02","cited_by_count":10,"area":null},{"id":"2405.20540","title":"Fully Unconstrained Online Learning","created":"2024-05-30","cited_by_count":10,"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":"2410.02476","title":"Online Convex Optimization with a Separation Oracle","created":"2024-10-03","cited_by_count":8,"area":null},{"id":"2206.02656","title":"A Regret-Variance Trade-Off in Online Learning","created":"2022-06-06","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":"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":"2105.03681","title":"Universal Online Convex Optimization Meets Second-order Bounds","created":"2021-05-08","cited_by_count":4,"area":null},{"id":"2112.14586","title":"Isotuning With Applications To Scale-Free Online Learning","created":"2021-12-29","cited_by_count":4,"area":null},{"id":"2510.04685","title":"Parameter-free Algorithms for the Stochastically Extended Adversarial Model","created":"2025-10-06","cited_by_count":3,"area":null},{"id":"2506.01722","title":"When Lower-Order Terms Dominate: Adaptive Expert Algorithms for Heavy-Tailed Losses","created":"2025-06-02","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":"2105.04129","title":"Parameter-free Gradient Temporal Difference Learning","created":"2021-05-10","cited_by_count":1,"area":null},{"id":"2405.11389","title":"Adjacent Leader Decentralized Stochastic Gradient Descent","created":"2024-05-18","cited_by_count":1,"area":null},{"id":"2602.11857","title":"Scale-Invariant Fast Convergence in Games","created":"2026-02-12","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":"2505.21095","title":"Improved Impossible Tuning and Lipschitz-Adaptive Universal Online Learning with Gradient Variations","created":"2025-05-27","cited_by_count":0,"area":null},{"id":"2602.11747","title":"High-Probability Minimax Adaptive Estimation in Besov Spaces via Online-to-Batch","created":"2026-02-12","cited_by_count":0,"area":null},{"id":"2610.14904","title":"Prediction with Expert Advice under Heavy-Tailed Losses","created":"2026-10-10","cited_by_count":0,"area":null}],"next_cursor":null}