Research map / Learning theory and algorithms / Optimal transport
Score-based Generative Modeling Secretly Minimizes the Wasserstein Distance
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Algorithm- and Data-Dependent Generalization Bounds for Diffusion Models (NeurIPS 2025 · similarity 0.91)
- Advancing Wasserstein Convergence Analysis of Score-Based Models: Insights from Discretization and Second-Order Acceleration (NeurIPS 2025 · similarity 0.89)
- Assessing the quality of denoising diffusion models in Wasserstein distance: noisy score and optimal bounds (NeurIPS 2025 · similarity 0.89)
- Score-based generative models are provably robust: an uncertainty quantification perspective (NeurIPS 2024 · similarity 0.89)
- Nearest Neighbour Score Estimators for Diffusion Generative Models (ICML 2024 · similarity 0.89)
- Evaluating the design space of diffusion-based generative models (NeurIPS 2024 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.