arXiv (All)
open access
Beyond Log-Concavity and Score Regularity: Improved Convergence Bounds for Score-Based Generative Models in W2-distance
Score-based Generative Models (SGMs) aim to sample from a target distribution by learning score functions using samples perturbed by Gaussian noise. Existing convergence bounds for SGMs in the W2-distance rely on stringent assumptions about the data distribution. In this work, we present a novel fra
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- STAMP: Predicting Out-of-Distribution Generalization without Target Data#1117003
- Ambient Dataloops: Generative Models for Dataset Refinement#1013493
- GPC: An expressive and tractable deep generative model for genetic variation data#1221462
- IsingFormer: Augmenting Parallel Tempering With Learned Proposals#1070712
- From Graphs to Feeders: Constraint-Guided Diffusion for Rule-Compliant Feeder Generation#1077950
Record · ID 1187216
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive