{"total":28,"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":"2202.06385","title":"Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost","created":"2022-02-13","cited_by_count":32,"area":null},{"id":"2202.06450","title":"Towards Deployment-Efficient Reinforcement Learning: Lower Bound and Optimality","created":"2022-02-14","cited_by_count":24,"area":null},{"id":"2203.03684","title":"Learn to Match with No Regret: Reinforcement Learning in Markov Matching Markets","created":"2022-03-07","cited_by_count":16,"area":null},{"id":"2105.08285","title":"Sublinear Least-Squares Value Iteration via Locality Sensitive Hashing","created":"2021-05-18","cited_by_count":15,"area":null},{"id":"2311.15238","title":"A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation","created":"2023-11-26","cited_by_count":14,"area":null},{"id":"2206.00165","title":"Byzantine-Robust Online and Offline Distributed Reinforcement Learning","created":"2022-06-01","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":"2112.01585","title":"Differentially Private Exploration in Reinforcement Learning with Linear Representation","created":"2021-12-02","cited_by_count":11,"area":null},{"id":"2202.01850","title":"A Robust Phased Elimination Algorithm for Corruption-Tolerant Gaussian Process Bandits","created":"2022-02-03","cited_by_count":11,"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":"2302.12456","title":"Logarithmic Switching Cost in Reinforcement Learning beyond Linear MDPs","created":"2023-02-24","cited_by_count":9,"area":null},{"id":"2202.01292","title":"Improved Regret for Differentially Private Exploration in Linear MDP","created":"2022-02-02","cited_by_count":8,"area":null},{"id":"2305.15546","title":"Regret-Optimal Model-Free Reinforcement Learning for Discounted MDPs with Short Burn-In Time","created":"2023-05-24","cited_by_count":8,"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":"2306.09554","title":"Low-Switching Policy Gradient with Exploration via Online Sensitivity Sampling","created":"2023-06-15","cited_by_count":6,"area":null},{"id":"2306.14468","title":"A General Framework for Sequential Decision-Making under Adaptivity Constraints","created":"2023-06-26","cited_by_count":6,"area":null},{"id":"2102.10616","title":"Dealing with Non-Stationarity in MARL via Trust-Region Decomposition","created":"2021-02-21","cited_by_count":5,"area":null},{"id":"2302.04374","title":"Near-Optimal Adversarial Reinforcement Learning with Switching Costs","created":"2023-02-08","cited_by_count":4,"area":null},{"id":"2303.00177","title":"Finite-sample Guarantees for Nash Q-learning with Linear Function Approximation","created":"2023-03-01","cited_by_count":4,"area":null},{"id":"2402.17732","title":"Batched Nonparametric Contextual Bandits","created":"2024-02-27","cited_by_count":3,"area":null},{"id":"2106.09973","title":"The Curse of Passive Data Collection in Batch Reinforcement Learning","created":"2021-06-18","cited_by_count":2,"area":null},{"id":"2205.15891","title":"One Policy is Enough: Parallel Exploration with a Single Policy is Near-Optimal for Reward-Free Reinforcement Learning","created":"2022-05-31","cited_by_count":2,"area":null},{"id":"2206.00270","title":"Provably Efficient Lifelong Reinforcement Learning with Linear Function Approximation","created":"2022-06-01","cited_by_count":2,"area":null},{"id":"2106.07203","title":"Online Sub-Sampling for Reinforcement Learning with General Function Approximation","created":"2021-06-14","cited_by_count":1,"area":null},{"id":"2210.10278","title":"A Reinforcement Learning Approach in Multi-Phase Second-Price Auction Design","created":"2022-10-19","cited_by_count":1,"area":null},{"id":"2112.06424","title":"A Benchmark for Low-Switching-Cost Reinforcement Learning","created":"2021-12-13","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}],"next_cursor":null}