{"total":27,"rows":[{"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":"2405.17061","title":"Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation","created":"2024-05-27","cited_by_count":10,"area":"deeprl"},{"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":"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":"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":"2404.10745","title":"Achieving Constant Regret in Linear Markov Decision Processes","created":"2024-04-16","cited_by_count":3,"area":"deeprl"},{"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":"2503.00810","title":"Minimax Optimal Reinforcement Learning with Quasi-Optimism","created":"2025-03-02","cited_by_count":2,"area":"deeprl"},{"id":"2512.18957","title":"Online Robust Reinforcement Learning with General Function Approximation","created":"2025-12-22","cited_by_count":2,"area":"deeprl"},{"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.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}