arXiv (All)
open access
Score Approximation for Diffusion Models on Arbitrary Low-Dimensional Structures
Score-based diffusion models have achieved remarkable empirical success, motivating extensive theoretical work to establish their foundations. However, existing complexity bounds for score approximation, a vital step in diffusion modeling, rely on rigid constraints such as Lipschitz continuous score
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
- Neural Network-Based Score Estimation in Diffusion Models: Optimization and Generalization#152980
- DASH: Dual-Branch Score Distillation for Guidance-Calibrated Compact Diffusion Models#793701
- DASH: Dual-Branch Score Distillation for Guidance-Calibrated Compact Diffusion Models#789697
- Globally optimal representations of low-complexity models: statistical guarantees and algorithms#450493
- Latent Diffusion Modeling of Two- and Three-dimensional Fracture Networks with Sparse Observation Conditioning#1325308
Record · ID 1202114
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