Demo Data from VLDB 2026 / reviewers in the wild / expert
Matthieu Heitz
dblp:205/3060
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0003-1552-1688ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1
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 |
Probabilistic and Bayesian machine learning · 50% Optimization for machine learning · 50% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Optimization for machine learning › continuous-time analysis
mean-field langevin dynamics |
0.6 | 1 | 2022 | Trajectory Inference via Mean-field Langevin in Path Space · NeurIPS 2022 |
Machine learning › Probabilistic and Bayesian machine learning
trajectory inference |
0.6 | 1 | 2022 | Trajectory Inference via Mean-field Langevin in Path Space · NeurIPS 2022 |
Mathematical optimization
optimal transport |
0.6 | 1 | 2022 | Trajectory Inference via Mean-field Langevin in Path Space · NeurIPS 2022 |
Mathematical optimization › optimal transport
schrödinger bridge |
0.6 | 1 | 2022 | Trajectory Inference via Mean-field Langevin in Path Space · NeurIPS 2022 |
Bioinformatics and computational biology › single-cell analysis
single-cell RNA sequencing |
0.2 | 1 | 2022 | Trajectory Inference via Mean-field Langevin in Path Space · NeurIPS 2022 |
Methods — techniques the papers use, named apart from their topics
schrödinger bridge · 1.7min-entropy estimation · 1.7mean-field langevin · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Trajectory Inference via Mean-field Langevin in Path SpaceabstractTrajectory inference aims at recovering the dynamics of a population from snapshots of its temporal marginals. To solve this task, a min-entropy estimator relative to the Wiener measure in path space was introduced in [Lavenant et al., 2021], and shown to consistently recover the dynamics of a large class of drift-diffusion processes from the solution of an infinite dimensional convex optimization problem. In this paper, we introduce a grid-free algorithm to compute this estimator. Our method consists in a family of point clouds (one per snapshot) coupled via Schrödinger bridges which evolve with noisy gradient descent. We study the mean-field limit of the dynamics and prove its global convergence to the desired estimator. Overall, this leads to an inference method with end-to-end theoretical guarantees that solves an interpretable model for trajectory inference. We also present how to adapt the method to deal with mass variations, a useful extension when dealing with single cell RNA-sequencing data where cells can branch and die. Lénaïc Chizat, Stephen Zhang, Matthieu Heitz, Geoffrey Schiebinger |
NeurIPS | 3 |
| 2018 | Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary LearningabstractThis paper introduces a new nonlinear dictionary learning method for histograms in the probability simplex. The method leverages optimal transport theory, in the sense that our aim is to reconstruct histograms using so-called displacement interpolations (a.k.a. Wasserstein barycenters) between dictionary atoms; such atoms are themselves synthetic histograms in the probability simplex. Our method simultaneously estimates such atoms and, for each datapoint, the vector of weights that can optimally reconstruct it as an optimal transport barycenter of such atoms. Our method is computationally tractable thanks to the addition of an entropic regularization to the usual optimal transportation problem, leading to an approximation scheme that is efficient, parallel, and simple to differentiate. Both atoms and weights are learned using a gradient-based descent method. Gradients are obtained by automatic differentiation of the generalized Sinkhorn iterations that yield barycenters with entropic smoothing. Because of its formulation relying on Wasserstein barycenters instead of the usual matrix product between dictionary and codes, our method allows for nonlinear relationships between atoms and the reconstruction of input data. We illustrate its application in several different image processing settings. Morgan A. Schmitz, Matthieu Heitz, Nicolas Bonneel, Fred Maurice Ngolè Mboula, David Coeurjolly, Marco Cuturi, Gabriel Peyré, Jean-Luc Starck |
SIAM J. Imaging Sci. | 2 |