Convergence of entropy-regularized natural policy gradient with linear function approximation

DOI10.1137/22M1540156MaRDI QIDQ6587339zbMATH OpenFDO

Authors Semih Cayci, Niao He, R. Srikant

Publication date 14 August 2024

Published in SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

nonconvex optimizationreinforcement learningpolicy gradient

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• scientific article; zbMATH DE number 1321699 (Why is no real title available?)
• scientific article; zbMATH DE number 7370615 (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?)
• Algorithms for reinforcement learning.
• An analysis of temporal-difference learning with function approximation
• Asymptotic evaluation of certain markov process expectations for large time. IV
• Natural actor-critic algorithms
• 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

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)