CORTEXA
← Browse
arxivstat.MLcs.LG2026-06-29

Notes on generative modeling: flow matching, diffusion, optimal transport and Schr{ö}dinger bridge

Titouan Vayer

These notes recapitulate the high level mathematical principles behind different techniques for generative modeling. I show the connections between optimal transport and standard techniques such as Schr{ö}dinger bridge and flow matching.

View free PDFSource page

Related papers

arxivstat.MLcs.LG2026-07-05

Tightening the Score Matching Gap for Diffusion Models

Benjamin Dupuis, Tyler Farghly, Maxime Haddouche, Alain Durmus, Umut Simsekli

Diffusion models (DMs) are a state-of-the-art generative method to approximately sample from an unknown distribution. Their training and evaluation primarily rely on an Evidence Lower Bound (ELBO), which relates the Kullback-Leibler (KL) divergence of model samples to the score m…

View free PDFSource page
arxivstat.MLcs.LGmath.NAstat.ME2026-07-17

Cluster-Aware Matching via Laplacian Optimal Transport

Gabriel Samberg, YoonHaeng Hur, Yuehaw Khoo, Nir Sharon

In many applications of matching, the point clouds to be matched are not merely unstructured sets of points but rather samples from distributions with an intrinsic cluster structure. In such cases, as individual points are often interchangeable within a coherent region, finding a…

View free PDFSource page
arxivcs.LGcs.AIstat.ML2026-07-09

Reinforcing the Generation Order of Multimodal Masked Diffusion Models

Yidong Ouyang, Zhe Wang, Sourav Bhabesh, Dmitriy Bespalov

Diffusion Language Models (DLMs) have recently achieved substantial progress in natural language generation tasks. Recent research demonstrates that adaptive token generation ordering can significantly improve performance in mathematical reasoning and code synthesis applications.…

View free PDFSource page