扩散流匹配的 KL 理论保证

Marta Gentiloni Silveri, Giovanni Conforti, Alain Durmus
{"title":"扩散流匹配的 KL 理论保证","authors":"Marta Gentiloni Silveri, Giovanni Conforti, Alain Durmus","doi":"arxiv-2409.08311","DOIUrl":null,"url":null,"abstract":"Flow Matching (FM) (also referred to as stochastic interpolants or rectified\nflows) stands out as a class of generative models that aims to bridge in finite\ntime the target distribution $\\nu^\\star$ with an auxiliary distribution $\\mu$,\nleveraging a fixed coupling $\\pi$ and a bridge which can either be\ndeterministic or stochastic. These two ingredients define a path measure which\ncan then be approximated by learning the drift of its Markovian projection. The\nmain contribution of this paper is to provide relatively mild assumptions on\n$\\nu^\\star$, $\\mu$ and $\\pi$ to obtain non-asymptotics guarantees for Diffusion\nFlow Matching (DFM) models using as bridge the conditional distribution\nassociated with the Brownian motion. More precisely, we establish bounds on the\nKullback-Leibler divergence between the target distribution and the one\ngenerated by such DFM models under moment conditions on the score of\n$\\nu^\\star$, $\\mu$ and $\\pi$, and a standard $L^2$-drift-approximation error\nassumption.","PeriodicalId":501340,"journal":{"name":"arXiv - STAT - Machine Learning","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Theoretical guarantees in KL for Diffusion Flow Matching\",\"authors\":\"Marta Gentiloni Silveri, Giovanni Conforti, Alain Durmus\",\"doi\":\"arxiv-2409.08311\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Flow Matching (FM) (also referred to as stochastic interpolants or rectified\\nflows) stands out as a class of generative models that aims to bridge in finite\\ntime the target distribution $\\\\nu^\\\\star$ with an auxiliary distribution $\\\\mu$,\\nleveraging a fixed coupling $\\\\pi$ and a bridge which can either be\\ndeterministic or stochastic. These two ingredients define a path measure which\\ncan then be approximated by learning the drift of its Markovian projection. The\\nmain contribution of this paper is to provide relatively mild assumptions on\\n$\\\\nu^\\\\star$, $\\\\mu$ and $\\\\pi$ to obtain non-asymptotics guarantees for Diffusion\\nFlow Matching (DFM) models using as bridge the conditional distribution\\nassociated with the Brownian motion. More precisely, we establish bounds on the\\nKullback-Leibler divergence between the target distribution and the one\\ngenerated by such DFM models under moment conditions on the score of\\n$\\\\nu^\\\\star$, $\\\\mu$ and $\\\\pi$, and a standard $L^2$-drift-approximation error\\nassumption.\",\"PeriodicalId\":501340,\"journal\":{\"name\":\"arXiv - STAT - Machine Learning\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - STAT - Machine Learning\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.08311\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - STAT - Machine Learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.08311","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

流匹配(FM)(也称为随机插值或矫正流)是一类生成模型,其目的是在有限时间内将目标分布 $\nu^\star$ 与辅助分布 $\mu$ 桥接起来,利用固定耦合 $\pi$ 和桥接,桥接可以是确定的,也可以是随机的。这两个要素定义了一种路径度量,然后可以通过学习其马尔可夫投影的漂移来近似该路径度量。本文的主要贡献在于提供了关于$\nu^\star$、$\mu$和$\pi$的相对温和的假设,从而为使用与布朗运动相关的条件分布作为桥梁的扩散流匹配(DFM)模型获得非渐近保证。更准确地说,我们在$\nu^\star$、$\mu$和$\pi$的分值的矩条件下,以及标准的$L^2$漂移逼近误差假设下,建立了目标分布与此类DFM模型所产生的一分布之间的库尔贝克-莱伯勒发散(Kullback-Leibler divergence)的边界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Theoretical guarantees in KL for Diffusion Flow Matching
Flow Matching (FM) (also referred to as stochastic interpolants or rectified flows) stands out as a class of generative models that aims to bridge in finite time the target distribution $\nu^\star$ with an auxiliary distribution $\mu$, leveraging a fixed coupling $\pi$ and a bridge which can either be deterministic or stochastic. These two ingredients define a path measure which can then be approximated by learning the drift of its Markovian projection. The main contribution of this paper is to provide relatively mild assumptions on $\nu^\star$, $\mu$ and $\pi$ to obtain non-asymptotics guarantees for Diffusion Flow Matching (DFM) models using as bridge the conditional distribution associated with the Brownian motion. More precisely, we establish bounds on the Kullback-Leibler divergence between the target distribution and the one generated by such DFM models under moment conditions on the score of $\nu^\star$, $\mu$ and $\pi$, and a standard $L^2$-drift-approximation error assumption.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fitting Multilevel Factor Models Cartan moving frames and the data manifolds Symmetry-Based Structured Matrices for Efficient Approximately Equivariant Networks Recurrent Interpolants for Probabilistic Time Series Prediction PieClam: A Universal Graph Autoencoder Based on Overlapping Inclusive and Exclusive Communities
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1