Sample-based planning and learning with function approximation

DOI10.1214/25-STS1001MaRDI QIDQ6860960zbMATH OpenFDO

Authors Tor Lattimore, Csaba Szepesvári

Publication date 10 February 2026

Published in Statistical Science (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/journals/statistical-science/volume-40/issue-4/Sample-Based-Planning-and-Learning-with-Function-Approximation/10.1214/25-STS1001.full

zbMATH Keywords

planningreinforcement learning

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• scientific article; zbMATH DE number 7370615 (Why is no real title available?)
• A new family of optimal adaptive controllers for Markov chains
• Adaptive control of linear time invariant systems: the ``Bet on the best principle
• Asymptotically efficient adaptive allocation rules
• Bandit algorithms
• Concentration inequalities. A nonasymptotic theory of independence
• Efficient approximate planning in continuous space Markovian decision problems
• Efficient reinforcement learning in deterministic systems with value function generalization
• Exponential lower bounds for planning in MDPs with linearly-realizable optimal action-value functions
• Finite-time bounds for fitted value iteration
• Learning Near-Optimal Policies with Bellman-Residual Minimization Based Fitted Policy Iteration and a Single Sample Path
• Minimum-volume ellipsoids. Theory and algorithms
• Near-optimal reinforcement learning in polynomial time
• Reinforcement Learning, Bit by Bit
• Reinforcement learning. An introduction
• Settling the horizon-dependence of sample complexity in reinforcement learning
• The Equivalence of Two Extremum Problems
• The complexity of dynamic programming
• Using Randomization to Break the Curse of Dimensionality

This page was built for publication: Sample-based planning and learning with function approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6860960)