A Concentration Bound for LSPE($λ$)

This work addresses the need for theoretical guarantees in reinforcement learning policy evaluation, but it appears incremental as it builds on an existing algorithm.

The paper revisits the LSPE(λ) algorithm for policy evaluation to derive a concentration bound that provides high-probability performance guarantees after a certain time, but no concrete numbers are reported in the abstract.