{"total":49,"rows":[{"id":"2102.05406","title":"Non-stationary Reinforcement Learning without Prior Knowledge: An Optimal Black-box Approach","created":"2021-02-10","cited_by_count":98,"area":null},{"id":"2302.07869","title":"Improved Online Conformal Prediction via Strongly Adaptive Online Learning","created":"2023-02-15","cited_by_count":78,"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":"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.08905","title":"Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond","created":"2022-01-21","cited_by_count":28,"area":null},{"id":"2306.02704","title":"Calibrated Stackelberg Games: Learning Optimal Commitments Against Calibrated Agents","created":"2023-06-05","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":"2205.11264","title":"Adaptive Fairness-Aware Online Meta-Learning for Changing Environments","created":"2022-05-20","cited_by_count":17,"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":"2211.12638","title":"Projection-free Adaptive Regret with Membership Oracles","created":"2022-11-22","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":"2206.00220","title":"Adaptive Online Learning of Quantum States","created":"2022-06-01","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":"2502.00818","title":"Error-quantified Conformal Inference for Time Series","created":"2025-02-02","cited_by_count":12,"area":null},{"id":"2101.07043","title":"Online Caching with Optimal Switching Regret","created":"2021-01-18","cited_by_count":11,"area":null},{"id":"2301.13349","title":"Unconstrained Dynamic Regret via Sparse Coding","created":"2023-01-31","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":"2405.19175","title":"Online Linear Regression in Dynamic Environments via Discounting","created":"2024-05-29","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":"2205.00741","title":"Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor","created":"2022-05-02","cited_by_count":6,"area":null},{"id":"2206.09257","title":"Optimal Dynamic Regret in LQR Control","created":"2022-06-18","cited_by_count":6,"area":null},{"id":"2210.09371","title":"On Accelerated Perceptrons and Beyond","created":"2022-10-17","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.20824","title":"Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously","created":"2024-05-31","cited_by_count":6,"area":null},{"id":"2501.18363","title":"Exploring the Noise Robustness of Online Conformal Prediction","created":"2025-01-30","cited_by_count":5,"area":null},{"id":"2106.13021","title":"Improved Regret Bounds for Tracking Experts with Memory","created":"2021-06-24","cited_by_count":3,"area":null},{"id":"2105.04005","title":"Delay-Tolerant Constrained OCO with Application to Network Resource Allocation","created":"2021-05-09","cited_by_count":2,"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":"2505.15803","title":"Adaptive Estimation and Learning under Temporal Distribution Shift","created":"2025-05-21","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":"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":"2205.14839","title":"Adversarial Bandits against Arbitrary Strategies","created":"2022-05-30","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":"2511.04275","title":"Online conformal inference with retrospective adjustment for faster adaptation to distribution shift","created":"2025-11-06","cited_by_count":1,"area":null},{"id":"2607.20239","title":"Adaptive Bayesian Online Learning via Expert Aggregation","created":"2026-07-22","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":"2209.06826","title":"Modifying Squint for Prediction with Expert Advice in a Changing Environment","created":"2022-09-14","cited_by_count":0,"area":null},{"id":"2408.14073","title":"Score-based change point detection via tracking the best of infinitely many experts","created":"2024-08-26","cited_by_count":0,"area":null},{"id":"2602.10565","title":"Online Min-Max Optimization: From Individual Regrets to Cumulative Saddle Points","created":"2026-02-11","cited_by_count":0,"area":null},{"id":"2602.14952","title":"Locally Adaptive Multi-Objective Learning","created":"2026-02-16","cited_by_count":0,"area":null},{"id":"2606.00419","title":"Parameter-Free and Group Conditional Online Conformal Prediction","created":"2026-05-29","cited_by_count":0,"area":null},{"id":"2606.27315","title":"Blackwell Approachability and Gradient Equilibrium are Equivalent","created":"2026-06-25","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},{"id":"2610.20187","title":"Dimension-Optimal Dynamic Regret in Exp-Concave Online Learning","created":"2026-10-14","cited_by_count":0,"area":null}],"next_cursor":null}