{"total":15,"rows":[{"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":"2408.16262","title":"On Convergence of Average-Reward Q-Learning in Weakly Communicating Markov Decision Processes","created":"2024-08-29","cited_by_count":9,"area":"deeprl"},{"id":"2505.19986","title":"Regret Analysis of Average-Reward Unichain MDPs via an Actor-Critic Approach","created":"2025-05-26","cited_by_count":7,"area":"deeprl"},{"id":"2403.11925","title":"Towards Global Optimality for Practical Average Reward Reinforcement Learning without Mixing Time Oracles","created":"2024-03-18","cited_by_count":6,"area":"deeprl"},{"id":"2410.23498","title":"Kernel-Based Function Approximation for Average Reward Reinforcement Learning: An Optimist No-Regret Algorithm","created":"2024-10-30","cited_by_count":6,"area":"deeprl"},{"id":"2501.09080","title":"Average-Reward Soft Actor-Critic","created":"2025-01-15","cited_by_count":6,"area":"deeprl"},{"id":"2510.20725","title":"No-Regret Thompson Sampling for Finite-Horizon Markov Decision Processes with Gaussian Processes","created":"2025-10-23","cited_by_count":4,"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":"2605.11586","title":"Learning Weakly Communicating Average-Reward CMDPs: Strong Duality and Improved Regret","created":"2026-05-12","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":"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":"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":"2410.19919","title":"Provably Adaptive Average Reward Reinforcement Learning for Metric Spaces","created":"2024-10-25","cited_by_count":0,"area":"deeprl"},{"id":"2608.07725","title":"Finite Constant Frontiers and Auditable Regret Certificates for Average-Reward Reinforcement Learning","created":"2026-08-07","cited_by_count":0,"area":"deeprl"},{"id":"2609.39093","title":"Learning Infinite-Horizon Average-Reward CMDPs via State Augmentation","created":"2026-09-30","cited_by_count":0,"area":"deeprl"}],"next_cursor":null}