Research map / Learning theory and algorithms / Sample complexity
Convergence for score-based generative modeling with polynomial complexity
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)
- Global Well-posedness and Convergence Analysis of Score-based Generative Models via Sharp Lipschitz Estimates (ICLR 2025 · similarity 0.90)
- Approximation and Generalization Abilities of Score-based Neural Network Generative Models for Sub-Gaussian Distributions (NeurIPS 2025 · similarity 0.90)
- Beyond Log-Concavity and Score Regularity: Improved Convergence Bounds for Score-Based Generative Models in W2-distance (ICML 2025 · similarity 0.90)
- Score-based generative models are provably robust: an uncertainty quantification perspective (NeurIPS 2024 · similarity 0.90)
- A Non-Asymptotic Convergent Analysis for Scored-Based Graph Generative Model via a System of Stochastic Differential Equations (ICML 2025 · similarity 0.89)
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.