mlsanityData to 7 Oct 2026

Policy Iteration for Exploratory Hamilton--Jacobi--Bellman Equations

arXiv 2406.00612 ↗First posted 2 Jun 2024math.OC math.APcited by 9

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

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 4; 2026: 2.

9 papers.