The Modified MSA, a Gradient Flow and Convergence
Deven Sethi, David \v{S}i\v{s}ka

TL;DR
This paper introduces a modified iterative scheme for stochastic control problems, showing its convergence to a gradient flow and analyzing its rate of convergence in both convex and non-convex cases.
Contribution
It establishes the convergence properties of the modified MSA as a gradient flow and provides rates of convergence, including exponential convergence under strong convexity.
Findings
Interpolations of the iterates converge to a gradient flow with rate τ.
In non-convex cases, the gradient term converges to zero.
In convex cases, the objective converges at rate 1/S and exponentially under strong convexity.
Abstract
The modified Method of Successive Approximations (MSA) is an iterative scheme for approximating solutions to stochastic control problems in continuous time based on Pontryagin Optimality Principle which, starting with an initial open loop control, solves the forward equation, the backward adjoint equation and then performs a static minimization step. We observe that this is an implicit Euler scheme for a gradient flow system. We prove that appropriate interpolations of the iterates of the modified MSA converge to a gradient flow with rate . We then study the convergence of this gradient flow as time goes to infinity. In the general (non-convex) case we prove that the gradient term itself converges to zero. This is a consequence of an energy identity which shows that the optimization objective decreases along the gradient flow. Moreover, in the convex case, when Pontryagin…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and financial applications · Mathematical Biology Tumor Growth · Markov Chains and Monte Carlo Methods
