Diffusion and flow matching models must discretize a continuous probability path into a finite sampling grid. When the total step budget is small—say 5 or 10 steps—the choice of grid dramatically affects generation quality. Yet most existing methods rely on heuristic grids: uniform spacing, cosine schedules, or schedules inherited directly from the diffusion model. Trentini, Stancevic, Bronstein, Tong, and Ambrogioni argue that existing grid design ignores the geometry of the path itself.
Core insight
Different positions along the probability path have different "value." In the middle region, the data and noise distributions are already well mixed, so a step yields little new information. But near the two ends—close to the data distribution on one side and the noise distribution on the other—the boundary constraints are tight, and a small distance spans a large difference in probability mass. Steps should therefore be concentrated at both ends.
Formalization
The authors formalize this intuition with a conditional-marginal entropy rate objective, which decomposes the information along the path into two parts:
- the bridge geometry imposed by endpoint constraints (the shape of the path), and
- the evolution of the marginal flow (the overall motion).
- 2D bridge models: 10-step ODE-Heun reduces MMD by 18.1%.
- CIFAR-10 (EDM): 5-step FID of 186.3 (linear: 200.5, cosine: 238.0).
- AlphaFlow protein generation: advantages in low-NFE regimes.
- The U-shaped schedule's advantage disappears at larger step counts (100+)—a uniform grid is fine when dense enough. Does this mean different step-count regimes should use different scheduling strategies?
- The method is training-free and uses no data adaptation, being entirely theory-driven. How widely does the theoretical approximation remain valid on non-Gaussian, more complex paths?
For a Gaussian Brownian bridge—the theoretical foundation of continuous diffusion—this entropy rate admits a closed-form solution with a U shape: high at both ends, low in the middle, confirming the intuition.
Experimental results
Across a range of experiments, entropy-rate-based non-uniform schedules consistently beat linear and cosine schedules under low compute budgets:
Open questions
References
1. Trentini, B., Stancevic, D., Bronstein, M. M., Tong, A., & Ambrogioni, L. (2026). *Entropy Across the Bridge: Conditional-Marginal Discretization for Flow and Schrödinger Samplers*. arXiv:2605.16126 [cs.LG]. 2. Song, Y., et al. (2021). *Score-Based Generative Modeling through Stochastic Differential Equations*. ICLR. 3. Karras, T., et al. (2022). *Elucidating the Design Space of Diffusion-Based Generative Models*. NeurIPS.