Proximal Recursion for Solving the Fokker-Planck Equation
Not on the map. Why?
Abstract (arXiv)
We develop a new method to solve the Fokker-Planck or Kolmogorov's forward equation that governs the time evolution of the joint probability density function of a continuous-time stochastic nonlinear system. Numerical solution of this equation is fundamental for propagating the effect of initial condition, parametric and forcing uncertainties through a nonlinear dynamical system, and has applications encompassing but not limited to forecasting, risk assessment, nonlinear filtering and stochastic control. Our methodology breaks away from the traditional approach of spatial discretization for solving this second-order partial differential equation (PDE), which in general, suffers from the "curse-of-dimensionality". Instead, we numerically solve an infinite dimensional proximal recursion in the space of probability density functions, which is theoretically equivalent to solving the Fokker-Planck-Kolmogorov PDE. We show that the dual formulation along with the introduction of an entropic regularization, leads to a smooth convex optimization problem that can be implemented via suitable block co-ordinate iteration and has fast convergence due to certain contraction property that we establish. This approach enables meshless implementation leading to remarkably fast computation.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 2; 2023: 0; 2024: 0; 2025: 1.
7 papers.
- 2021Large-Scale Wasserstein Gradient Flowscited by 76
- 2021Optimizing Functionals on the Space of Probabilities with Input Convex Neural Networkscited by 53
- 2021Efficient Gradient Flows in Sliced-Wasserstein Spacecited by 21
- 2021Wasserstein Proximal of GANscited by 15
- 2022Proximal Mean Field Learning in Shallow Neural Networkscited by 1
- 2022A Distributed Algorithm for Measure-valued Optimization with Additive Objectivecited by 0
- 2025Learning Concave Bid Shading Strategies in Online Auctions via Measure-valued Proximal Optimizationcited by 0
- 2025Learning Concave Bid Shading Strategies in Online Auctions via Measure-valued Proximal Optimization12 Sep 2025
- 2022Proximal Mean Field Learning in Shallow Neural Networks25 Oct 2022
- 2022A Distributed Algorithm for Measure-valued Optimization with Additive Objective17 Feb 2022
- 2021Efficient Gradient Flows in Sliced-Wasserstein Space21 Oct 2021
- 2021Optimizing Functionals on the Space of Probabilities with Input Convex Neural Networks1 Jun 2021
- 2021Large-Scale Wasserstein Gradient Flows1 Jun 2021
- 2021Wasserstein Proximal of GANs13 Feb 2021