{"total":107,"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":"2402.01139","title":"Online conformal prediction with decaying step sizes","created":"2024-02-02","cited_by_count":56,"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":"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":"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":"2104.11824","title":"Optimal Dynamic Regret in Exp-Concave Online Learning","created":"2021-04-23","cited_by_count":40,"area":null},{"id":"2102.03758","title":"Non-stationary Online Learning with Memory and Non-stochastic Control","created":"2021-02-07","cited_by_count":33,"area":null},{"id":"2302.10863","title":"A Unifying Perspective on Multi-Calibration: Game Dynamics for Multi-Objective Learning","created":"2023-02-21","cited_by_count":30,"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":"2202.04721","title":"New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees","created":"2022-02-09","cited_by_count":26,"area":null},{"id":"2402.01567","title":"Understanding Adam Optimizer via Online Learning of Updates: Adam is FTRL in Disguise","created":"2024-02-02","cited_by_count":26,"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":"2108.07356","title":"Stochastic Optimization under Distributional Drift","created":"2021-08-16","cited_by_count":15,"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":"2106.03596","title":"Beyond Bandit Feedback in Online Multiclass Classification","created":"2021-06-07","cited_by_count":14,"area":null},{"id":"2102.07666","title":"A closer look at temporal variability in dynamic online learning","created":"2021-02-15","cited_by_count":13,"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":"2208.12483","title":"Dynamic Regret of Online Markov Decision Processes","created":"2022-08-26","cited_by_count":13,"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":"2402.08672","title":"Model Assessment and Selection under Temporal Distribution Shift","created":"2024-02-13","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":"2305.19570","title":"Online Label Shift: Optimal Dynamic Regret meets Practical Algorithms","created":"2023-05-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":"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":"2210.06328","title":"Momentum Aggregation for Private Non-convex ERM","created":"2022-10-12","cited_by_count":10,"area":null},{"id":"2310.18304","title":"A Stability Principle for Learning under Non-Stationarity","created":"2023-10-27","cited_by_count":10,"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":"2101.09438","title":"An Optimal Reduction of TV-Denoising to Adaptive Online Learning","created":"2021-01-23","cited_by_count":9,"area":null},{"id":"2202.07574","title":"Damped Online Newton Step for Portfolio Selection","created":"2022-02-15","cited_by_count":9,"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":"2405.00065","title":"From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization","created":"2024-04-27","cited_by_count":9,"area":null},{"id":"2105.08769","title":"Learning and Information in Stochastic Networks and Queues","created":"2021-05-18","cited_by_count":8,"area":null},{"id":"2203.01400","title":"Adaptive Gradient Methods with Local Guarantees","created":"2022-03-02","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":"2411.03678","title":"Multi-model Ensemble Conformal Prediction in Dynamic Environments","created":"2024-11-06","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":"2205.01921","title":"Second Order Path Variationals in Non-Stationary Online Learning","created":"2022-05-04","cited_by_count":7,"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":"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":"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":"2410.03600","title":"Efficiently Identifying Watermarked Segments in Mixed-Source Texts","created":"2024-10-04","cited_by_count":6,"area":"safety"},{"id":"2106.04689","title":"Learning to Price Against a Moving Target","created":"2021-06-08","cited_by_count":5,"area":null},{"id":"2303.03196","title":"Population-based Evaluation in Repeated Rock-Paper-Scissors as a Benchmark for Multiagent Reinforcement Learning","created":"2023-03-02","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":"2107.01881","title":"Robust Online Convex Optimization in the Presence of Outliers","created":"2021-07-05","cited_by_count":4,"area":null},{"id":"2111.11550","title":"Dynamic Regret for Strongly Adaptive Methods and Optimality of Online KRR","created":"2021-11-22","cited_by_count":4,"area":null},{"id":"2402.08621","title":"A Unified Framework for Analyzing Meta-algorithms in Online Convex Optimization","created":"2024-02-13","cited_by_count":4,"area":null},{"id":"2405.19807","title":"MetaCURL: Non-stationary Concave Utility Reinforcement Learning","created":"2024-05-30","cited_by_count":4,"area":"deeprl"},{"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":"2106.13021","title":"Improved Regret Bounds for Tracking Experts with Memory","created":"2021-06-24","cited_by_count":3,"area":null},{"id":"2212.05908","title":"Instance-Conditional Timescales of Decay for Non-Stationary Learning","created":"2022-12-12","cited_by_count":3,"area":null},{"id":"2403.01315","title":"Near-optimal Per-Action Regret Bounds for Sleeping Bandits","created":"2024-03-02","cited_by_count":3,"area":null},{"id":"2502.16744","title":"BAGEL: Adversarially Constrained Online Convex Optimization under Separation Oracle Access","created":"2025-02-23","cited_by_count":3,"area":null},{"id":"2106.14668","title":"Evolutionary Dynamics and $\\Phi$-Regret Minimization in Games","created":"2021-06-28","cited_by_count":2,"area":null},{"id":"2205.04860","title":"Universal Caching","created":"2022-05-10","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":"2310.16473","title":"Policy Optimization via Adv2: Adversarial Learning on Advantage Functions","created":"2023-10-25","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":"2406.12366","title":"Structured Prediction in Online Learning","created":"2024-06-18","cited_by_count":2,"area":null},{"id":"2501.13551","title":"Minimizing Queue Length Regret for Arbitrarily Varying Channels","created":"2025-01-23","cited_by_count":2,"area":null},{"id":"2504.07261","title":"Adapting to Online Distribution Shifts in Deep Learning: A Black-Box Approach","created":"2025-04-09","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":"2606.03831","title":"Online Learning with Gradient-Variation Interval Regret","created":"2026-06-02","cited_by_count":2,"area":null},{"id":"2608.15050","title":"Online Convex Optimization with Dueling Feedback","created":"2026-08-15","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":"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":"2203.16587","title":"Spatially Adaptive Online Prediction of Piecewise Regular Functions","created":"2022-03-30","cited_by_count":1,"area":null},{"id":"2205.00473","title":"A Survey on Distributed Online Optimization and Game","created":"2022-05-01","cited_by_count":1,"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":"2506.02980","title":"Non-stationary Bandit Convex Optimization: A Comprehensive Study","created":"2025-06-03","cited_by_count":1,"area":null},{"id":"2508.13362","title":"Optimization-based Online Conformal Prediction for Multi-step Forecasting","created":"2025-08-18","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":"2302.06066","title":"Universal Online Optimization in Dynamic Environments via Uniclass Prediction","created":"2023-02-13","cited_by_count":0,"area":null},{"id":"2406.04201","title":"Securing Equal Share: A Principled Approach for Learning Multiplayer Symmetric Games","created":"2024-06-06","cited_by_count":0,"area":null},{"id":"2502.19325","title":"Partition Tree Weighting for Non-Stationary Stochastic Bandits","created":"2025-02-26","cited_by_count":0,"area":null},{"id":"2510.07086","title":"Non-Stationary Online Structured Prediction with Surrogate Losses","created":"2025-10-08","cited_by_count":0,"area":null},{"id":"2512.11052","title":"An Efficient Variant of One-Class SVM with Lifelong Online Learning Guarantees","created":"2025-12-11","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":"2602.20465","title":"Prior-Agnostic Incentive-Compatible Exploration","created":"2026-02-24","cited_by_count":0,"area":null},{"id":"2603.28201","title":"A Perturbation Approach to Unconstrained Linear Bandits","created":"2026-03-30","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":"2607.08012","title":"Provably Optimal Learning Algorithms for Assistance Games","created":"2026-07-09","cited_by_count":0,"area":null},{"id":"2607.17607","title":"Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles","created":"2026-07-20","cited_by_count":0,"area":null},{"id":"2608.13554","title":"Defensive Boosting for Online Probabilistic Forecasting","created":"2026-08-13","cited_by_count":0,"area":null}],"next_cursor":"100"}