arXiv (All)
open access
Query Lower Bounds for Diffusion Sampling
Diffusion models generate samples by iteratively querying learned score estimates. A rapidly growing literature focuses on accelerating sampling by minimizing the number of score evaluations, yet the information-theoretic limits of such acceleration remain unclear. In this work, we establish the f
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
- Hutch#: Optimal non-adaptive Frobenius norm estimation#1075941
- Efficient Covariate-Adaptive Randomization with Smallest Selection Bias in Clinical Trials#925683
- Score Accuracy Along the Forward Diffusion Does Not Certify Numerical Stability in Diffusion Sampling#353036
- Budget-Independent Influence Maximization in Nearly Linear Time#1049343
- Why Adaptive Optimizers Underestimate Rare Tokens#1141856
Record · ID 1130527
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