mlsanityData to 7 Oct 2026

The Deep Minimizing Movement Scheme

arXiv 2109.14851 ↗First posted 30 Sep 2021math.NA cs.NA math.APcited by 15

Not on the map. Why?

Abstract (arXiv)

Solutions of certain partial differential equations (PDEs) are often represented by the steepest descent curves of corresponding functionals. Minimizing movement scheme was developed in order to study such curves in metric spaces. Especially, Jordan-Kinderlehrer-Otto studied the Fokker-Planck equation in this way with respect to the Wasserstein metric space. In this paper, we propose a deep learning-based minimizing movement scheme for approximating the solutions of PDEs. The proposed method is highly scalable for high-dimensional problems as it is free of mesh generation. We demonstrate through various kinds of numerical examples that the proposed method accurately approximates the solutions of PDEs by finding the steepest descent direction of a functional even in high dimensions.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Sep 2021.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 2; 2023: 1; 2024: 4; 2025: 5; 2026: 1.

15 papers.

Sort:

By area: