{"title":"BM$^2$:耦合薛定谔桥匹配","authors":"Stefano Peluchetti","doi":"arxiv-2409.09376","DOIUrl":null,"url":null,"abstract":"A Schr\\\"{o}dinger bridge establishes a dynamic transport map between two\ntarget distributions via a reference process, simultaneously solving an\nassociated entropic optimal transport problem. We consider the setting where\nsamples from the target distributions are available, and the reference\ndiffusion process admits tractable dynamics. We thus introduce Coupled Bridge\nMatching (BM$^2$), a simple \\emph{non-iterative} approach for learning\nSchr\\\"{o}dinger bridges with neural networks. A preliminary theoretical\nanalysis of the convergence properties of BM$^2$ is carried out, supported by\nnumerical experiments that demonstrate the effectiveness of our proposal.","PeriodicalId":501340,"journal":{"name":"arXiv - STAT - Machine Learning","volume":"23 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"BM$^2$: Coupled Schrödinger Bridge Matching\",\"authors\":\"Stefano Peluchetti\",\"doi\":\"arxiv-2409.09376\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A Schr\\\\\\\"{o}dinger bridge establishes a dynamic transport map between two\\ntarget distributions via a reference process, simultaneously solving an\\nassociated entropic optimal transport problem. We consider the setting where\\nsamples from the target distributions are available, and the reference\\ndiffusion process admits tractable dynamics. We thus introduce Coupled Bridge\\nMatching (BM$^2$), a simple \\\\emph{non-iterative} approach for learning\\nSchr\\\\\\\"{o}dinger bridges with neural networks. A preliminary theoretical\\nanalysis of the convergence properties of BM$^2$ is carried out, supported by\\nnumerical experiments that demonstrate the effectiveness of our proposal.\",\"PeriodicalId\":501340,\"journal\":{\"name\":\"arXiv - STAT - Machine Learning\",\"volume\":\"23 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-14\",\"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.09376\",\"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.09376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Schr\"{o}dinger bridge establishes a dynamic transport map between two
target distributions via a reference process, simultaneously solving an
associated entropic optimal transport problem. We consider the setting where
samples from the target distributions are available, and the reference
diffusion process admits tractable dynamics. We thus introduce Coupled Bridge
Matching (BM$^2$), a simple \emph{non-iterative} approach for learning
Schr\"{o}dinger bridges with neural networks. A preliminary theoretical
analysis of the convergence properties of BM$^2$ is carried out, supported by
numerical experiments that demonstrate the effectiveness of our proposal.