{"total":15,"rows":[{"id":"2403.12338","title":"Stochastic Halpern iteration in normed spaces and applications to reinforcement learning","created":"2024-03-19","cited_by_count":12,"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":"2501.09080","title":"Average-Reward Soft Actor-Critic","created":"2025-01-15","cited_by_count":6,"area":"deeprl"},{"id":"2403.05738","title":"Provable Policy Gradient Methods for Average-Reward Markov Potential Games","created":"2024-03-09","cited_by_count":5,"area":"deeprl"},{"id":"2510.18340","title":"Why Policy Gradient Algorithms Work for Undiscounted Total-Reward MDPs","created":"2025-10-21","cited_by_count":4,"area":"deeprl"},{"id":"2602.08000","title":"Regret Analysis of Unichain Average Reward Constrained MDPs with General Parameterization","created":"2026-02-08","cited_by_count":4,"area":"deeprl"},{"id":"2505.12462","title":"Model-Free Robust Average-Reward Reinforcement Learning with Sample Complexity Analysis","created":"2025-05-18","cited_by_count":3,"area":"deeprl"},{"id":"2509.18822","title":"On the Convergence of Policy Mirror Descent with Temporal Difference Evaluation","created":"2025-09-23","cited_by_count":3,"area":"deeprl"},{"id":"2512.06244","title":"Auto-exploration for online reinforcement learning","created":"2025-12-06","cited_by_count":3,"area":"deeprl"},{"id":"2601.13642","title":"Sample Complexity of Average-Reward Q-Learning: From Single-agent to Federated Reinforcement Learning","created":"2026-01-20","cited_by_count":3,"area":"deeprl"},{"id":"2602.18003","title":"Policy Gradient Algorithms in Average-Reward Multichain MDPs","created":"2026-02-20","cited_by_count":3,"area":"deeprl"},{"id":"2512.24056","title":"Policy Mirror Descent with Temporal Difference Learning: Sample Complexity under Online Markov Data","created":"2025-12-30","cited_by_count":2,"area":"deeprl"},{"id":"2603.23926","title":"Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs","created":"2026-03-25","cited_by_count":2,"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":"2604.06039","title":"Value Mirror Descent for Reinforcement Learning","created":"2026-04-07","cited_by_count":1,"area":"deeprl"}],"next_cursor":null}