{"total":71,"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":"2103.05324","title":"A Simple Approach for Non-stationary Linear Bandits","created":"2021-03-09","cited_by_count":54,"area":null},{"id":"2312.06185","title":"KnowGPT: Knowledge Graph based Prompting for Large Language Models","created":"2023-12-11","cited_by_count":31,"area":null},{"id":"2201.06532","title":"A New Look at Dynamic Regret for Non-Stationary Stochastic Bandits","created":"2022-01-17","cited_by_count":28,"area":null},{"id":"2112.13838","title":"Tracking Most Significant Arm Switches in Bandits","created":"2021-12-27","cited_by_count":27,"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":"2309.00814","title":"Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits","created":"2023-09-02","cited_by_count":19,"area":null},{"id":"2212.03798","title":"Stochastic Rising Bandits","created":"2022-12-07","cited_by_count":18,"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":"2110.08984","title":"Optimistic Policy Optimization is Provably Efficient in Non-stationary MDPs","created":"2021-10-18","cited_by_count":16,"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":"2301.12366","title":"Smooth Non-Stationary Bandits","created":"2023-01-29","cited_by_count":13,"area":null},{"id":"2108.04782","title":"Bandit Algorithms for Precision Medicine","created":"2021-08-10","cited_by_count":12,"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":"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":"2302.12202","title":"A Definition of Non-Stationary Bandits","created":"2023-02-23","cited_by_count":9,"area":null},{"id":"2102.00725","title":"Generalized non-stationary bandits","created":"2021-02-01","cited_by_count":8,"area":null},{"id":"2106.10935","title":"On Limited-Memory Subsampling Strategies for Bandits","created":"2021-06-21","cited_by_count":8,"area":null},{"id":"2202.13001","title":"Non-stationary Bandits and Meta-Learning with a Small Set of Optimal Arms","created":"2022-02-25","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":"2110.12916","title":"On Slowly-varying Non-stationary Bandits","created":"2021-10-25","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":"2205.13044","title":"Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments","created":"2022-05-25","cited_by_count":6,"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":"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":"2302.06595","title":"When Can We Track Significant Preference Shifts in Dueling Bandits?","created":"2023-02-13","cited_by_count":5,"area":null},{"id":"2302.07186","title":"Adversarial Rewards in Universal Learning for Contextual Bandits","created":"2023-02-14","cited_by_count":5,"area":"alignment"},{"id":"2201.12975","title":"Rotting Infinitely Many-armed Bandits","created":"2022-01-31","cited_by_count":4,"area":null},{"id":"2211.10815","title":"Non-stationary Risk-sensitive Reinforcement Learning: Near-optimal Dynamic Regret, Adaptive Detection, and Separation Design","created":"2022-11-19","cited_by_count":4,"area":null},{"id":"2305.10718","title":"Discounted Thompson Sampling for Non-Stationary Bandit Problems","created":"2023-05-18","cited_by_count":4,"area":null},{"id":"2407.08654","title":"Adaptive Smooth Non-Stationary Bandits","created":"2024-07-11","cited_by_count":4,"area":null},{"id":"2306.07465","title":"A Black-box Approach for Non-stationary Multi-agent Reinforcement Learning","created":"2023-06-12","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":"2609.33760","title":"Oracle-Efficient Online Classification with Stochastic Inputs and Adversarial Outputs","created":"2026-09-27","cited_by_count":3,"area":null},{"id":"2201.01628","title":"Bridging Adversarial and Nonstationary Multi-armed Bandit","created":"2022-01-05","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":"2307.15154","title":"A/B Testing and Best-arm Identification for Linear Bandits with Robustness to Non-stationarity","created":"2023-07-27","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.10732","title":"Variance-Dependent Regret Bounds for Non-stationary Linear Bandits","created":"2024-03-15","cited_by_count":2,"area":null},{"id":"2403.12950","title":"Non-Stationary Dueling Bandits Under a Weighted Borda Criterion","created":"2024-03-19","cited_by_count":2,"area":null},{"id":"2405.17337","title":"Cost-efficient Knowledge-based Question Answering with Large Language Models","created":"2024-05-27","cited_by_count":2,"area":null},{"id":"2508.16027","title":"Optimal Dynamic Regret by Transformers for Non-Stationary Reinforcement Learning","created":"2025-08-22","cited_by_count":2,"area":"deeprl"},{"id":"2604.21432","title":"A single algorithm for both restless and rested rotting bandits","created":"2026-04-23","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":"2205.14839","title":"Adversarial Bandits against Arbitrary Strategies","created":"2022-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":"2306.01658","title":"An Adaptive Method for Weak Supervision with Drifting Data","created":"2023-06-02","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":"2312.07285","title":"Forced Exploration in Bandit Problems","created":"2023-12-12","cited_by_count":1,"area":null},{"id":"2410.21266","title":"Online Weighted Paging with Unknown Weights","created":"2024-10-28","cited_by_count":1,"area":null},{"id":"2502.00108","title":"Tracking Most Significant Shifts in Infinite-Armed Bandits","created":"2025-01-31","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":"2507.08994","title":"Fixed-Confidence Multiple Change Point Identification under Bandit Feedback","created":"2025-07-11","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":"2602.07418","title":"Achieving Optimal Static and Dynamic Regret Simultaneously in Bandits with Deterministic Losses","created":"2026-02-07","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":"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":"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.05734","title":"Diminishing Exploration: A Minimalist Approach to Piecewise Stationary Multi-Armed Bandits","created":"2024-10-08","cited_by_count":0,"area":null},{"id":"2501.19401","title":"DAL: A Practical Prior-Free Black-Box Framework for Piecewise Stationary Bandits","created":"2025-01-31","cited_by_count":0,"area":null},{"id":"2512.21165","title":"BALLAST: Bandit-Assisted Learning for Latency-Aware Stable Timeouts in Raft","created":"2025-12-24","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":"2607.24115","title":"On Non-Stationary Dynamic Pricing: Adaptivity and Optimality","created":"2026-07-27","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}],"next_cursor":null}