EDBT 2026 Demo / reviewers in the wild / expert
Martin Sípka
dblp:300/4464
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 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.
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Computational science and engineering · 100% | |
| Artificial intelligence
1 paper |
Generative modeling · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational science and engineering › computational chemistry › molecular simulation
molecular dynamics |
0.9 | 1 | 2025 | Action-Minimization Meets Generative Modeling: Efficient Transition Path Sampling with the Onsager-Machlup Functional · ICML 2025 |
Computational science and engineering › computational chemistry › molecular simulation › molecular dynamics
enhanced sampling |
0.7 | 1 | 2023 | Differentiable Simulations for Enhanced Sampling of Rare Events · ICML 2023 |
Computational science and engineering › computational chemistry
molecular simulation |
0.7 | 1 | 2023 | Differentiable Simulations for Enhanced Sampling of Rare Events · ICML 2023 |
Machine learning › Generative modeling
diffusion model |
0.3 | 1 | 2025 | Action-Minimization Meets Generative Modeling: Efficient Transition Path Sampling with the Onsager-Machlup Functional · ICML 2025 |
Machine learning › Generative modeling › diffusion model
score-based generative model |
0.3 | 1 | 2025 | Action-Minimization Meets Generative Modeling: Efficient Transition Path Sampling with the Onsager-Machlup Functional · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
onsager-machlup action functional · 1.7flow matching · 1.7denoising diffusion · 1.7path integral optimization · 0.7partial backpropagation · 0.7graph mini-batching · 0.7differentiable simulation · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Action-Minimization Meets Generative Modeling: Efficient Transition Path Sampling with the Onsager-Machlup FunctionalabstractTransition path sampling (TPS), which involves finding probable paths connecting two points on an energy landscape, remains a challenge due to the complexity of real-world atomistic systems. Current machine learning approaches rely on expensive training procedures and under-utilize growing quantities of atomistic data, limiting scalability and generalization. Generative models of atomistic conformational ensembles sample temporally independent states from energy landscapes, but their application to TPS remains mostly unexplored. In this work, we address TPS by interpreting candidate paths as trajectories sampled from stochastic dynamics induced by the learned score function of generative models, namely denoising diffusion and flow matching. Under these dynamics, finding high-likelihood transition paths becomes equivalent to minimizing the Onsager-Machlup (OM) action functional, enabling us to repurpose pre-trained generative models for TPS in a zero-shot fashion. We demonstrate our approach on a Müller-Brown potential and several fast-folding proteins, where we obtain diverse, physically realistic transition pathways, as well as tetrapeptides, where we demonstrate successful TPS on systems not seen by the generative model during training. Our method can be easily incorporated into new generative models, making it practically relevant as models continue to scale and improve. Sanjeev Raja, Martin Sípka, Michael Psenka, Tobias Kreiman, Michal Pavelka, Aditi S. Krishnapriyan |
ICML | 2 |
| 2023 | Differentiable Simulations for Enhanced Sampling of Rare EventsabstractSimulating rare events, such as the transformation of a reactant into a product in a chemical reaction typically requires enhanced sampling techniques that rely on heuristically chosen collective variables (CVs). We propose using differentiable simulations (DiffSim) for the discovery and enhanced sampling of chemical transformations without a need to resort to preselected CVs, using only a distance metric. Reaction path discovery and estimation of the biasing potential that enhances the sampling are merged into a single end-to-end problem that is solved by path-integral optimization. This is achieved by introducing multiple improvements over standard DiffSim such as partial backpropagation and graph mini-batching making DiffSim training stable and efficient. The potential of DiffSim is demonstrated in the successful discovery of transition paths for the Muller-Brown model potential as well as a benchmark chemical system - alanine dipeptide. Martin Sípka, Johannes C. B. Dietschreit, Lukás Grajciar, Rafael Gómez-Bombarelli |
ICML | 1 |