{"total":89,"rows":[{"id":"2101.02195","title":"Provably Efficient Reinforcement Learning with Linear Function Approximation Under Adaptivity Constraints","created":"2021-01-06","cited_by_count":124,"area":null},{"id":"2112.04553","title":"Recent Advances in Reinforcement Learning in Finance","created":"2021-12-08","cited_by_count":110,"area":null},{"id":"2110.14177","title":"Federated Linear Contextual Bandits","created":"2021-10-27","cited_by_count":61,"area":null},{"id":"2211.05732","title":"The Sample Complexity of Online Contract Design","created":"2022-11-10","cited_by_count":35,"area":null},{"id":"2202.06385","title":"Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost","created":"2022-02-13","cited_by_count":32,"area":null},{"id":"2106.02900","title":"Differentially Private Multi-Armed Bandits in the Shuffle Model","created":"2021-06-05","cited_by_count":24,"area":null},{"id":"2102.13028","title":"Batched Neural Bandits","created":"2021-02-25","cited_by_count":22,"area":null},{"id":"2210.01898","title":"Replicable Bandits","created":"2022-10-04","cited_by_count":22,"area":null},{"id":"2404.06831","title":"Generalized Linear Bandits with Limited Adaptivity","created":"2024-04-10","cited_by_count":22,"area":null},{"id":"2110.09722","title":"Lipschitz Bandits with Batched Feedback","created":"2021-10-19","cited_by_count":21,"area":null},{"id":"2106.01420","title":"Parallelizing Thompson Sampling","created":"2021-06-02","cited_by_count":20,"area":null},{"id":"2102.09864","title":"An Algorithm for Stochastic and Adversarial Bandits with Switching Costs","created":"2021-02-19","cited_by_count":19,"area":null},{"id":"2110.00202","title":"Batched Thompson Sampling","created":"2021-10-01","cited_by_count":19,"area":null},{"id":"2211.05632","title":"Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms","created":"2022-11-08","cited_by_count":19,"area":null},{"id":"2205.13170","title":"Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost","created":"2022-05-26","cited_by_count":13,"area":null},{"id":"2206.03098","title":"Better Best of Both Worlds Bounds for Bandits with Switching Costs","created":"2022-06-07","cited_by_count":13,"area":null},{"id":"2210.00701","title":"Near-Optimal Deployment Efficiency in Reward-Free Reinforcement Learning with Linear Function Approximation","created":"2022-10-03","cited_by_count":13,"area":null},{"id":"2105.09232","title":"Diffusion Approximations for Thompson Sampling in the Small Gap Regime","created":"2021-05-19","cited_by_count":12,"area":null},{"id":"2205.00984","title":"A Sharp Memory-Regret Trade-Off for Multi-Pass Streaming Bandits","created":"2022-05-02","cited_by_count":12,"area":null},{"id":"2307.04354","title":"Policy Finetuning in Reinforcement Learning via Design of Experiments using Offline Data","created":"2023-07-10","cited_by_count":11,"area":null},{"id":"2202.10660","title":"Batched Dueling Bandits","created":"2022-02-22","cited_by_count":10,"area":null},{"id":"2110.08057","title":"Almost Optimal Batch-Regret Tradeoff for Batch Linear Contextual Bandits","created":"2021-10-15","cited_by_count":9,"area":null},{"id":"2302.01539","title":"A Lipschitz Bandits Approach for Continuous Hyperparameter Optimization","created":"2023-02-03","cited_by_count":9,"area":null},{"id":"2302.12456","title":"Logarithmic Switching Cost in Reinforcement Learning beyond Linear MDPs","created":"2023-02-24","cited_by_count":9,"area":null},{"id":"2311.05794","title":"An Experimental Design for Anytime-Valid Causal Inference on Multi-Armed Bandits","created":"2023-11-09","cited_by_count":9,"area":null},{"id":"2310.14129","title":"Optimal Batched Best Arm Identification","created":"2023-10-21","cited_by_count":8,"area":null},{"id":"2408.00465","title":"Infrequent Resolving Algorithm for Online Linear Programming","created":"2024-08-01","cited_by_count":8,"area":null},{"id":"2111.02314","title":"Online Learning of Energy Consumption for Navigation of Electric Vehicles","created":"2021-11-03","cited_by_count":7,"area":null},{"id":"2302.01477","title":"A Reduction-based Framework for Sequential Decision Making with Delayed Feedback","created":"2023-02-03","cited_by_count":7,"area":null},{"id":"2302.07446","title":"On-Demand Communication for Asynchronous Multi-Agent Bandits","created":"2023-02-15","cited_by_count":7,"area":null},{"id":"2406.04137","title":"Optimal Batched Linear Bandits","created":"2024-06-06","cited_by_count":7,"area":null},{"id":"2211.06516","title":"Bandits for Online Calibration: An Application to Content Moderation on Social Media Platforms","created":"2022-11-11","cited_by_count":6,"area":null},{"id":"2302.12120","title":"Sequential Counterfactual Risk Minimization","created":"2023-02-23","cited_by_count":6,"area":null},{"id":"2410.02068","title":"Fast and Sample Efficient Multi-Task Representation Learning in Stochastic Contextual Bandits","created":"2024-10-02","cited_by_count":6,"area":null},{"id":"2210.06719","title":"Reward Imputation with Sketching for Contextual Batched Bandits","created":"2022-10-13","cited_by_count":5,"area":null},{"id":"2306.08803","title":"Langevin Thompson Sampling with Logarithmic Communication: Bandits and Reinforcement Learning","created":"2023-06-15","cited_by_count":5,"area":null},{"id":"2402.18591","title":"Stochastic contextual bandits with graph feedback: from independence number to MAS number","created":"2024-02-12","cited_by_count":5,"area":null},{"id":"2105.10590","title":"Parallelizing Contextual Bandits","created":"2021-05-21","cited_by_count":4,"area":null},{"id":"2111.04835","title":"Safe Data Collection for Offline and Online Policy Learning","created":"2021-11-08","cited_by_count":4,"area":null},{"id":"2502.02859","title":"Gap-Dependent Bounds for Federated $Q$-learning","created":"2025-02-05","cited_by_count":4,"area":null},{"id":"2110.00158","title":"Asymptotic Performance of Thompson Sampling in the Batched Multi-Armed Bandits","created":"2021-10-01","cited_by_count":3,"area":null},{"id":"2202.06657","title":"The Impact of Batch Learning in Stochastic Linear Bandits","created":"2022-02-14","cited_by_count":3,"area":null},{"id":"2301.11442","title":"Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits","created":"2023-01-26","cited_by_count":3,"area":null},{"id":"2308.04314","title":"Cooperative Multi-agent Bandits: Distributed Algorithms with Optimal Individual Regret and Constant Communication Costs","created":"2023-08-08","cited_by_count":3,"area":null},{"id":"2402.17732","title":"Batched Nonparametric Contextual Bandits","created":"2024-02-27","cited_by_count":3,"area":null},{"id":"2407.00571","title":"Adversarial Online Learning with Temporal Feedback Graphs","created":"2024-06-30","cited_by_count":3,"area":null},{"id":"2603.12627","title":"Batched Kernelized Bandits: Refinements and Extensions","created":"2026-03-13","cited_by_count":3,"area":null},{"id":"2108.06812","title":"Batched Thompson Sampling for Multi-Armed Bandits","created":"2021-08-15","cited_by_count":2,"area":null},{"id":"2209.12108","title":"An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem","created":"2022-09-25","cited_by_count":2,"area":null},{"id":"2303.11582","title":"Adaptive Experimentation at Scale: A Computational Framework for Flexible Batches","created":"2023-03-21","cited_by_count":2,"area":null},{"id":"2402.07391","title":"Replicability is Asymptotically Free in Multi-armed Bandits","created":"2024-02-12","cited_by_count":2,"area":null},{"id":"2405.05733","title":"Batched Stochastic Bandit for Nondegenerate Functions","created":"2024-05-09","cited_by_count":2,"area":null},{"id":"2503.00273","title":"Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits","created":"2025-03-01","cited_by_count":2,"area":null},{"id":"2507.08438","title":"Optimal and Practical Batched Linear Bandit Algorithm","created":"2025-07-11","cited_by_count":2,"area":null},{"id":"2508.03072","title":"Achieving Limited Adaptivity for Multinomial Logistic Bandits","created":"2025-08-05","cited_by_count":2,"area":null},{"id":"2606.00984","title":"Practical and Optimal Algorithm for Linear Contextual Bandits with Rare Parameter Updates","created":"2026-05-31","cited_by_count":2,"area":null},{"id":"2111.02071","title":"The Impact of Batch Learning in Stochastic Bandits","created":"2021-11-03","cited_by_count":1,"area":null},{"id":"2210.12198","title":"Anonymous Bandits for Multi-User Systems","created":"2022-10-21","cited_by_count":1,"area":null},{"id":"2312.13875","title":"Best Arm Identification in Batched Multi-armed Bandit Problems","created":"2023-12-21","cited_by_count":1,"area":null},{"id":"2406.00424","title":"A Batch Sequential Halving Algorithm without Performance Degradation","created":"2024-06-01","cited_by_count":1,"area":null},{"id":"2408.08859","title":"Stochastic Bandits Robust to Adversarial Attacks","created":"2024-08-16","cited_by_count":1,"area":null},{"id":"2410.12086","title":"Comparative Performance of Collaborative Bandit Algorithms: Effect of Sparsity and Exploration Intensity","created":"2024-10-15","cited_by_count":1,"area":null},{"id":"2505.10498","title":"Batched Nonparametric Bandits via k-Nearest Neighbor UCB","created":"2025-05-15","cited_by_count":1,"area":null},{"id":"2506.03324","title":"Optimization of Epsilon-Greedy Exploration","created":"2025-06-03","cited_by_count":1,"area":null},{"id":"2511.15507","title":"Sample-Adaptivity Tradeoff in On-Demand Sampling","created":"2025-11-19","cited_by_count":1,"area":null},{"id":"2603.13742","title":"Few Batches or Little Memory, But Not Both: Simultaneous Space and Adaptivity Constraints in Stochastic Bandits","created":"2026-03-14","cited_by_count":1,"area":null},{"id":"2605.30976","title":"Batched Stochastic Linear Bandits with 1-Bit Communication Constraints","created":"2026-05-29","cited_by_count":1,"area":null},{"id":"2109.14733","title":"Batched Bandits with Crowd Externalities","created":"2021-09-29","cited_by_count":0,"area":null},{"id":"2112.06423","title":"Stochastic differential equations for limiting description of UCB rule for Gaussian multi-armed bandits","created":"2021-12-13","cited_by_count":0,"area":null},{"id":"2204.10787","title":"MNL-Bandits under Inventory and Limited Switches Constraints","created":"2022-04-22","cited_by_count":0,"area":null},{"id":"2211.01798","title":"Phase Transitions in Learning and Earning under Price Protection Guarantee","created":"2022-11-03","cited_by_count":0,"area":null},{"id":"2305.11509","title":"From Random Search to Bandit Learning in Metric Measure Spaces","created":"2023-05-19","cited_by_count":0,"area":null},{"id":"2306.01995","title":"Asymptotically Optimal Pure Exploration for Infinite-Armed Bandits","created":"2023-06-03","cited_by_count":0,"area":null},{"id":"2306.16578","title":"Allocating Divisible Resources on Arms with Unknown and Random Rewards","created":"2023-06-28","cited_by_count":0,"area":null},{"id":"2410.14533","title":"The Traveling Bandit: A Framework for Bayesian Optimization with Movement Costs","created":"2024-10-18","cited_by_count":0,"area":null},{"id":"2501.17370","title":"Breaking the $\\log(1/\\Delta_2)$ Barrier: Better Batched Best Arm Identification with Adaptive Grids","created":"2025-01-29","cited_by_count":0,"area":null},{"id":"2502.07514","title":"A Near-optimal, Scalable and Parallelizable Framework for Stochastic Bandits Robust to Adversarial Corruptions and Beyond","created":"2025-02-11","cited_by_count":0,"area":null},{"id":"2509.04194","title":"Stochastic Matching Bandits with Rare Optimization Updates","created":"2025-09-04","cited_by_count":0,"area":null},{"id":"2510.03798","title":"Batched Bandits with Heavy-Tailed Rewards","created":"2025-10-04","cited_by_count":0,"area":null},{"id":"2510.21431","title":"Oracle-Efficient Combinatorial Semi-Bandits","created":"2025-10-24","cited_by_count":0,"area":null},{"id":"2511.03708","title":"The Adaptivity Barrier in Batched Nonparametric Bandits: Sharp Characterization of the Price of Unknown Margin","created":"2025-11-05","cited_by_count":0,"area":null},{"id":"2512.21794","title":"Multi-agent Adaptive Mechanism Design","created":"2025-12-25","cited_by_count":0,"area":null},{"id":"2605.12176","title":"Multi-Task Representation Learning for Conservative Linear Bandits","created":"2026-05-12","cited_by_count":0,"area":null},{"id":"2606.09802","title":"Bandits for Efficient Experimentation: Adapting to Control Group, Preferences, and Context Drifts","created":"2026-06-08","cited_by_count":0,"area":null},{"id":"2606.27448","title":"Learning in Markovian bandits with non-observable states and constrained decision epochs","created":"2026-06-25","cited_by_count":0,"area":null},{"id":"2606.31449","title":"Contextual Slate GLM Bandits with Limited Adaptivity","created":"2026-06-30","cited_by_count":0,"area":null},{"id":"2608.07922","title":"Memory--Batch Tradeoffs in Lipschitz Bandits","created":"2026-08-08","cited_by_count":0,"area":null},{"id":"2609.37932","title":"Learning When to Update: A Near-Optimal Timing Bandit Approach","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2610.13844","title":"Inference-Time Steering Across Scaffolds and Epitopes for Sample-Efficient De Novo Nanobody Design","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}