Convergence of entropy-regularized natural policy gradient with linear function approximation
From MaRDI portal
Cites work
- Algorithms for reinforcement learning.
- An analysis of temporal-difference learning with function approximation
- Asymptotic evaluation of certain markov process expectations for large time. IV
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 7306852 (Why is no real title available?)
- scientific article; zbMATH DE number 3301983 (Why is no real title available?)
- Natural actor-critic algorithms
- On the theory of policy gradient methods: optimality, approximation, and distribution shift
- Random design analysis of ridge regression
- Reinforcement learning. An introduction
- Simple statistical gradient-following algorithms for connectionist reinforcement learning
- Understanding machine learning. From theory to algorithms
Cited in
(4)- An approximate policy iteration viewpoint of actor-critic algorithms
- Fisher-Rao gradient flows of linear programs and state-action natural policy gradients
- Optimal rates of convergence for entropy regularization in discounted Markov decision processes
- Policy optimization over general state and action spaces
This page was built for publication: Convergence of entropy-regularized natural policy gradient with linear function approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587339)
