mlsanityData to 14 Oct 2026

Discrete-Time Approximations of Controlled Diffusions with Infinite Horizon Discounted and Average Cost

arXiv 2502.05596 ↗First posted 8 Feb 2025math.OCcited by 1

Not on the map. Why?

Abstract (arXiv)

We present discrete-time approximation of optimal control policies for infinite horizon discounted/ergodic control problems for controlled diffusions in Rd,. In particular, our objective is to show near optimality of optimal policies designed from the approximating discrete-time controlled Markov chain model, for the discounted/ergodic optimal control problems, in the true controlled diffusion model (as the sampling period approaches zero). To this end, we first construct suitable discrete-time controlled Markov chain models for which one can compute optimal policies and optimal values via several methods (such as value iteration, convex analytic method, reinforcement learning etc.). Then using a weak convergence technique, we show that the optimal policy designed for the discrete-time Markov chain model is near-optimal for the controlled diffusion model as the discrete-time model approaches the continuous-time model. This provides a practical approach for finding near-optimal control policies for controlled diffusions. Our conditions complement existing results in the literature, which have been arrived at via either probabilistic or PDE based methods.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 8 Feb 2025.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2024On Bellman equations for continuous-time policy evaluation I: discretization and approximation
  2. 2024Partially Observed Optimal Stochastic Control: Regularity, Optimality, Approximations, and Learning
  3. 2025Reconciling Discrete-Time Mixed Policies and Continuous-Time Relaxed Controls in Reinforcement Learning and Stochastic Control
  4. 2026Randomized Optimal Switching Problem and Related Mirror Descent Flow
  5. 2024Reinforcement Learning for Infinite-Horizon Average-Reward Linear MDPs via Approximation by Discounted-Reward MDPs
  6. 2026Learning to Solve Stochastic Controls with Unknown Drifts and Running Rewards: Theory, Algorithms and Convergence
  7. 2026Benign Nonconvex Landscape for Policy Optimization: Infinite-Horizon Discounted MDPs with General State and Action Spaces
  8. 2026Reinforcement Learning for Exponential Utility: Algorithms and Convergence in Discounted MDPs