From the 1 of 8 linked papers with an AI index.
8 papers
Computing Barycentres of Measures for Generic Transport Costs
Eloi Tanguy, Julie Delon, Nathaël Gozlan
The paper proposes and analyzes a fixed‑point algorithm for computing barycentres of probability measures under general transport costs, providing convergence guarantees and numeri…
Sliced Transport Plans
Eloi Tanguy, Laetitia Chapel, Julie Delon
Since the introduction of the Sliced Wasserstein distance in the literature, its simplicity and efficiency have made it one of the most interesting surrogate for the Wasserstein di…
Expected Batch Optimal Transport Plans and Consequences for Flow Matching
Samuel Boïté, Julie Delon, Kimia Nadjahi
Solving optimal transport (OT) on random minibatches is a common surrogate for exact OT in large-scale learning. In flow matching (FM), this surrogate is used to obtain OT-like cou…
Tessellations of Semi-Discrete Flow Matching
Emile Pierret, Johannes Hertrich, Samuel Hurault +1
We study Flow Matching in a semi-discrete setting where a Gaussian source is transported toward a discrete target supported on finitely many points. This semi-discrete regime is th…
On the Relation between Rectified Flows and Optimal Transport
Johannes Hertrich, Antonin Chambolle, Julie Delon
This paper investigates the connections between rectified flows, flow matching, and optimal transport. Flow matching is a recent approach to learning generative models by estimatin…
Robust Barycenters of Persistence Diagrams
Keanu Sisouk, Eloi Tanguy, Julie Delon +1
This short paper presents a general approach for computing robust Wasserstein barycenters of persistence diagrams. The classical method consists in computing assignment arithmetic…