Sign inGet started
Paper · arXiv

Bridge Matching Sampler: Scalable Sampling via Generalized Fixed-Point Diffusion Matching

Sampling from unnormalized densities using diffusion models has emerged as a powerful paradigm. However, while recent approaches that use least-squares `matching' objectives have improved scalability, they often necessitate significant trade-offs, such as restricting prior distributions or relying on unstable optimization schemes. By generalizing these methods as special forms of fixed-point iterations rooted in Nelson's relation, we develop a new method that addresses these limitations, called Bridge Matching Sampler (BMS). Our approach enables learning a stochastic transport map between arbitrary prior and target distributions with a single, scalable, and stable objective. Furthermore, ...

AuthorsDenis Blessing, Lorenz Richter, Julius Berner et al.
Primary categorycs.LG
Published28 February 2026
Last updated at source8 October 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/eee10b59-1cae-4718-8c41-841e93b9bf8e" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.