Query Lower Bounds for Diffusion Sampling
The episode discusses a paper titled "Query Lower Bounds for Diffusion Sampling" by Zhiyang Xun and Eric Price. The researchers established that any sampling algorithm requires at least (e sqrt d) adaptive score queries under polynomial accuracy constraints. This finding formalizes why multiscale noise schedules are necessary and suggests designing more efficient, structure-aware sampling algorithms.