待翻译：Noise-Robust Conditional Flow Matching: Generating Clean Samples from Noisy Datasets
AI 服务暂时不可用，以下为来源摘要，待恢复后补全翻译：arXiv:2608.00064v1 Announce Type: new Abstract: Generative models learn the statistical properties of their training data, so high-quality generation depends on clean and representative datasets. In scientific imaging, acquisition often yields noisy measurements, while collecting clean references can be costly, impractical or even unattainable. Training directly on these measurements results in a model that reproduces the corrupted data. This can be circumvented by learning the clean population distribution directly from the noisy data. Conditional flow matching (CFM) combines a simple regression objective with stable training, efficient sampling, and strong image-generation performance, making it a natural framework for this setting. We introduce Noise-Robust Conditional Flow Matching (NR-CFM), an unconditional generator that learns from one corrupted observation per image. NR-CFM provides a closed-form clean endpoint correction for additive white Gaussian noise and learns a data-driven correction for general Gaussian corruptions with more complex covariance structure. Across the evaluated corruption settings, NR-CFM outperforms NR-GAN in most cases and remains competitive with Ambient Diffusion in the high-noise regime. We further evaluate NR-CFM on scientific data at signal-to-noise ratios as low as $0.001$, where it generates plausible particle images from severely corrupted measurements.
AI 服务暂时不可用，以下为来源正文，待恢复后补全翻译。
--> [Submitted on 28 Jul 2026] Title:Noise-Robust Conditional Flow Matching: Generating Clean Samples from Noisy Datasets View a PDF of the paper titled Noise-Robust Conditional Flow Matching: Generating Clean Samples from Noisy Datasets, by Adrian Urba\'nski and 2 other authors View PDF HTML (experimental) Abstract:Generative models learn the statistical properties of their training data, so high-quality generation depends on clean and representative datasets. In scientific imaging, acquisition often yields noisy measurements, while collecting clean references can be costly, impractical or even unattainable. Training directly on these measurements results in a model that reproduces the corrupted data. This can be circumvented by learning the clean population distribution directly from the noisy data. Conditional flow matching (CFM) combines a simple regression objective with stable training, efficient sampling, and strong image-generation performance, making it a natural framework for this setting. We introduce Noise-Robust Conditional Flow Matching (NR-CFM), an unconditional generator that learns from one corrupted observation per image. NR-CFM provides a closed-form clean endpoint correction for additive white Gaussian noise and learns a data-driven correction for general Gaussian corruptions with more complex covariance structure. Across the evaluated corruption settings, NR-CFM outperforms NR-GAN in most cases and remains competitive with Ambient Diffusion in the high-noise regime. We further evaluate NR-CFM on scientific data at signal-to-noise ratios as low as $0.001$, where it generates plausible particle images from severely corrupted measurements. Comments: 10 pages, 3 Figures, and an Appendix Subjects: Computer Vision and Pattern Recognition (cs.CV) MSC classes: 68T07, 68U10, 62M45, 94A08, 62H35 ACM classes: I.2.6; I.4.4; I.4.5; G.3 Cite as: arXiv:2608.00064 [cs.CV] (or arXiv:2608.00064v1 [cs.CV] for this version) https://doi.org/10.48550/arXiv.2608.00064 arXiv-issued DOI via DataCite Submission history From: Artur Yakimovich [view email] [v1] Tue, 28 Jul 2026 18:28:55 UTC (5,361 KB) Full-text links: Access Paper: View a PDF of the paper titled Noise-Robust Conditional Flow Matching: Generating Clean Samples from Noisy Datasets, by Adrian Urba\'nski and 2 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cs.CV new | recent | 2026-08 Change to browse by: cs References & Citations NASA ADS Google Scholar Semantic Scholar Loading... Data provided by: Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)