{"total":62,"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":"2107.05745","title":"Adapting to Misspecification in Contextual Bandits","created":"2021-07-12","cited_by_count":81,"area":null},{"id":"2111.12306","title":"Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability","created":"2021-11-24","cited_by_count":44,"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":"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.01970","title":"Non-Stationary Bandit Learning via Predictive Sampling","created":"2022-05-04","cited_by_count":21,"area":null},{"id":"2505.15141","title":"BanditSpec: Adaptive Speculative Decoding via Bandit Algorithms","created":"2025-05-21","cited_by_count":20,"area":"inference"},{"id":"2309.00814","title":"Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits","created":"2023-09-02","cited_by_count":19,"area":null},{"id":"2506.17670","title":"Online Multi-LLM Selection via Contextual Bandits under Unstructured Context Evolution","created":"2025-06-21","cited_by_count":19,"area":null},{"id":"2205.14775","title":"An Optimization-based Algorithm for Non-stationary Kernel Bandits without Prior Knowledge","created":"2022-05-29","cited_by_count":17,"area":null},{"id":"2409.05181","title":"Sliding-Window Thompson Sampling for Non-Stationary Settings","created":"2024-09-08","cited_by_count":17,"area":null},{"id":"2006.16785","title":"Lipschitzness Is All You Need To Tame Off-policy Generative Adversarial Imitation Learning","created":"2020-06-28","cited_by_count":15,"area":"offlinerl"},{"id":"2302.01523","title":"Multi-channel Autobidding with Budget and ROI Constraints","created":"2023-02-03","cited_by_count":14,"area":null},{"id":"2301.12366","title":"Smooth Non-Stationary Bandits","created":"2023-01-29","cited_by_count":13,"area":null},{"id":"2101.12506","title":"Learning User Preferences in Non-Stationary Environments","created":"2021-01-29","cited_by_count":10,"area":null},{"id":"2307.05341","title":"Tracking Most Significant Shifts in Nonparametric Contextual Bandits","created":"2023-07-11","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":"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":"2206.09642","title":"Beyond IID: data-driven decision-making in heterogeneous environments","created":"2022-06-20","cited_by_count":9,"area":null},{"id":"2302.12202","title":"A Definition of Non-Stationary Bandits","created":"2023-02-23","cited_by_count":9,"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":"2307.02295","title":"Meta-Learning Adversarial Bandit Algorithms","created":"2023-07-05","cited_by_count":8,"area":null},{"id":"2110.12916","title":"On Slowly-varying Non-stationary Bandits","created":"2021-10-25","cited_by_count":7,"area":null},{"id":"2302.08345","title":"Linear Bandits with Memory: from Rotting to Rising","created":"2023-02-16","cited_by_count":6,"area":null},{"id":"2306.00861","title":"Non-stationary Reinforcement Learning under General Function Approximation","created":"2023-06-01","cited_by_count":6,"area":null},{"id":"2512.22420","title":"Nightjar: Dynamic Adaptive Speculative Decoding for Large Language Models Serving","created":"2025-12-27","cited_by_count":6,"area":"inference"},{"id":"2206.00120","title":"Decentralized Competing Bandits in Non-Stationary Matching Markets","created":"2022-05-31","cited_by_count":5,"area":null},{"id":"2301.13524","title":"Quantum contextual bandits and recommender systems for quantum data","created":"2023-01-31","cited_by_count":4,"area":null},{"id":"2407.01566","title":"A Parametric Contextual Online Learning Theory of Brokerage","created":"2024-05-22","cited_by_count":4,"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":"2406.16802","title":"Improved Regret Bounds for Bandits with Expert Advice","created":"2024-06-24","cited_by_count":3,"area":null},{"id":"2609.33760","title":"Oracle-Efficient Online Classification with Stochastic Inputs and Adversarial Outputs","created":"2026-09-27","cited_by_count":3,"area":null},{"id":"2103.05199","title":"Dynamic Pricing and Learning under the Bass Model","created":"2021-03-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":"2209.04147","title":"Extending Open Bandit Pipeline to Simulate Industry Challenges","created":"2022-09-09","cited_by_count":2,"area":null},{"id":"2301.00241","title":"Contextual Bandits and Optimistically Universal Learning","created":"2022-12-31","cited_by_count":2,"area":null},{"id":"2310.19025","title":"An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits","created":"2023-10-29","cited_by_count":2,"area":null},{"id":"2403.08829","title":"Mitigating Biases in Collective Decision-Making: Enhancing Performance in the Face of Fake News","created":"2024-03-11","cited_by_count":2,"area":null},{"id":"2105.14422","title":"Periodic-GP: Learning Periodic World with Gaussian Process Bandits","created":"2021-05-30","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":"2303.06552","title":"Energy Regularized RNNs for Solving Non-Stationary Bandit Problems","created":"2023-03-12","cited_by_count":1,"area":null},{"id":"2310.07786","title":"Non-Stationary Contextual Bandit Learning via Neural Predictive Ensemble Sampling","created":"2023-10-11","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":"2511.02944","title":"Power Constrained Nonstationary Bandits with Habituation and Recovery Dynamics","created":"2025-11-04","cited_by_count":1,"area":null},{"id":"2609.00662","title":"Drift-Aware LLM Routing with Sparse Contexts and Shared Budgets","created":"2026-09-01","cited_by_count":1,"area":null},{"id":"2104.07150","title":"When and Whom to Collaborate with in a Changing Environment: A Collaborative Dynamic Bandit Solution","created":"2021-04-14","cited_by_count":0,"area":null},{"id":"2110.12132","title":"Towards the D-Optimal Online Experiment Design for Recommender Selection","created":"2021-10-23","cited_by_count":0,"area":null},{"id":"2206.00861","title":"Dynamic Structure Estimation from Bandit Feedback using Nonvanishing Exponential Sums","created":"2022-06-02","cited_by_count":0,"area":null},{"id":"2211.04586","title":"Learning to Price Supply Chain Contracts against a Learning Retailer","created":"2022-11-02","cited_by_count":0,"area":null},{"id":"2301.12571","title":"Bounded (O(1)) Regret Recommendation Learning via Synthetic Controls Oracle","created":"2023-01-29","cited_by_count":0,"area":null},{"id":"2307.09388","title":"Online Learning with Costly Features in Non-stationary Environments","created":"2023-07-18","cited_by_count":0,"area":null},{"id":"2311.09483","title":"Adaptive Interventions with User-Defined Goals for Health Behavior Change","created":"2023-11-16","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":"2601.14333","title":"Hierarchical Contextual Uplift Bandits for Catalog Personalization","created":"2026-01-20","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.12530","title":"Mixing Makes Markovian Contexts Cheap for Linear Bandits","created":"2026-03-13","cited_by_count":0,"area":null},{"id":"2603.18972","title":"Best-of-Both-Worlds Multi-Dueling Bandits: Unified Algorithms for Stochastic and Adversarial Preferences under Condorcet and Borda Objectives","created":"2026-03-19","cited_by_count":0,"area":null},{"id":"2604.16684","title":"DARLING: Detection Augmented Reinforcement Learning with Non-Stationary Guarantees","created":"2026-04-17","cited_by_count":0,"area":"deeprl"},{"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":"2609.13547","title":"Toward Optimal Switching Regret for Multi-Armed Bandits with Oblivious Adversary","created":"2026-09-11","cited_by_count":0,"area":null},{"id":"2609.29715","title":"Revalidation Beats Stateful Routing for Scientific Surrogates Under Distribution Shift","created":"2026-08-31","cited_by_count":0,"area":null}],"next_cursor":null}