{"total":159,"rows":[{"id":"2302.07869","title":"Improved Online Conformal Prediction via Strongly Adaptive Online Learning","created":"2023-02-15","cited_by_count":78,"area":null},{"id":"2102.07698","title":"How to Learn when Data Reacts to Your Model: Performative Gradient Descent","created":"2021-02-15","cited_by_count":71,"area":null},{"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":"2103.05324","title":"A Simple Approach for Non-stationary Linear Bandits","created":"2021-03-09","cited_by_count":54,"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.03758","title":"Non-stationary Online Learning with Memory and Non-stochastic Control","created":"2021-02-07","cited_by_count":33,"area":null},{"id":"2107.02371","title":"Weighted Gaussian Process Bandits for Non-stationary Environments","created":"2021-07-06","cited_by_count":30,"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":"2205.12427","title":"Non-stationary Bandits with Knapsacks","created":"2022-05-25","cited_by_count":25,"area":null},{"id":"2110.13282","title":"The Pareto Frontier of model selection for general Contextual Bandits","created":"2021-10-25","cited_by_count":24,"area":null},{"id":"2110.08984","title":"Optimistic Policy Optimization is Provably Efficient in Non-stationary MDPs","created":"2021-10-18","cited_by_count":16,"area":null},{"id":"2209.01874","title":"The Best Decisions Are Not the Best Advice: Making Adherence-Aware Recommendations","created":"2022-09-05","cited_by_count":16,"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":"2302.02552","title":"Adapting to Continuous Covariate Shift via Online Density Ratio Estimation","created":"2023-02-06","cited_by_count":15,"area":null},{"id":"2303.01673","title":"Near Optimal Memory-Regret Tradeoff for Online Learning","created":"2023-03-03","cited_by_count":15,"area":null},{"id":"2410.15474","title":"Optimizing Backward Policies in GFlowNets via Trajectory Likelihood Maximization","created":"2024-10-20","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":"2203.03979","title":"Online Weak-form Sparse Identification of Partial Differential Equations","created":"2022-03-08","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":"2301.12366","title":"Smooth Non-Stationary Bandits","created":"2023-01-29","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":"2402.08672","title":"Model Assessment and Selection under Temporal Distribution Shift","created":"2024-02-13","cited_by_count":12,"area":null},{"id":"2210.05584","title":"On Adaptivity in Non-stationary Stochastic Optimization With Bandit Feedback","created":"2022-10-11","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":"2302.04452","title":"An Information-Theoretic Analysis of Nonstationary Bandit Learning","created":"2023-02-09","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":"2101.12506","title":"Learning User Preferences in Non-Stationary Environments","created":"2021-01-29","cited_by_count":10,"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":"2201.11965","title":"Provably Efficient Primal-Dual Reinforcement Learning for CMDPs with Non-stationary Objectives and Constraints","created":"2022-01-28","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":"2111.03917","title":"Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits","created":"2021-11-06","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":"2406.01577","title":"An Equivalence Between Static and Dynamic Regret Minimization","created":"2024-06-03","cited_by_count":9,"area":null},{"id":"2409.19212","title":"An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","created":"2024-09-28","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":"2106.06526","title":"Online Continual Adaptation with Active Self-Training","created":"2021-06-11","cited_by_count":8,"area":null},{"id":"2202.09036","title":"Adaptive Experimentation in the Presence of Exogenous Nonstationary Variation","created":"2022-02-18","cited_by_count":8,"area":null},{"id":"2210.14322","title":"ANACONDA: An Improved Dynamic Regret Algorithm for Adaptive Non-Stationary Dueling Bandits","created":"2022-10-25","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":"2411.03678","title":"Multi-model Ensemble Conformal Prediction in Dynamic Environments","created":"2024-11-06","cited_by_count":8,"area":null},{"id":"2111.08221","title":"Fairness-aware Online Price Discrimination with Nonparametric Demand Models","created":"2021-11-16","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":"2208.10790","title":"Event-Triggered Time-Varying Bayesian Optimization","created":"2022-08-23","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":"2412.20017","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","created":"2024-12-28","cited_by_count":7,"area":null},{"id":"2506.10616","title":"Non-stationary Online Learning for Curved Losses: Improved Dynamic Regret via Mixability","created":"2025-06-12","cited_by_count":7,"area":null},{"id":"2105.13383","title":"An Online Learning Approach to Optimizing Time-Varying Costs of AoI","created":"2021-05-27","cited_by_count":6,"area":null},{"id":"2109.05829","title":"Zeroth-order non-convex learning via hierarchical dual averaging","created":"2021-09-13","cited_by_count":6,"area":null},{"id":"2201.02313","title":"Stochastic Saddle Point Problems with Decision-Dependent Distributions","created":"2022-01-07","cited_by_count":6,"area":null},{"id":"2205.00446","title":"Adaptive Composite Online Optimization: Predictions in Static and Dynamic Environments","created":"2022-05-01","cited_by_count":6,"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":"2302.08652","title":"Minimizing Dynamic Regret on Geodesic Metric Spaces","created":"2023-02-17","cited_by_count":6,"area":null},{"id":"2302.14686","title":"Approximately Stationary Bandits with Knapsacks","created":"2023-02-28","cited_by_count":6,"area":null},{"id":"2309.04339","title":"Online Submodular Maximization via Online Convex Optimization","created":"2023-09-08","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":"2202.06694","title":"Versatile Dueling Bandits: Best-of-both-World Analyses for Online Learning from Preferences","created":"2022-02-14","cited_by_count":5,"area":null},{"id":"2202.13603","title":"Optimal Online Generalized Linear Regression with Stochastic Noise and Its Application to Heteroscedastic Bandits","created":"2022-02-28","cited_by_count":5,"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":"2410.16692","title":"Lower Bounds for Time-Varying Kernelized Bandits","created":"2024-10-22","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":"2109.14375","title":"Dynamic Regret Analysis for Online Meta-Learning","created":"2021-09-29","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":"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":"2302.12320","title":"Dynamic Regret Analysis of Safe Distributed Online Optimization for Convex and Non-convex Problems","created":"2023-02-23","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":"2505.13564","title":"Online Decision-Focused Learning","created":"2025-05-19","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":"2608.05080","title":"Optimizing What Policies Learn From: Recoverability-aware Rollout Intervention Learning","created":"2026-08-05","cited_by_count":4,"area":null},{"id":"2209.02009","title":"Online Decision Making for Trading Wind Energy","created":"2022-09-05","cited_by_count":3,"area":null},{"id":"2210.06401","title":"Improving information retention in large scale online continual learning","created":"2022-10-12","cited_by_count":3,"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":"2309.09411","title":"Distributionally Time-Varying Online Stochastic Optimization under Polyak-{\\L}ojasiewicz Condition with Application in Conditional Value-at-Risk Statistical Learning","created":"2023-09-18","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":"2412.01344","title":"Practical Performative Policy Learning with Strategic Agents","created":"2024-12-02","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":"2201.01628","title":"Bridging Adversarial and Nonstationary Multi-armed Bandit","created":"2022-01-05","cited_by_count":2,"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":"2205.04860","title":"Universal Caching","created":"2022-05-10","cited_by_count":2,"area":null},{"id":"2209.10105","title":"Distributed Online Non-convex Optimization with Composite Regret","created":"2022-09-21","cited_by_count":2,"area":null},{"id":"2308.05471","title":"Provably Efficient Algorithm for Nonstationary Low-Rank MDPs","created":"2023-08-10","cited_by_count":2,"area":null},{"id":"2404.02988","title":"Risk-averse Learning with Non-Stationary Distributions","created":"2024-04-03","cited_by_count":2,"area":null},{"id":"2404.04467","title":"Demand Balancing in Primal-Dual Optimization for Blind Network Revenue Management","created":"2024-04-06","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":"2412.10703","title":"Doubly-Bounded Queue for Constrained Online Learning: Keeping Pace with Dynamics of Both Loss and Constraint","created":"2024-12-14","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":"2601.15363","title":"Non-Stationary Functional Bilevel Optimization","created":"2026-01-21","cited_by_count":2,"area":null},{"id":"2602.01976","title":"FlyPrompt: Brain-Inspired Random-Expanded Routing with Temporal-Ensemble Experts for General Continual Learning","created":"2026-02-02","cited_by_count":2,"area":null},{"id":"2603.01040","title":"Fed-ADE: Adaptive Learning Rate for Federated Post-adaptation under Distribution Shift","created":"2026-03-01","cited_by_count":2,"area":null}],"next_cursor":"100"}