{"total":11,"rows":[{"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":"2408.08994","title":"Model-based RL as a Minimalist Approach to Horizon-Free and Second-Order Bounds","created":"2024-08-16","cited_by_count":11,"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":"2403.10738","title":"Horizon-Free Regret for Linear Markov Decision Processes","created":"2024-03-15","cited_by_count":6,"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":"2508.02103","title":"Instance-Dependent Continuous-Time Reinforcement Learning via Maximum Likelihood Estimation","created":"2025-08-04","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":"2504.09339","title":"Towards Optimal Differentially Private Regret Bounds in Linear MDPs","created":"2025-04-12","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"},{"id":"2609.33246","title":"Minimax-Optimality of Posterior Sampling for Reinforcement Learning","created":"2026-09-27","cited_by_count":0,"area":"deeprl"}],"next_cursor":null}