Broader noise schedules and practical discretizations
Extend the geometric–distribution separation guarantees to broader noise schedules and practically used discrete samplers by establishing results that account for finite-step implementations, step-size selection, truncated time horizons, and non‑uniform time weighting while preserving the separation between geometry learning and distribution learning.
References
Several directions remain open: Noise schedules, discretizations, and training idealizations. It would be valuable to extend the theory to broader noise schedules and practically used discretizations, including the effects of finite-step samplers, step-size selection, and common training variations (e.g., truncated time horizons or non-uniform time weighting), while preserving a comparable separation between geometry learning and distribution learning.
It is possible that higher-order discretizations and other more sophisticated procedures could admit different local geometries, and hence potentially different optimal clocks for stepsize allocation.
Tighter constant estimates---needed only for quantitatively tight versions of the bound---would require spectral norm tracking and are left to future work.
Given that the schedule intimately interplays with Gaussian transition kernel approximation, we leave studying the effects it has on the weight computation for future work.