{"total":40,"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":"2103.05324","title":"A Simple Approach for Non-stationary Linear Bandits","created":"2021-03-09","cited_by_count":54,"area":null},{"id":"2206.00423","title":"Open-environment Machine Learning","created":"2022-06-01","cited_by_count":48,"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":"2207.02121","title":"Adapting to Online Label Shift with Provable Guarantees","created":"2022-07-05","cited_by_count":26,"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":"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":"2208.12483","title":"Dynamic Regret of Online Markov Decision Processes","created":"2022-08-26","cited_by_count":13,"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":"2307.02295","title":"Meta-Learning Adversarial Bandit Algorithms","created":"2023-07-05","cited_by_count":8,"area":null},{"id":"2210.09903","title":"Online Convex Optimization with Unbounded Memory","created":"2022-10-18","cited_by_count":6,"area":null},{"id":"2602.04761","title":"Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variations","created":"2026-02-04","cited_by_count":5,"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":"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":"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":"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":"2505.18871","title":"Non-Stationary Lipschitz Bandits","created":"2025-05-24","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":"2602.20578","title":"Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets","created":"2026-02-24","cited_by_count":3,"area":null},{"id":"2106.04944","title":"Non-Parametric Stochastic Sequential Assignment With Random Arrival Times","created":"2021-06-09","cited_by_count":2,"area":null},{"id":"2306.05998","title":"Distributed Consensus Algorithm for Decision-Making in Multi-agent Multi-armed Bandit","created":"2023-06-09","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":"2606.07890","title":"Partially Performative Prediction","created":"2026-06-05","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":"2307.05698","title":"Online Ad Procurement in Non-stationary Autobidding Worlds","created":"2023-07-10","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":"2405.19015","title":"Distributed Management of Fluctuating Energy Resources in Dynamic Networked Systems","created":"2024-05-29","cited_by_count":1,"area":null},{"id":"2408.16215","title":"Adversarial Network Optimization under Bandit Feedback: Maximizing Utility in Non-Stationary Multi-Hop Networks","created":"2024-08-29","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":"2509.15073","title":"Constrained Feedback Learning for Non-Stationary Multi-Armed Bandits","created":"2025-09-18","cited_by_count":1,"area":null},{"id":"2605.22191","title":"Bandit Convex Optimization with Gradient Prediction Adaptivity","created":"2026-05-21","cited_by_count":1,"area":null},{"id":"2310.10946","title":"Multi-point Feedback of Bandit Convex Optimization with Hard Constraints","created":"2023-10-17","cited_by_count":0,"area":null},{"id":"2405.16029","title":"Online Resource Allocation for Edge Intelligence with Colocated Model Retraining and Inference","created":"2024-05-25","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":"2409.16866","title":"Risk-averse learning with delayed feedback","created":"2024-09-25","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":"2505.24692","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","created":"2025-05-30","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}],"next_cursor":null}