A Concentration Bound for LSPE(λ)
Abstract
The popular LSPE(λ) algorithm for policy evaluation is revisited to derive a concentration bound that gives high probability performance guarantees from some time on.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.