Demo Data from EDBT 2026 / reviewers in the wild / expert
Simona Vegetti
dblp:338/5982
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Generative modeling · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational science and engineering · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
0.7 | 1 | 2023 | Solving Inverse Physics Problems with Score Matching · NeurIPS 2023 |
Machine learning › Generative modeling
score matching |
0.7 | 1 | 2023 | Solving Inverse Physics Problems with Score Matching · NeurIPS 2023 |
Computational science and engineering
inverse problem |
0.7 | 1 | 2023 | Solving Inverse Physics Problems with Score Matching · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
score matching · 1.3learned correction function · 1.3approximate inverse simulator · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Solving Inverse Physics Problems with Score MatchingabstractWe 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. Code and experiments are available at https://github.com/tum-pbs/SMDP. Benjamin J. Holzschuh, Simona Vegetti, Nils Thürey |
NeurIPS | 2 |