Iterating Consistency Models: Stability, Error Bounds and Noise Schedules

arXiv:2610.03414v1 Announce Type: cross Abstract: Consistency models (CMs) have become a leading approach for generating high-quality samples in few steps. However, adding steps can improve or degrade sample quality in ways that are highly sensitive to the schedule and that existing theory does not fully explain. To provide accuracy guarantees and guide CM sampler design, we analyze multistep CM sampling as a composition of noising and approximate denoising operators. Under explicit, verifiable stability assumptions, we derive a non-asymptotic error bound that separates contraction of the initialization error from accumulation of approximation error. The bound assigns distinct roles to the schedule: large early noise levels drive contraction, while small late noise levels control the residual bias. As a corollary, we obtain explicit constants for strongly log-concave and semi-log-concave targets. We further establish a complementary guarantee whose assumptions, one-step accuracy and stability, can be estimated for a given trained model. Experiments show that the contraction and approximation profiles entering our bounds can be reliably measured and closely match the predicted functional forms. Together, these results provide a meaningful convergence theory for multi-step CMs and a practical route to sampler design.

Related

• Stabilizing Consistency Training: A Flow Map Analysis and Self-Distillation
• Is the Future Compatible? Diagnosing Dynamic Consistency in World Action Models
• ASemConsist: Adaptive Semantic Feature Control for Training-Free Identity-Consistent Generation

Source: arXiv cs.CV | 2026-10-05