{"total":52,"rows":[{"id":"2203.00444","title":"Parameter-free Mirror Descent","created":"2022-02-26","cited_by_count":45,"area":null},{"id":"2302.03775","title":"Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion","created":"2023-02-07","cited_by_count":45,"area":null},{"id":"2201.12736","title":"No-Regret Learning in Time-Varying Zero-Sum Games","created":"2022-01-30","cited_by_count":36,"area":null},{"id":"2303.02738","title":"Uncoupled and Convergent Learning in Two-Player Zero-Sum Markov Games with Bandit Feedback","created":"2023-03-05","cited_by_count":30,"area":null},{"id":"2202.00150","title":"Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints","created":"2022-01-31","cited_by_count":29,"area":null},{"id":"2102.05284","title":"Finding the Stochastic Shortest Path with Low Regret: The Adversarial Cost and Unknown Transition Case","created":"2021-02-10","cited_by_count":28,"area":null},{"id":"2210.14355","title":"Parameter-free Regret in High Probability with Heavy Tails","created":"2022-10-25","cited_by_count":28,"area":null},{"id":"2306.04923","title":"Unconstrained Online Learning with Unbounded Losses","created":"2023-06-08","cited_by_count":25,"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":"2306.00144","title":"Mechanic: A Learning Rate Tuner","created":"2023-05-31","cited_by_count":20,"area":null},{"id":"2111.01589","title":"Nonstochastic Bandits and Experts with Arm-Dependent Delays","created":"2021-11-02","cited_by_count":18,"area":null},{"id":"2302.09408","title":"Best of Both Worlds Policy Optimization","created":"2023-02-18","cited_by_count":17,"area":null},{"id":"2405.16642","title":"Fast TRAC: A Parameter-Free Optimizer for Lifelong Reinforcement Learning","created":"2024-05-26","cited_by_count":17,"area":"deeprl"},{"id":"2302.10805","title":"Repeated Bilateral Trade Against a Smoothed Adversary","created":"2023-02-21","cited_by_count":15,"area":null},{"id":"2202.03334","title":"Policy Optimization for Stochastic Shortest Path","created":"2022-02-07","cited_by_count":13,"area":null},{"id":"2208.12483","title":"Dynamic Regret of Online Markov Decision Processes","created":"2022-08-26","cited_by_count":13,"area":null},{"id":"2404.13503","title":"Calibration Error for Decision Making","created":"2024-04-21","cited_by_count":13,"area":null},{"id":"2111.05257","title":"Logarithmic Regret from Sublinear Hints","created":"2021-11-09","cited_by_count":12,"area":null},{"id":"2402.02720","title":"Discounted Adaptive Online Learning: Towards Better Regularization","created":"2024-02-05","cited_by_count":12,"area":null},{"id":"2301.13349","title":"Unconstrained Dynamic Regret via Sparse Coding","created":"2023-01-31","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":"2405.20540","title":"Fully Unconstrained Online Learning","created":"2024-05-30","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":"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":"2203.10327","title":"Implicit Parameter-free Online Learning with Truncated Linear Models","created":"2022-03-19","cited_by_count":8,"area":null},{"id":"2309.16044","title":"Improving Adaptive Online Learning Using Refined Discretization","created":"2023-09-27","cited_by_count":8,"area":null},{"id":"2203.04274","title":"Leveraging Initial Hints for Free in Stochastic Linear Bandits","created":"2022-03-08","cited_by_count":7,"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":"2303.03272","title":"Accelerated Rates between Stochastic and Adversarial Online Convex Optimization","created":"2023-03-06","cited_by_count":7,"area":null},{"id":"2401.17780","title":"A Policy Gradient Primal-Dual Algorithm for Constrained MDPs with Uniform PAC Guarantees","created":"2024-01-31","cited_by_count":6,"area":"deeprl"},{"id":"2511.04907","title":"Efficient Swap Multicalibration of Elicitable Properties","created":"2025-11-07","cited_by_count":5,"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":"2602.08372","title":"Dynamic Regret via Discounted-to-Dynamic Reduction with Applications to Curved Losses and Adam Optimizer","created":"2026-02-09","cited_by_count":4,"area":null},{"id":"2502.04543","title":"Sparsity-Based Interpolation of External, Internal and Swap Regret","created":"2025-02-06","cited_by_count":3,"area":null},{"id":"2510.03167","title":"Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double Optimism","created":"2025-10-03","cited_by_count":3,"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":"2604.19592","title":"An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to $\\Phi$-Regret Minimization","created":"2026-04-21","cited_by_count":3,"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":"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":"2510.08882","title":"An Improved Model-Free Decision-Estimation Coefficient with Applications in Adversarial MDPs","created":"2025-10-10","cited_by_count":2,"area":null},{"id":"2602.08862","title":"Near-optimal Swap Regret Minimization for Convex Losses","created":"2026-02-09","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":"2509.08911","title":"Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications","created":"2025-09-10","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":"2605.09273","title":"Instance-Adaptive Online Multicalibration","created":"2026-05-10","cited_by_count":1,"area":null},{"id":"2202.02406","title":"Parameter-free Online Linear Optimization with Side Information via Universal Coin Betting","created":"2022-02-04","cited_by_count":0,"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":"2602.21328","title":"Efficient Opportunistic Approachability","created":"2026-02-24","cited_by_count":0,"area":null},{"id":"2605.26919","title":"Agile Online Model Selection: Resolving Adaptation Lag via Safeguarded Large Learning Rates","created":"2026-05-26","cited_by_count":0,"area":null},{"id":"2608.15996","title":"Toward Optimal Second-Order Path-Length Guarantee for Adversarial Multi-Armed Bandits","created":"2026-08-17","cited_by_count":0,"area":null},{"id":"2609.36610","title":"Communication-Efficient Agnostic Federated Learning via Faster Convergence and Compression","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}