{"total":17,"rows":[{"id":"2305.16589","title":"The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model","created":"2023-05-26","cited_by_count":52,"area":null},{"id":"2307.13586","title":"Settling the Sample Complexity of Online Reinforcement Learning","created":"2023-07-25","cited_by_count":45,"area":null},{"id":"2305.10697","title":"The Blessing of Heterogeneity in Federated Q-Learning: Linear Speedup and Beyond","created":"2023-05-18","cited_by_count":36,"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":"2404.18909","title":"Sample-Efficient Robust Multi-Agent Reinforcement Learning in the Face of Environmental Uncertainty","created":"2024-04-29","cited_by_count":25,"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":"2303.03100","title":"A Finite-Sample Analysis of Payoff-Based Independent Learning in Zero-Sum Stochastic Games","created":"2023-03-03","cited_by_count":15,"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":"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":"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":"2605.02141","title":"On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization","created":"2026-05-04","cited_by_count":4,"area":null},{"id":"2205.09056","title":"Slowly Changing Adversarial Bandit Algorithms are Efficient for Discounted MDPs","created":"2022-05-18","cited_by_count":2,"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":"2312.04905","title":"Two-Timescale Q-Learning with Function Approximation in Zero-Sum Stochastic Games","created":"2023-12-08","cited_by_count":2,"area":null},{"id":"2403.11841","title":"Pessimistic Causal Reinforcement Learning with Mediators for Confounded Offline Data","created":"2024-03-18","cited_by_count":0,"area":null}],"next_cursor":null}