Average-Reward Policy Identification from a Single Continuing Trajectory
An algorithm is developed that learns where to collect information while ensuring that the required samples can be obtained efficiently, and a matching information theoretic lower bound is proved, showing that learning from a single trajectory is no harder in the worst case than learning with unrestricted access to sta...