Policy Iteration for Exploratory Hamilton--Jacobi--Bellman Equations
Not on the map. Why?
Abstract (arXiv)
We study the policy iteration algorithm (PIA) for entropy-regularized stochastic control problems on an infinite time horizon with a large discount rate, focusing on two main scenarios. First, we analyze PIA with bounded coefficients where the controls applied to the diffusion term satisfy a smallness condition. We demonstrate the convergence of PIA based on a uniform C2,α estimate for the value sequence generated by PIA, and provide a quantitative convergence analysis for this scenario. Second, we investigate PIA with unbounded coefficients but no control over the diffusion term. In this scenario, we first provide the well-posedness of the exploratory Hamilton--Jacobi--Bellman equation with linear growth coefficients and polynomial growth reward function. By such a well-posedess result we achieve PIA's convergence by establishing a quantitative locally uniform C1,α estimates for the generated value sequence.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Jun 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 3; 2025: 4; 2026: 2.
9 papers.
- 2024Regret of exploratory policy improvement and q-learningcited by 10
- 2024Exploratory Optimal Stopping: A Singular Control Formulationcited by 5
- 2024Convergence Analysis for Entropy-Regularized Control Problems: A Probabilistic Approachcited by 4
- 2025Continuous-time reinforcement learning for optimal switching over multiple regimescited by 4
- 2025Continuous Policy and Value Iteration for Relaxed Stochastic Control Problems and Its Convergencecited by 1
- 2025Solving nonconvex Hamilton--Jacobi--Isaacs equations with PINN-based policy iterationcited by 1
- 2025DeepPAAC: A New Deep Galerkin Method for Principal-Agent Problemscited by 0
- 2026Monotone Neural Policy Iteration for High-Dimensional First-Order Hamilton--Jacobi--Bellman Equationscited 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
- 2026Monotone Neural Policy Iteration for High-Dimensional First-Order Hamilton--Jacobi--Bellman Equations8 May 2026
- 2025Continuous-time reinforcement learning for optimal switching over multiple regimes4 Dec 2025
- 2025DeepPAAC: A New Deep Galerkin Method for Principal-Agent Problems6 Nov 2025
- 2025Solving nonconvex Hamilton--Jacobi--Isaacs equations with PINN-based policy iteration21 Jul 2025
- 2025Continuous Policy and Value Iteration for Relaxed Stochastic Control Problems and Its Convergence9 Jun 2025
- 2024Regret of exploratory policy improvement and q-learning2 Nov 2024
- 2024Exploratory Optimal Stopping: A Singular Control Formulation18 Aug 2024
- 2024Convergence Analysis for Entropy-Regularized Control Problems: A Probabilistic Approach16 Jun 2024