Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Frank van der Meulen

dblp:138/6422 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0001-7246-8612ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Probabilistic and Bayesian machine learning · 71% Generative modeling · 14% Language models and text generation · 14%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
0.912025
Neural Guided Diffusion Bridges · ICML 2025
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.912025
Backward Filtering Forward Guiding · J. Mach. Learn. Res. 2025
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › sequential monte carlo
particle filtering
0.912025
Backward Filtering Forward Guiding · J. Mach. Learn. Res. 2025
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
sequential monte carlo
0.912025
Backward Filtering Forward Guiding · J. Mach. Learn. Res. 2025
Natural language and speech › Language models and text generation › language modeling
smoothing
0.912025
Backward Filtering Forward Guiding · J. Mach. Learn. Res. 2025
Machine learning › Probabilistic and Bayesian machine learning
statistical inference
0.912025
Backward Filtering Forward Guiding · J. Mach. Learn. Res. 2025
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.912025
Neural Guided Diffusion Bridges · ICML 2025
Algorithms and data structures › randomized algorithms › sampling
markov chain monte carlo
0.312025
Neural Guided Diffusion Bridges · ICML 2025

Methods — techniques the papers use, named apart from their topics

neural network approximation · 1.7radon-nikodym derivative · 0.9forward guiding · 0.9diffusion bridges · 0.9diffusion bridge · 0.9backward filtering · 0.9
YearPublicationVenuePosition
2025 Neural Guided Diffusion Bridges
abstract
We propose a novel method for simulating conditioned diffusion processes (diffusion bridges) in Euclidean spaces. By training a neural network to approximate bridge dynamics, our approach eliminates the need for computationally intensive Markov Chain Monte Carlo (MCMC) methods or reverse-process modeling. Compared to existing methods, it offers greater robustness across various diffusion specifications and conditioning scenarios. This applies in particular to rare events and multimodal distributions, which pose challenges for score-learning- and MCMC-based approaches. We propose a flexible variational family for approximating the diffusion bridge path measure which is partially specified by a neural network. Once trained, it enables efficient independent sampling at a cost comparable to sampling the unconditioned (forward) process.
Gefan Yang, Frank van der Meulen, Stefan Sommer
ICML2
2025 Backward Filtering Forward Guiding
abstract
We study smoothing for discrete- and continuous-time stochastic processes on directed acyclic graphs (DAGs) when observations are available only at the leaf nodes, a problem common in phylogenetics, epidemiology, and signal processing. We introduce a unified framework built around guiding (also called twisting): a change-of-measure defined by guiding functions that transforms the original process into a guided process whose distribution approximates the smoothing distribution. The Radon-Nikodym derivative quantifies the discrepancy between the two measures. On directed trees, guiding functions are obtained via a backward-filtering step. By isolating backward filtering and forward guiding as elementary operations, we show that the approach extends beyond traditional state-space models and particle filters. We also generalize guiding to edges governed by continuous-time dynamics, using the change-of-measure construction described by Palmowski and Rolski (2002). The versatility of the framework is illustrated with two numerical examples: (i) a diffusion model for shape deformation on a tree, and (ii) inference in a factorial hidden Markov model.
Frank van der Meulen, Stefan Sommer
J. Mach. Learn. Res.1
2022 Diffusion Bridges for Stochastic Hamiltonian Systems and Shape Evolutions
abstract
Stochastically evolving geometric systems are studied in shape analysis and computational anatomy for modeling random evolutions of human organ shapes. The notion of geodesic paths between shapes is central to shape analysis and has a natural generalization as diffusion bridges in a stochastic setting. Simulation of such bridges is key to solving inference and registration problems in shape analysis. We demonstrate how to apply state-of-the-art diffusion bridge simulation methods to recently introduced stochastic shape deformation models, thereby substantially expanding the applicability of such models. We exemplify these methods by estimating template shapes from observed shape configurations while simultaneously learning model parameters.
Alexis Arnaudon, Frank van der Meulen, Moritz Schauer, Stefan Sommer
SIAM J. Imaging Sci.2