{"total":32,"rows":[{"id":"2305.14816","title":"Provable Offline Preference-Based Reinforcement Learning","created":"2023-05-24","cited_by_count":55,"area":null},{"id":"2202.07511","title":"Pessimistic Minimax Value Iteration: Provably Efficient Equilibrium Learning from Offline Datasets","created":"2022-02-15","cited_by_count":44,"area":null},{"id":"2203.07368","title":"The Efficacy of Pessimism in Asynchronous Q-Learning","created":"2022-03-14","cited_by_count":42,"area":null},{"id":"2212.09900","title":"Policy learning \"without\" overlap: Pessimism and generalized empirical Bernstein's inequality","created":"2022-12-19","cited_by_count":32,"area":null},{"id":"2112.14582","title":"A Statistical Analysis of Polyak-Ruppert Averaged Q-learning","created":"2021-12-29","cited_by_count":29,"area":null},{"id":"2206.05900","title":"Provable Benefit of Multitask Representation Learning in Reinforcement Learning","created":"2022-06-13","cited_by_count":29,"area":null},{"id":"2201.03522","title":"When is Offline Two-Player Zero-Sum Markov Game Solvable?","created":"2022-01-10","cited_by_count":28,"area":null},{"id":"2205.10671","title":"Pessimism for Offline Linear Contextual Bandits using $\\ell_p$ Confidence Sets","created":"2022-05-21","cited_by_count":18,"area":null},{"id":"2302.02252","title":"Reinforcement Learning in Low-Rank MDPs with Density Features","created":"2023-02-04","cited_by_count":18,"area":null},{"id":"2203.09251","title":"Near Instance-Optimal PAC Reinforcement Learning for Deterministic MDPs","created":"2022-03-17","cited_by_count":17,"area":null},{"id":"2212.04680","title":"Near-Optimal Differentially Private Reinforcement Learning","created":"2022-12-09","cited_by_count":16,"area":null},{"id":"2403.11574","title":"Offline Multitask Representation Learning for Reinforcement Learning","created":"2024-03-18","cited_by_count":14,"area":null},{"id":"2302.01248","title":"Robust Markov Decision Processes without Model Estimation","created":"2023-02-02","cited_by_count":11,"area":null},{"id":"2402.14703","title":"On the Curses of Future and History in Future-dependent Value Functions for Off-policy Evaluation","created":"2024-02-22","cited_by_count":10,"area":null},{"id":"2303.05606","title":"Variance-aware robust reinforcement learning with linear function approximation under heavy-tailed rewards","created":"2023-03-09","cited_by_count":8,"area":null},{"id":"2206.00796","title":"Stabilizing Q-learning with Linear Architectures for Provably Efficient Learning","created":"2022-06-01","cited_by_count":5,"area":null},{"id":"2207.06147","title":"A Near-Optimal Primal-Dual Method for Off-Policy Learning in CMDP","created":"2022-07-13","cited_by_count":5,"area":null},{"id":"2211.07092","title":"Offline Estimation of Controlled Markov Chains: Minimaxity and Sample Complexity","created":"2022-11-14","cited_by_count":5,"area":null},{"id":"2210.04946","title":"Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path","created":"2022-10-10","cited_by_count":4,"area":null},{"id":"2307.08840","title":"Bayesian Safe Policy Learning with Chance Constrained Optimization: Application to Military Security Assessment during the Vietnam War","created":"2023-07-17","cited_by_count":4,"area":null},{"id":"2205.12418","title":"Tiered Reinforcement Learning: Pessimism in the Face of Uncertainty and Constant Regret","created":"2022-05-25","cited_by_count":3,"area":null},{"id":"2206.04921","title":"Offline Stochastic Shortest Path: Learning, Evaluation and Towards Optimality","created":"2022-06-10","cited_by_count":3,"area":null},{"id":"2605.09214","title":"Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability","created":"2026-05-09","cited_by_count":3,"area":null},{"id":"2209.07148","title":"Semi-supervised Batch Learning From Logged Data","created":"2022-09-15","cited_by_count":2,"area":null},{"id":"2303.11187","title":"A Unified Framework of Policy Learning for Contextual Bandit with Confounding Bias and Missing Observations","created":"2023-03-20","cited_by_count":2,"area":null},{"id":"2411.04138","title":"NetworkGym: Reinforcement Learning Environments for Multi-Access Traffic Management in Network Simulation","created":"2024-10-30","cited_by_count":2,"area":null},{"id":"2501.06339","title":"On The Statistical Complexity of Offline Decision-Making","created":"2025-01-10","cited_by_count":2,"area":null},{"id":"2601.20116","title":"In-Context Reinforcement Learning From Suboptimal Historical Data","created":"2026-01-27","cited_by_count":2,"area":null},{"id":"2308.08858","title":"Improving Sample Efficiency of Model-Free Algorithms for Zero-Sum Markov Games","created":"2023-08-17","cited_by_count":0,"area":null},{"id":"2402.15703","title":"Is Offline Decision Making Possible with Only Few Samples? Reliable Decisions in Data-Starved Bandits via Trust Region Enhancement","created":"2024-02-24","cited_by_count":0,"area":null},{"id":"2602.14321","title":"Offline Learning of Nash Stable Coalition Structures with Possibly Overlapping Coalitions","created":"2026-02-15","cited_by_count":0,"area":null},{"id":"2605.06474","title":"Q-MMR: Off-Policy Evaluation via Recursive Reweighting and Moment Matching","created":"2026-05-07","cited_by_count":0,"area":null}],"next_cursor":null}