{"total":21,"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.14528","title":"ACE : Off-Policy Actor-Critic with Causality-Aware Entropy Regularization","created":"2024-02-22","cited_by_count":16,"area":"deeprl"},{"id":"2408.16981","title":"The Sample-Communication Complexity Trade-off in Federated Q-Learning","created":"2024-08-30","cited_by_count":9,"area":"deeprl"},{"id":"2410.07574","title":"Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition","created":"2024-10-10","cited_by_count":8,"area":"deeprl"},{"id":"2411.03810","title":"Hybrid Transfer Reinforcement Learning: Provable Sample Efficiency from Shifted-Dynamics Data","created":"2024-11-06","cited_by_count":8,"area":"deeprl"},{"id":"2406.01386","title":"Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond","created":"2024-06-03","cited_by_count":7,"area":"deeprl"},{"id":"2508.03768","title":"ORVIT: Near-Optimal Online Distributionally Robust Reinforcement Learning","created":"2025-08-05","cited_by_count":6,"area":"deeprl"},{"id":"2503.00810","title":"Minimax Optimal Reinforcement Learning with Quasi-Optimism","created":"2025-03-02","cited_by_count":2,"area":"deeprl"},{"id":"2506.04626","title":"Regret-Optimal Q-Learning with Low Cost for Single-Agent and Federated Reinforcement Learning","created":"2025-06-05","cited_by_count":2,"area":"deeprl"},{"id":"2506.00917","title":"Q-learning with Posterior Sampling","created":"2025-06-01","cited_by_count":1,"area":"deeprl"},{"id":"2507.22854","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","created":"2025-07-30","cited_by_count":1,"area":"deeprl"},{"id":"2510.03181","title":"Q-Learning with Shift-Aware Upper Confidence Bound in Non-Stationary Reinforcement Learning","created":"2025-10-03","cited_by_count":1,"area":"deeprl"},{"id":"2510.06647","title":"Q-Learning with Fine-Grained Gap-Dependent Regret","created":"2025-10-08","cited_by_count":1,"area":"deeprl"},{"id":"2602.15076","title":"Near-Optimal Sample Complexity for Online Constrained MDPs","created":"2026-02-16","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":"2409.18439","title":"State-free Reinforcement Learning","created":"2024-09-27","cited_by_count":0,"area":"deeprl"},{"id":"2505.13188","title":"When a Reinforcement Learning Agent Encounters Unknown Unknowns","created":"2025-05-19","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.01242","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","created":"2026-05-02","cited_by_count":0,"area":"deeprl"},{"id":"2605.15692","title":"Tighter Regret Bounds for Contextual Action-Set Reinforcement Learning","created":"2026-05-15","cited_by_count":0,"area":"deeprl"},{"id":"2609.36486","title":"Optimal Multi-Reward Reinforcement Learning","created":"2026-09-29","cited_by_count":0,"area":"deeprl"}],"next_cursor":null}