Q-learning and enhanced policy iteration in discounted dynamic programming
From MaRDI portal
Recommendations
- Q-learning and policy iteration algorithms for stochastic shortest path problems
- Empirical Q-value iteration
- Adaptive policy-iteration and policy-value-iteration for discounted Markov decision processes
- Approximate policy iteration: a survey and some new methods
- Learning algorithms for Markov decision processes with average cost
Cited in
(21)- Q-learning for Markov decision processes with a satisfiability criterion
- Error bounds for constant step-size \(Q\)-learning
- Prospect-theoretic Q-learning
- On the convergence of reinforcement learning with Monte Carlo exploring starts
- Convergence of discretization procedure in Q-learning
- Empirical dynamic programming
- Approximate policy iteration: a survey and some new methods
- Robust shortest path planning and semicontractive dynamic programming
- Dynamic shortest path problems: hybrid routing policies considering network disruptions
- A mixed value and policy iteration method for stochastic control with universally measurable policies
- Hyperbolically Discounted Temporal Difference Learning
- Q-learning and policy iteration algorithms for stochastic shortest path problems
- (Approximate) iterated successive approximations algorithm for sequential decision processes
- A Q-learning approach for investment decisions
- scientific article; zbMATH DE number 6860770 (Why is no real title available?)
- Dynamic programming deconstructed: transformations of the Bellman equation and computational efficiency
- Some limit properties of Markov chains induced by recursive stochastic algorithms
- Unified NDP method based on TD(0) learning for both average and discounted Markov decision processes
- Empirical Q-value iteration
- Strategy synthesis for zero-sum neuro-symbolic concurrent stochastic games
- Proximal algorithms and temporal difference methods for solving fixed point problems
This page was built for publication: Q-learning and enhanced policy iteration in discounted dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884305)
