arXiv (All)
open access
Diffusion Score Estimation with Shallow Neural Networks: Regularity, Approximation, and Finite-Sample Rates
We study the sample complexity of estimating Ornstein--Uhlenbeck diffusion scores in $\mathbb R^d$ using denoising score matching (DSM) with finite-width shallow ReLU networks, and its implications for reverse-process sampling. Under weak differentiability and polynomial-growth conditions on normali
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
- Leveraging Inference-Time Compute for Diffusion Models via Global Scheduling of Denoising Trajectories#1037550
- From Parallel to Sequential: Small-Batch Noise Restores Simplicity Bias of Muon#1341750
- Deep Stochastic Residual Methods for Fully Nonlinear Parabolic Equations#1399923
- Geometry-Aware Discretization Error of Diffusion Models#1233840
- Spectral-Guided Diffusion: Accelerating Inference via Static Spectral Layer Scheduling#1077433
Record · ID 1402594
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