{"total":62,"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":"2104.11824","title":"Optimal Dynamic Regret in Exp-Concave Online Learning","created":"2021-04-23","cited_by_count":40,"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":"2102.06933","title":"Revisiting Smoothed Online Learning","created":"2021-02-13","cited_by_count":29,"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":"2207.02121","title":"Adapting to Online Label Shift with Provable Guarantees","created":"2022-07-05","cited_by_count":26,"area":null},{"id":"2206.00024","title":"Online PAC-Bayes Learning","created":"2022-05-31","cited_by_count":22,"area":null},{"id":"2105.00321","title":"Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization","created":"2021-05-01","cited_by_count":21,"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":"2302.02552","title":"Adapting to Continuous Covariate Shift via Online Density Ratio Estimation","created":"2023-02-06","cited_by_count":15,"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":"2208.12483","title":"Dynamic Regret of Online Markov Decision Processes","created":"2022-08-26","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":"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":"2103.12243","title":"Adaptive Importance Sampling for Finite-Sum Optimization and Sampling with Decreasing Step-Sizes","created":"2021-03-23","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":"2101.09438","title":"An Optimal Reduction of TV-Denoising to Adaptive Online Learning","created":"2021-01-23","cited_by_count":9,"area":null},{"id":"2406.01577","title":"An Equivalence Between Static and Dynamic Regret Minimization","created":"2024-06-03","cited_by_count":9,"area":null},{"id":"2106.06526","title":"Online Continual Adaptation with Active Self-Training","created":"2021-06-11","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":"2308.03811","title":"Non-Convex Bilevel Optimization with Time-Varying Objective Functions","created":"2023-08-07","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":"2302.14796","title":"Particle-based Online Bayesian Sampling","created":"2023-02-28","cited_by_count":7,"area":null},{"id":"2303.15634","title":"Learning Rate Schedules in the Presence of Distribution Shift","created":"2023-03-27","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":"2301.00497","title":"Efficient Online Learning with Memory via Frank-Wolfe Optimization: Algorithms with Bounded Dynamic Regret and Applications to Control","created":"2023-01-02","cited_by_count":5,"area":null},{"id":"2501.13358","title":"Learning to Bid in Non-Stationary Repeated First-Price Auctions","created":"2025-01-23","cited_by_count":5,"area":null},{"id":"2505.22899","title":"On the Dynamic Regret of Following the Regularized Leader: Optimism with History Pruning","created":"2025-05-28","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":"2209.01608","title":"Dynamic Regret of Adaptive Gradient Methods for Strongly Convex Problems","created":"2022-09-04","cited_by_count":4,"area":null},{"id":"2301.09808","title":"On Dynamic Regret and Constraint Violations in Constrained Online Convex Optimization","created":"2023-01-24","cited_by_count":4,"area":null},{"id":"2509.03810","title":"Online time series prediction using feature adjustment","created":"2025-09-04","cited_by_count":4,"area":null},{"id":"2510.01867","title":"Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization","created":"2025-10-02","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":"2310.11880","title":"Online Convex Optimization with Switching Cost and Delayed Gradients","created":"2023-10-18","cited_by_count":3,"area":null},{"id":"2202.12843","title":"Dynamic Regret of Online Mirror Descent for Relatively Smooth Convex Cost Functions","created":"2022-02-25","cited_by_count":2,"area":null},{"id":"2409.10470","title":"Online Nonconvex Bilevel Optimization with Bregman Divergences","created":"2024-09-16","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":"2601.15363","title":"Non-Stationary Functional Bilevel Optimization","created":"2026-01-21","cited_by_count":2,"area":null},{"id":"2602.06902","title":"Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory","created":"2026-02-06","cited_by_count":2,"area":null},{"id":"2603.25916","title":"Parameter-Free Dynamic Regret for Unconstrained Linear Bandits","created":"2026-03-26","cited_by_count":2,"area":null},{"id":"2606.07890","title":"Partially Performative Prediction","created":"2026-06-05","cited_by_count":2,"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":"2208.03708","title":"Optimal Tracking in Prediction with Expert Advice","created":"2022-08-07","cited_by_count":1,"area":null},{"id":"2303.02504","title":"MNL-Bandit in non-stationary environments","created":"2023-03-04","cited_by_count":1,"area":null},{"id":"2506.12389","title":"Revisiting Clustering of Neural Bandits: Selective Reinitialization for Mitigating Loss of Plasticity","created":"2025-06-14","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":"2301.07530","title":"Online (Non-)Convex Learning via Tempered Optimism","created":"2023-01-18","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":"2303.15652","title":"Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model","created":"2023-03-28","cited_by_count":0,"area":null},{"id":"2406.05714","title":"A conversion theorem and minimax optimality for continuum contextual bandits","created":"2024-06-09","cited_by_count":0,"area":null},{"id":"2410.23574","title":"Online Convex Optimization with Memory and Limited Predictions","created":"2024-10-31","cited_by_count":0,"area":null},{"id":"2411.03925","title":"Quantum Algorithm for Sparse Online Learning with Truncated Gradient Descent","created":"2024-11-06","cited_by_count":0,"area":null},{"id":"2511.23347","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","created":"2025-11-28","cited_by_count":0,"area":null},{"id":"2512.01258","title":"Efficient Hyperparameter Search for Non-Stationary Model Training","created":"2025-12-01","cited_by_count":0,"area":null},{"id":"2605.21263","title":"Nonparametric Learning and Earning with One-Point Feedback under Nonstationarity","created":"2026-05-20","cited_by_count":0,"area":null},{"id":"2610.16923","title":"Minimax Optimality of Shampoo for Nonstationary Stochastic Optimization","created":"2026-10-12","cited_by_count":0,"area":null}],"next_cursor":null}