Solving Inverse Physics Problems with Score Matching

Benjamin J. Holzschuh, Simona Vegetti, Nils Thuerey
1/24/2023
cs.LGphysics.data-an

No official code found. Best implementation: tum-pbs/SMDP (33 stars, MIT, last commit 2023-12-04).

Abstract

We propose to solve inverse problems involving the temporal evolution of physics systems by leveraging recent advances from diffusion models. Our method moves the system's current state backward in time step by step by combining an approximate inverse physics simulator and a learned correction function. A central insight of our work is that training the learned correction with a single-step loss is equivalent to a score matching objective, while recursively predicting longer parts of the trajectory during training relates to maximum likelihood training of a corresponding probability flow. We highlight the advantages of our algorithm compared to standard denoising score matching and implicit score matching, as well as fully learned baselines for a wide range of inverse physics problems. The resulting inverse solver has excellent accuracy and temporal stability and, in contrast to other learned inverse solvers, allows for sampling the posterior of the solutions.

View on arXivView PDF

Code Implementations(1)

tum-pbs/SMDPCommunity100%
MIT

Solving Inverse Physics Problems with Score Matching

332Python, Jupyter NotebookOct 5, 20232 years agoMIT

Similar Papers

Cite this paper

@article{holzschuh2023solving,
  title  = {Solving Inverse Physics Problems with Score Matching},
  author = {Benjamin J. Holzschuh and Simona Vegetti and Nils Thuerey},
  year   = {2023},
  eprint = {2301.10250},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.10250v2},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.10250.svg)](https://codeofpaper.com/paper/2301.10250)

Discussion