TRACK: TRajectory-Aware Capacity routing via top-K selection is presented, a heterogeneous denoising strategy that switches between compatible large and small models at selected steps, reducing the average cost per denoising evaluation.
Abstract
Video diffusion is computationally expensive, as it requires executing a large model across many denoising steps. Even with step-distillation, inference remains expensive because every distilled step still requires a costly model evaluation. We present TRACK: TRajectory-Aware Capacity routing via top-K selection, a heterogeneous denoising strategy that switches between compatible large and small models at selected steps, reducing the average cost per denoising evaluation. The switching steps are determined using a calibration process. TRACK first rolls out a reference trajectory with the large model. Then at each step, the small model's prediction is also collected and compared against the large model's prediction to obtain a relative disagreement score. Both models receive the same latent, timestep, conditioning, and guidance inputs. Aggregating this signal over a calibration set produces a disagreement score map across diffusion steps, which determines a switching policy for an efficient inference process: quality-sensitive steps keep using the large model, while steps with low disagreement scores are routed to the small model. Inference executes only the selected model at each step, requiring no retraining, architecture or scheduler changes, or online dual-model evaluation. Across Wan 2.1, Cosmos 3, TurboDiffusion, and FastVideo, TRACK yields $1.95\times$, $2.04\times$-$2.73\times$, $2.69\times$, and $2.17\times$ speedups, respectively, with comparable aggregate quality and high diversity retention. TRACK thereby establishes automated, training-free model switching as a practical acceleration paradigm for video diffusion.
Diffusion models generate a sample by traversing a denoising trajectory, a sequence of stochastic noise-reduction steps that transforms pure noise into a draw from a target distribution. At deployment time, additional computation can improve sample quality without retraining: at each step, the sampler draws several can...
Yuan Cao, Yi-Fu Tang, Hang-Qi Li et al.· 0 citations
Adaptive-WAM is introduced, a quality-aware multi-exit planner built on a Wan2.2-5B backbone that avoids the iterative classifier-free denoising loop and VAE decoding required for future-video synthesis, while dynamically allocating backbone depth according to trajectory quality.
POGP is introduced, a framework that learns a prefix value function at every intermediate denoising step through a Bellman-style recursion over the denoising chain, and indicates that supervising intermediate denoising steps is useful not only for adaptive early stopping, but also as an auxiliary objective that improve...
Rohit Kumar Salla, M. Saravanan, Simon Stepputtis· 2 citations
This paper forms few-step generation as a controlled base generative process, and shows that self-consistency loss can be understood through the lens of optimal control, and draws a connection between this approach and reinforcement learning, potentially opening the door to a new set of approaches for few-step generati...
Paribesh Regmi, S. Ghimire, Rui Li· International Conference on...· 0 citations
FluxLite is introduced, a lightweight, training-free proposal-control framework for discrete diffusion, identifying a tilted-path coverage factor that governs robustness to score error, together with finite-particle convergence for a fixed controlled Feynman-Kac recursion.
Yinuo Ren, Haoxuan Chen, Grant M. Rotskoff et al.· 1 citation
Optizing Your Sampling (OYS), which instead treats timestep selection as a black-box optimization problem, optimizing the target metric directly with Bayesian optimization, improves both simple and sophisticated samplers such as Euler and DPM-Solver++.
Travis Zhang, Christian K. Belardi, Justin Lovelace et al.· 0 citations
Known for his clear and elegant writing style, Bertsekas shaped fields from control and optimization to large-scale computation and artificial intelligence.