{"total":57,"rows":[{"id":"2402.09401","title":"Reinforcement Learning from Human Feedback with Active Queries","created":"2024-02-14","cited_by_count":43,"area":"alignment"},{"id":"2302.10371","title":"Variance-Dependent Regret Bounds for Linear Bandits and Reinforcement Learning: Adaptivity and Computational Efficiency","created":"2023-02-21","cited_by_count":40,"area":null},{"id":"2305.08841","title":"A Theoretical Analysis of Optimistic Proximal Policy Optimization in Linear Markov Decision Processes","created":"2023-05-15","cited_by_count":29,"area":null},{"id":"2305.18246","title":"Provable and Practical: Efficient Exploration in Reinforcement Learning via Langevin Monte Carlo","created":"2023-05-29","cited_by_count":29,"area":null},{"id":"2404.03578","title":"Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms","created":"2024-04-04","cited_by_count":26,"area":"deeprl"},{"id":"2402.15399","title":"Distributionally Robust Off-Dynamics Reinforcement Learning: Provable Efficiency with Linear Function Approximation","created":"2024-02-23","cited_by_count":25,"area":"deeprl"},{"id":"2409.20521","title":"Upper and Lower Bounds for Distributionally Robust Off-Dynamics Reinforcement Learning","created":"2024-09-30","cited_by_count":16,"area":"deeprl"},{"id":"2302.06834","title":"Improved Regret Bounds for Linear Adversarial MDPs via Linear Optimization","created":"2023-02-14","cited_by_count":15,"area":null},{"id":"2405.02181","title":"Imitation Learning in Discounted Linear MDPs without exploration assumptions","created":"2024-05-03","cited_by_count":15,"area":"offlinerl"},{"id":"2306.06836","title":"Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds","created":"2023-06-12","cited_by_count":14,"area":null},{"id":"2307.02842","title":"Provably Efficient Iterated CVaR Reinforcement Learning with Function Approximation and Human Feedback","created":"2023-07-06","cited_by_count":14,"area":"alignment"},{"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":"2403.12946","title":"Sample Complexity of Offline Distributionally Robust Linear Markov Decision Processes","created":"2024-03-19","cited_by_count":14,"area":"offlinerl"},{"id":"2305.11032","title":"Optimistic Natural Policy Gradient: a Simple Efficient Policy Optimization Framework for Online RL","created":"2023-05-18","cited_by_count":13,"area":null},{"id":"2405.17061","title":"Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation","created":"2024-05-27","cited_by_count":10,"area":"deeprl"},{"id":"2305.06446","title":"Cooperative Multi-Agent Reinforcement Learning: Asynchronous Communication and Linear Function Approximation","created":"2023-05-10","cited_by_count":9,"area":null},{"id":"2310.01380","title":"Pessimistic Nonlinear Least-Squares Value Iteration for Offline Reinforcement Learning","created":"2023-10-02","cited_by_count":9,"area":"offlinerl"},{"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":"2308.01490","title":"Minimax Optimal Q Learning with Nearest Neighbors","created":"2023-08-03","cited_by_count":8,"area":null},{"id":"2303.10165","title":"Optimal Horizon-Free Reward-Free Exploration for Linear Mixture MDPs","created":"2023-03-17","cited_by_count":7,"area":null},{"id":"2306.10694","title":"On the Model-Misspecification in Reinforcement Learning","created":"2023-06-19","cited_by_count":7,"area":null},{"id":"2405.15050","title":"Reinforcement Learning for Infinite-Horizon Average-Reward Linear MDPs via Approximation by Discounted-Reward MDPs","created":"2024-05-23","cited_by_count":7,"area":"deeprl"},{"id":"2405.20165","title":"Randomized Exploration for Reinforcement Learning with Multinomial Logistic Function Approximation","created":"2024-05-30","cited_by_count":7,"area":"deeprl"},{"id":"2509.08660","title":"Replicable Reinforcement Learning with Linear Function Approximation","created":"2025-09-10","cited_by_count":7,"area":"deeprl"},{"id":"2401.17780","title":"A Policy Gradient Primal-Dual Algorithm for Constrained MDPs with Uniform PAC Guarantees","created":"2024-01-31","cited_by_count":6,"area":"deeprl"},{"id":"2403.10738","title":"Horizon-Free Regret for Linear Markov Decision Processes","created":"2024-03-15","cited_by_count":6,"area":"deeprl"},{"id":"2404.12648","title":"Sample-efficient Learning of Infinite-horizon Average-reward MDPs with General Function Approximation","created":"2024-04-19","cited_by_count":6,"area":null},{"id":"2408.04526","title":"Hybrid Reinforcement Learning Breaks Sample Size Barriers in Linear MDPs","created":"2024-08-08","cited_by_count":6,"area":"offlinerl"},{"id":"2402.02700","title":"Sample Complexity Characterization for Linear Contextual MDPs","created":"2024-02-05","cited_by_count":5,"area":"deeprl"},{"id":"2406.11810","title":"Computationally Efficient RL under Linear Bellman Completeness for Deterministic Dynamics","created":"2024-06-17","cited_by_count":5,"area":"deeprl"},{"id":"2407.03065","title":"Warm-up Free Policy Optimization: Improved Regret in Linear Markov Decision Processes","created":"2024-07-03","cited_by_count":5,"area":"deeprl"},{"id":"2305.08359","title":"Horizon-free Reinforcement Learning in Adversarial Linear Mixture MDPs","created":"2023-05-15","cited_by_count":4,"area":null},{"id":"2305.13185","title":"Regularization and Variance-Weighted Regression Achieves Minimax Optimality in Linear MDPs: Theory and Practice","created":"2023-05-22","cited_by_count":4,"area":null},{"id":"2311.07876","title":"Learning Adversarial Low-rank Markov Decision Processes with Unknown Transition and Full-information Feedback","created":"2023-11-14","cited_by_count":4,"area":null},{"id":"2402.01111","title":"Near-Optimal Reinforcement Learning with Self-Play under Adaptivity Constraints","created":"2024-02-02","cited_by_count":4,"area":"deeprl"},{"id":"2406.11640","title":"Linear Bellman Completeness Suffices for Efficient Online Reinforcement Learning with Few Actions","created":"2024-06-17","cited_by_count":4,"area":"deeprl"},{"id":"2511.03606","title":"Vector-valued self-normalized concentration inequalities beyond sub-Gaussianity","created":"2025-11-05","cited_by_count":4,"area":null},{"id":"2310.18919","title":"Posterior Sampling with Delayed Feedback for Reinforcement Learning with Linear Function Approximation","created":"2023-10-29","cited_by_count":3,"area":null},{"id":"2404.10745","title":"Achieving Constant Regret in Linear Markov Decision Processes","created":"2024-04-16","cited_by_count":3,"area":"deeprl"},{"id":"2408.00241","title":"Multiple Greedy Quasi-Newton Methods for Saddle Point Problems","created":"2024-08-01","cited_by_count":3,"area":null},{"id":"2502.02486","title":"Catoni Contextual Bandits are Robust to Heavy-tailed Rewards","created":"2025-02-04","cited_by_count":3,"area":null},{"id":"2505.14821","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","created":"2025-05-20","cited_by_count":3,"area":"deeprl"},{"id":"2406.13633","title":"Infinite-Horizon Reinforcement Learning with Multinomial Logistic Function Approximation","created":"2024-06-19","cited_by_count":2,"area":"deeprl"},{"id":"2410.19705","title":"Robust Thompson Sampling Algorithms Against Reward Poisoning Attacks","created":"2024-10-25","cited_by_count":2,"area":null},{"id":"2503.00810","title":"Minimax Optimal Reinforcement Learning with Quasi-Optimism","created":"2025-03-02","cited_by_count":2,"area":"deeprl"},{"id":"2508.20315","title":"Multi-Agent Reinforcement Learning in Intelligent Transportation Systems: A Comprehensive Survey","created":"2025-08-27","cited_by_count":2,"area":null},{"id":"2512.18957","title":"Online Robust Reinforcement Learning with General Function Approximation","created":"2025-12-22","cited_by_count":2,"area":"deeprl"},{"id":"2410.14992","title":"Learning Infinite-Horizon Average-Reward Linear Mixture MDPs of Bounded Span","created":"2024-10-19","cited_by_count":1,"area":null},{"id":"2410.21601","title":"The Limits of Transfer Reinforcement Learning with Latent Low-rank Structure","created":"2024-10-28","cited_by_count":1,"area":"deeprl"},{"id":"2609.00193","title":"Provably Efficient Federated Reinforcement Learning with Linear Function Approximation and Logarithmic Communication Cost","created":"2026-08-31","cited_by_count":1,"area":"deeprl"},{"id":"2407.21260","title":"Bellman Unbiasedness: Toward Provably Efficient Distributional Reinforcement Learning with General Value Function Approximation","created":"2024-07-31","cited_by_count":0,"area":"deeprl"},{"id":"2411.10906","title":"Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs","created":"2024-11-16","cited_by_count":0,"area":"deeprl"},{"id":"2504.09339","title":"Towards Optimal Differentially Private Regret Bounds in Linear MDPs","created":"2025-04-12","cited_by_count":0,"area":"deeprl"},{"id":"2603.23461","title":"End-to-End Efficient RL for Linear Bellman Complete MDPs with Deterministic Transitions","created":"2026-03-24","cited_by_count":0,"area":"deeprl"},{"id":"2604.13966","title":"Provably Efficient Offline-to-Online Value Adaptation with General Function Approximation","created":"2026-04-15","cited_by_count":0,"area":"offlinerl"},{"id":"2604.16684","title":"DARLING: Detection Augmented Reinforcement Learning with Non-Stationary Guarantees","created":"2026-04-17","cited_by_count":0,"area":"deeprl"},{"id":"2605.07218","title":"Improved Model-based Reinforcement Learning with Smooth Kernels","created":"2026-05-08","cited_by_count":0,"area":"deeprl"}],"next_cursor":null}