Offline reinforcement learning in large state spaces: algorithms and guarantees
From MaRDI portal
Cites work
- Feature-based methods for large scale dynamic programming
- Finite-sample analysis of least-squares policy iteration
- Finite-time analysis of the multiarmed bandit problem
- Finite-time bounds for fitted value iteration
- From -entropy to KL-entropy: analysis of minimum information complexity density estima\-tion
- scientific article; zbMATH DE number 5957269 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- Learning Near-Optimal Policies with Bellman-Residual Minimization Based Fitted Policy Iteration and a Single Sample Path
- Model selection in reinforcement learning
- Near-optimal reinforcement learning in polynomial time
- Performance Bounds in $L_p$‐norm for Approximate Value Iteration
- Policy iteration based on stochastic factorization
- Proximal reinforcement learning: efficient off-policy evaluation in partially observed Markov decision processes
- Reinforcement learning strategies for clinical trials in nonsmall cell lung cancer
- Reinforcement learning. An introduction
- Robust Markov Decision Processes
- Stochastic Systems
This page was built for publication: Offline reinforcement learning in large state spaces: algorithms and guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6860958)
