{"total":16,"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.08991","title":"Towards Robust Model-Based Reinforcement Learning Against Adversarial Corruption","created":"2024-02-14","cited_by_count":12,"area":"deeprl"},{"id":"2402.10228","title":"Q-Star Meets Scalable Posterior Sampling: Bridging Theory and Practice via HyperAgent","created":"2024-02-05","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":"2406.11810","title":"Computationally Efficient RL under Linear Bellman Completeness for Deterministic Dynamics","created":"2024-06-17","cited_by_count":5,"area":"deeprl"},{"id":"2406.16255","title":"Uncertainty-Aware Reward-Free Exploration with General Function Approximation","created":"2024-06-24","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":"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":"2402.18159","title":"Provable Risk-Sensitive Distributional Reinforcement Learning with General Function Approximation","created":"2024-02-28","cited_by_count":3,"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":"2403.11175","title":"Prior-dependent analysis of posterior sampling reinforcement learning with function approximation","created":"2024-03-17","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":"2405.18793","title":"Policy Zooming: Adaptive Discretization-based Infinite-Horizon Average-Reward Reinforcement Learning","created":"2024-05-29","cited_by_count":1,"area":"deeprl"},{"id":"2411.11647","title":"Near-Optimal Reinforcement Learning with Shuffle Differential Privacy","created":"2024-11-18","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":"2605.07218","title":"Improved Model-based Reinforcement Learning with Smooth Kernels","created":"2026-05-08","cited_by_count":0,"area":"deeprl"}],"next_cursor":null}