arXiv Machine Learning
Average-Reward Policy Identification from a Single Continuing Trajectory
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jul 21
Non-Asymptotic Best Policy Identification Guarantees in Online Reinforcement Learning
arXiv:2607. 17201v1 Announce Type: cross Abstract: In this work we study the Best Policy Identification (BPI) problem in online, tabular Reinforcement Learning.
arXiv Machine Learning
Jun 16
Learning Policy from a Single Trajectory in Average-Reward Markov Decision Process
arXiv:2606. 16729v1 Announce Type: new Abstract: While there is an extensive body of work characterizing the sample complexity of discounted cumulative-reward MDPs, finite sample analyses for average-reward MDPs have been limited, and most existing works rely on restrictive assumptions such as ergodicity or access to a generative model.
arXiv Machine Learning
Sep 21
Trajectory Entropy Reinforcement Learning for Robust Robot Motor Skill Learning
arXiv:2505.04193v2 Announce Type: replace Abstract: Simplicity is a critical inductive bias for designing data-driven controllers, especially when robustness is important. Despite the impressive resu...
arXiv Machine Learning
Jun 2
Trajectory Data Suffices for Statistically Efficient Policy Evaluation in Fixed-Horizon Offline RL with Linear $q^\pi$-Realizability and Concentrability
arXiv:2510. 03494v2 Announce Type: replace Abstract: We study finite-horizon offline reinforcement learning (RL) with function approximation for both policy evaluation and policy optimization.
arXiv Machine Learning
1d ago
Confessions of a Masked MDP
arXiv:2610.28360v1 Announce Type: cross Abstract: In reinforcement learning, one presumes the action set to be known ahead of time, and, thus, one must know if any state-action pairs are not permissi...
arXiv Machine Learning
Jun 25
Auto-exploration for online reinforcement learning
arXiv:2512. 06244v2 Announce Type: replace Abstract: The exploration-exploitation dilemma in reinforcement learning (RL) is a fundamental challenge to efficient RL algorithms.