Skip to content
Preprint

Stable Continuous-Time Consistency Distillation: An Empirical Study with a Multistep Extension

Oct 2026 · 0 citations · 27 references
Computer Science

TL;DR

Multistep sCD (MS-sCD), a continuous-time, segment-conditioned multistep generalization of sCD, a continuous-time, segment-conditioned multistep generalization of sCD borrowed from the discrete-time multistep consistency distillation of Heek et al.

Abstract

Continuous-time consistency models are an attractive route to few-step generation. They remove the discretization error inherent to the timestep grid that discrete-time consistency models depend on. Until recently, however, training them was unstable. Lu&Song (2025) address this with the TrigFlow formulation and a coordinated set of architectural and training-objective changes. We conduct an independent empirical study of this framework on CIFAR-10 and ImageNet-64. No open-weight TrigFlow teachers exist at these scales, so we train them from scratch and then verify the consistency distillation (sCD) and consistency training (sCT) behavior of students initialized from these teachers. On CIFAR-10, our students reproduce the reported FID at one and two steps. On ImageNet-64, they fall short, a gap that appears related to our teacher and to architectural choices the paper leaves unspecified. We also report a parameter-count gap of about 5% between the model size stated in the paper and a faithful re-implementation, which we attribute to the scale-and-shift conditioning projections in Adaptive Double Normalization. We then propose Multistep sCD (MS-sCD), a continuous-time, segment-conditioned multistep generalization of sCD. The segment-conditioning idea is borrowed from the discrete-time multistep consistency distillation of Heek et al. (2024); we build on their preliminary continuous-time experiments within the TrigFlow/sCM framework. The rest of the algorithm follows sCD. MS-sCD replaces sCM's two-step intermediate time with a fixed segment-boundary schedule and recovers sCD at M = 1. We report FID at M = 2, 4, 8 and compare against the discrete-time MSCD baseline. Code, model weights, and training scripts are available on GitHub (Mathew et al., 2026).

View source

Similar papers

Sep 2026

Koopman-Accelerated Model-Based Diffusion for Real-Time Robot Control

Conventional model-based diffusion (MBD) achieves effective trajectory optimization by leveraging noise annealing. However, its high computational cost, primarily arising from repeated rollouts of the plant dynamics, has largely confined its use to offline settings. To address this limitation, this paper proposes bilin...

Bohyeong Pak, Kang-Min Lee, Sang-Hoon Kim · 0 citations
#artificial intelligence Preprint Sep 2026

Attention Is All You Need (to Avoid Spurious Oscillations)

Can attention move a shock across several cells in one update without breaking it? We develop a conservative, fixed grid finite-volume scheme in which a CFL-conditioned attention flux selects upstream information according to the transport required by the current time step. One-dimensional inviscid Burgers transport is...

Jinyoung Jeong, Joseph B. Choi, Xin-Lun Cheng et al. · 0 citations
Open access Oct 2026

Multirate Runge–Kutta for Nonlinearly Partitioned Systems

Abstract. Multirate integration is an increasingly relevant tool that enables scientists to simulate multiphysics systems. Existing multirate methods are designed for equations whose fast and slow variables can be linearly separated using additive or componentwise partitions. However, in realistic applications, this a...

Tommaso Buvoli, Brian K. Tran, B. Southworth · 1 citation
Preprint Oct 2026

Online Autotuning of Algebraic Multigrid via Contextual Bandits and Reinforcement Learning

Algebraic multigrid (AMG) methods are widely used for solving large sparse linear systems, but their efficiency depends strongly on interacting setup and solve parameters. Effective parameter choices typically depend on the problem. We develop a phase-aware online autotuning method for hypre's BoomerAMG to reduce cumul...

Xu-Dong He, Rui-Yu Wang, Yi-Lang Ding et al. · 0 citations
Preprint Oct 2026

Two-Loop Stochastic Mirror Langevin Algorithms for Constrained Sampling

A stochastic first-order version of the Mirror Langevin Algorithm (sFO-MLA) is studied and finite-time Wasserstein guarantees for sFO-MLA are established that explicitly separate mixing, Euler--Maruyama discretization, and stochastic-gradient errors.

Rui-Ting Tong, Antik Chakraborty, R. Pasupathy · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.