{"total":78,"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":"2307.04345","title":"Continual Learning as Computationally Constrained Reinforcement Learning","created":"2023-07-10","cited_by_count":37,"area":null},{"id":"2106.02978","title":"Robust Stochastic Linear Contextual Bandits Under Adversarial Attacks","created":"2021-06-05","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":"2112.13838","title":"Tracking Most Significant Arm Switches in Bandits","created":"2021-12-27","cited_by_count":27,"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":"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":"2110.12615","title":"Linear Contextual Bandits with Adversarial Corruptions","created":"2021-10-25","cited_by_count":21,"area":null},{"id":"2205.01970","title":"Non-Stationary Bandit Learning via Predictive Sampling","created":"2022-05-04","cited_by_count":21,"area":null},{"id":"2102.06296","title":"No-Regret Algorithms for Time-Varying Bayesian Optimization","created":"2021-02-11","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":"2110.08984","title":"Optimistic Policy Optimization is Provably Efficient in Non-stationary MDPs","created":"2021-10-18","cited_by_count":16,"area":null},{"id":"2305.18543","title":"Robust Lipschitz Bandits to Adversarial Corruptions","created":"2023-05-29","cited_by_count":15,"area":null},{"id":"2302.01523","title":"Multi-channel Autobidding with Budget and ROI Constraints","created":"2023-02-03","cited_by_count":14,"area":null},{"id":"2103.05750","title":"Regret Bounds for Generalized Linear Bandits under Parameter Drift","created":"2021-03-09","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":"2302.04452","title":"An Information-Theoretic Analysis of Nonstationary Bandit Learning","created":"2023-02-09","cited_by_count":11,"area":null},{"id":"2106.02979","title":"Syndicated Bandits: A Framework for Auto Tuning Hyper-parameters in Contextual Bandit Algorithms","created":"2021-06-05","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":"2211.14720","title":"Rectified Pessimistic-Optimistic Learning for Stochastic Continuum-armed Bandit with Constraints","created":"2022-11-27","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":"2202.09036","title":"Adaptive Experimentation in the Presence of Exogenous Nonstationary Variation","created":"2022-02-18","cited_by_count":8,"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":"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":"2410.16692","title":"Lower Bounds for Time-Varying Kernelized Bandits","created":"2024-10-22","cited_by_count":5,"area":null},{"id":"2601.01069","title":"Revisiting Weighted Strategy for Non-stationary Parametric Bandits and MDPs","created":"2026-01-03","cited_by_count":5,"area":null},{"id":"2111.03772","title":"Dynamic Regret Minimization for Control of Non-stationary Linear Dynamical Systems","created":"2021-11-06","cited_by_count":4,"area":null},{"id":"2201.12975","title":"Rotting Infinitely Many-armed Bandits","created":"2022-01-31","cited_by_count":4,"area":null},{"id":"2306.10341","title":"Tailoring Machine Learning for Process Mining","created":"2023-06-17","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":"2204.05782","title":"Stochastic Multi-armed Bandits with Non-stationary Rewards Generated by a Linear Dynamical System","created":"2022-04-06","cited_by_count":3,"area":null},{"id":"2210.11692","title":"Competing Bandits in Time Varying Matching Markets","created":"2022-10-21","cited_by_count":3,"area":null},{"id":"2309.14989","title":"Tempo Adaptation in Non-stationary Reinforcement Learning","created":"2023-09-26","cited_by_count":3,"area":null},{"id":"2402.03110","title":"Non-Stationary Latent Auto-Regressive Bandits","created":"2024-02-05","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":"2201.00486","title":"Using Non-Stationary Bandits for Learning in Repeated Cournot Games with Non-Stationary Demand","created":"2022-01-03","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":"2308.05471","title":"Provably Efficient Algorithm for Nonstationary Low-Rank MDPs","created":"2023-08-10","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":"2404.14202","title":"An Adaptive Approach for Infinitely Many-armed Bandits under Generalized Rotting Constraints","created":"2024-04-22","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":"2604.21432","title":"A single algorithm for both restless and rested rotting bandits","created":"2026-04-23","cited_by_count":2,"area":null},{"id":"2205.14839","title":"Adversarial Bandits against Arbitrary Strategies","created":"2022-05-30","cited_by_count":1,"area":null},{"id":"2302.04182","title":"Online Resource Allocation: Bandits feedback and Advice on Time-varying Demands","created":"2023-02-08","cited_by_count":1,"area":null},{"id":"2302.09440","title":"Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits","created":"2023-02-18","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":"2310.07786","title":"Non-Stationary Contextual Bandit Learning via Neural Predictive Ensemble Sampling","created":"2023-10-11","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":"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":"2605.20269","title":"Catching a Moving Subspace: Low-Rank Bandits Beyond Stationarity","created":"2026-05-18","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":"2106.08477","title":"Fundamental Limits of Reinforcement Learning in Environment with Endogeneous and Exogeneous Uncertainty","created":"2021-06-15","cited_by_count":0,"area":null},{"id":"2202.03167","title":"Bayesian Non-stationary Linear Bandits for Large-Scale Recommender Systems","created":"2022-02-07","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":"2303.02691","title":"Revisiting Weighted Strategy for Non-stationary Parametric Bandits","created":"2023-03-05","cited_by_count":0,"area":null},{"id":"2305.00154","title":"Learning to Seek: Multi-Agent Online Source Seeking Against Non-Stochastic Disturbances","created":"2023-04-29","cited_by_count":0,"area":null},{"id":"2307.03587","title":"Weighted Sequential Bayesian Inference for Non-Stationary Linear Contextual Bandits","created":"2023-07-07","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":"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":"2504.03926","title":"An Exploration-free Method for a Linear Stochastic Bandit Driven by a Linear Gaussian Dynamical System","created":"2025-04-04","cited_by_count":0,"area":null},{"id":"2512.00517","title":"No-Regret Gaussian Process Optimization of Time-Varying Functions","created":"2025-11-29","cited_by_count":0,"area":null},{"id":"2601.19867","title":"Bandits in Flux: Adversarial Constraints in Dynamic Environments","created":"2026-01-27","cited_by_count":0,"area":null},{"id":"2603.18514","title":"On the Peril of (Even a Little) Nonstationarity in Satisficing Regret Minimization","created":"2026-03-19","cited_by_count":0,"area":null},{"id":"2605.05809","title":"Detecting Changes in Causal Dependence with Kernels and Copulas","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2605.08558","title":"Beyond Static Bias: Adaptive Multi-Fidelity Bandits with Improving Proxies","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2605.22988","title":"Active Sensing Subserves Task-Level Control","created":"2026-05-21","cited_by_count":0,"area":null},{"id":"2605.25590","title":"Nonstationary Generalized Linear Bandits with Discounted Online Mirror Descent","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2606.07910","title":"CAAL: Contextual Bandits based Online Hand-Craft Active Learning Strategy Selection","created":"2026-06-06","cited_by_count":0,"area":null},{"id":"2606.17489","title":"Online LLM Selection via Constrained Bandits with Time-Varying Demand","created":"2026-06-16","cited_by_count":0,"area":null},{"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},{"id":"2609.33981","title":"Future Information-Directed Sampling for Bayesian Nonstationary Bandits","created":"2026-09-27","cited_by_count":0,"area":null},{"id":"2610.00911","title":"Block Optimism for Nonstationary Bandits with Latent Linear Dynamics","created":"2026-10-01","cited_by_count":0,"area":null}],"next_cursor":null}