Approximative Policy Iteration for Exit Time Feedback Control Problems driven by Stochastic Differential Equations using Tensor Train format
Not on the map. Why?
Abstract (arXiv)
We consider a stochastic optimal exit time feedback control problem. The Bellman equation is solved approximatively via the Policy Iteration algorithm on a polynomial ansatz space by a sequence of linear equations. As high degree multi-polynomials are needed, the corresponding equations suffer from the curse of dimensionality even in moderate dimensions. We employ tensor-train methods to account for this problem. The approximation process within the Policy Iteration is done via a Least-Squares ansatz and the integration is done via Monte-Carlo methods. Numerical evidences are given for the (multi dimensional) double well potential and a three-hole potential.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 1; 2024: 0; 2025: 1.
4 papers.
- 2021Solving high-dimensional parabolic PDEs using the tensor train formatcited by 17
- 2023From continuous-time formulations to discretization schemes: tensor trains and robust regression for BSDEs and parabolic PDEscited by 5
- 2021Convergence bounds for nonlinear least squares and applications to tensor recoverycited by 2
- 2025Tensor Gaussian Processes: Efficient Solvers for Nonlinear PDEscited by 1
- 2025Tensor Gaussian Processes: Efficient Solvers for Nonlinear PDEs15 Oct 2025
- 2023From continuous-time formulations to discretization schemes: tensor trains and robust regression for BSDEs and parabolic PDEs28 Jul 2023
- 2021Convergence bounds for nonlinear least squares and applications to tensor recovery11 Aug 2021
- 2021Solving high-dimensional parabolic PDEs using the tensor train format23 Feb 2021