{"total":31,"rows":[{"id":"2110.14555","title":"V-Learning -- A Simple, Efficient, Decentralized Algorithm for Multiagent RL","created":"2021-10-27","cited_by_count":114,"area":null},{"id":"2110.04645","title":"Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning","created":"2021-10-09","cited_by_count":53,"area":null},{"id":"2207.07150","title":"Making Linear MDPs Practical via Contrastive Representation Learning","created":"2022-07-14","cited_by_count":52,"area":null},{"id":"2101.00494","title":"A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost","created":"2021-01-02","cited_by_count":40,"area":null},{"id":"2105.14363","title":"On the Theory of Reinforcement Learning with Once-per-Episode Feedback","created":"2021-05-29","cited_by_count":32,"area":null},{"id":"2102.05800","title":"Robust Policy Gradient against Strong Data Corruption","created":"2021-02-11","cited_by_count":30,"area":null},{"id":"2102.08492","title":"Reward Poisoning in Reinforcement Learning: Attacks Against Unknown Learners in Unknown Environments","created":"2021-02-16","cited_by_count":26,"area":null},{"id":"2111.11485","title":"A Free Lunch from the Noise: Provable and Practical Exploration for Representation Learning","created":"2021-11-22","cited_by_count":24,"area":null},{"id":"2305.15284","title":"Replicable Reinforcement Learning","created":"2023-05-24","cited_by_count":21,"area":null},{"id":"2111.00633","title":"Settling the Horizon-Dependence of Sample Complexity in Reinforcement Learning","created":"2021-11-01","cited_by_count":18,"area":null},{"id":"2301.13857","title":"Learning in POMDPs is Sample-Efficient with Hindsight Observability","created":"2023-01-31","cited_by_count":18,"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":"2102.12769","title":"No-Regret Reinforcement Learning with Heavy-Tailed Rewards","created":"2021-02-25","cited_by_count":14,"area":null},{"id":"2112.07066","title":"Continual Learning In Environments With Polynomial Mixing Times","created":"2021-12-13","cited_by_count":14,"area":null},{"id":"2410.05117","title":"Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability","created":"2024-10-07","cited_by_count":12,"area":null},{"id":"2211.14250","title":"Model-Free Reinforcement Learning with the Decision-Estimation Coefficient","created":"2022-11-25","cited_by_count":11,"area":null},{"id":"2302.06064","title":"Provably Safe Reinforcement Learning with Step-wise Violation Constraints","created":"2023-02-13","cited_by_count":11,"area":null},{"id":"2102.00490","title":"Online Markov Decision Processes with Aggregate Bandit Feedback","created":"2021-01-31","cited_by_count":10,"area":null},{"id":"2312.15427","title":"Semi-Bandit Learning for Monotone Stochastic Optimization","created":"2023-12-24","cited_by_count":8,"area":null},{"id":"2107.00685","title":"Gap-Dependent Bounds for Two-Player Markov Games","created":"2021-07-01","cited_by_count":5,"area":null},{"id":"2204.10349","title":"Provably Efficient Kernelized Q-Learning","created":"2022-04-21","cited_by_count":4,"area":null},{"id":"2209.09419","title":"Multi-armed Bandit Learning on a Graph","created":"2022-09-20","cited_by_count":3,"area":null},{"id":"2202.07995","title":"Branching Reinforcement Learning","created":"2022-02-16","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":"2106.08771","title":"Reinforcement Learning for Markovian Bandits: Is Posterior Sampling more Scalable than Optimism?","created":"2021-06-16","cited_by_count":1,"area":null},{"id":"2405.18626","title":"Causal Contextual Bandits with Adaptive Context","created":"2024-05-28","cited_by_count":1,"area":null},{"id":"2411.06069","title":"Model Selection for Average Reward RL with Application to Utility Maximization in Repeated Games","created":"2024-11-09","cited_by_count":1,"area":null},{"id":"2202.05799","title":"Rate-matching the regret lower-bound in the linear quadratic regulator with unknown dynamics","created":"2022-02-11","cited_by_count":0,"area":null},{"id":"2305.06936","title":"An Option-Dependent Analysis of Regret Minimization Algorithms in Finite-Horizon Semi-Markov Decision Processes","created":"2023-05-10","cited_by_count":0,"area":null},{"id":"2306.08762","title":"Near-Optimal Partially Observable Reinforcement Learning with Partial Online State Information","created":"2023-06-14","cited_by_count":0,"area":null},{"id":"2511.04594","title":"Regret Lower Bounds for Decentralized Multi-Agent Stochastic Shortest Path Problems","created":"2025-11-06","cited_by_count":0,"area":null}],"next_cursor":null}