Convergence Analysis for Entropy-Regularized Control Problems: A Probabilistic Approach
Not on the map. Why?
Abstract (arXiv)
In this paper we investigate the convergence of the Policy Iteration Algorithm (PIA) for a class of general continuous-time entropy-regularized stochastic control problems. In particular, instead of employing sophisticated PDE estimates for the iterative PDEs involved in the algorithm (see, e.g., Huang-Wang-Zhou(2025)), we shall provide a simple proof from scratch for the convergence of the PIA. Our approach builds on probabilistic representation formulae for solutions of PDEs and their derivatives. Moreover, in the finite horizon model and in the infinite horizon model with large discount factor, the similar arguments lead to a super-exponential rate of convergence without tear. Finally, with some extra efforts we show that our approach can be extended to the diffusion control case in the one dimensional setting, also with a super-exponential rate of convergence.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 8 of its 27 references that are in the map. First posted on arXiv 16 Jun 2024.
Builds on
8 of 27 references.
References · 8
- 2020Entropy Regularization for Mean Field Games with Learningcited by 50
- 2021Exploratory HJB equations and their convergencecited by 28
- 2020Regularity and stability of feedback relaxed controlscited by 12
- 2024Policy Iteration for Exploratory Hamilton--Jacobi--Bellman Equationscited by 9
- 2020A modified MSA for stochastic control problemscited by 8
- 2019A neural network based policy iteration algorithm with global H2-superlinear convergence for stochastic games on domainscited by 7
- 2022Convergence of Policy Iteration for Entropy-Regularized Stochastic Control Problemscited by 6
- 2022Linear convergence of a policy gradient method for some finite horizon continuous time control problemscited by 4
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 1.
4 papers.
- 2024Regret of exploratory policy improvement and q-learningcited by 10
- 2025Accuracy of Discretely Sampled Stochastic Policies in Continuous-time Reinforcement Learningcited by 9
- 2025DeepPAAC: A New Deep Galerkin Method for Principal-Agent Problemscited by 0
- 2026Learning to Solve Stochastic Controls with Unknown Drifts and Running Rewards: Theory, Algorithms and Convergencecited by 0
- 2026Learning to Solve Stochastic Controls with Unknown Drifts and Running Rewards: Theory, Algorithms and Convergence14 Sep 2026
- 2025DeepPAAC: A New Deep Galerkin Method for Principal-Agent Problems6 Nov 2025
- 2025Accuracy of Discretely Sampled Stochastic Policies in Continuous-time Reinforcement Learning13 Mar 2025
- 2024Regret of exploratory policy improvement and q-learning2 Nov 2024