Geometry-Aware Time Reparameterization for Flow-Map Distillation
cs.LG, cs.AI
Submitted: 2026-10-01
Updated: 2026-10-01
License: http://creativecommons.org/licenses/by/4.0/
The gist: Flow-map distillation enables one- and few-step generation by learning finite-time transitions of a pretrained generative ODE.
Terminology
Abstract
Flow-map distillation enables one- and few-step generation by learning finite-time transitions of a pretrained generative ODE. We investigate whether changing the teacher's time parameterization can make these transitions easier to learn. Motivated by the hypothesis that trajectory segments with large normal acceleration are harder to distill, we propose a geometry-aware time reparameterization that allocates more student time to these regions while preserving the teacher's geometric paths and terminal distribution. We derive a shared clock that equalizes a population normal-acceleration statistic under suitable assumptions, and construct a practical approximation from robust, regularized estimates across teacher trajectories. We incorporate this clock into Lagrangian flow-map distillation, using the transformed time coordinate to condition the student. The clock is estimated once before distillation and requires neither teacher retraining nor additional student parameters or inference-time network evaluations. Experiments on synthetic data, CIFAR-10, and CelebA-64 show improved sample quality over identity-time distillation at matched inference budgets, including improvements in one- and two-step image generation. The gains in one-step generation, where no intermediate sampling times can be adjusted, highlight the benefits of time reparameterization during distillation.
Sources
- Demystifying MMD GANs
- How to build a consistency model: Learning flow maps via self-distillation
- Velocity Scheduled Flow Matching
- On the Trajectory Regularity of ODE-based Diffusion Sampling
- Lipschitz-Guided Design of Interpolation Schedules in Generative Models
- Sharpen Your Flow: Sharpness-Aware Sampling for Flow Matching
- GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium
- Complexity-Balanced Diffusion Splitting
- Isokinetic Flow Matching for Pathwise Straightening of Generative Flows
- Decoupled Weight Decay Regularization
- Align Your Steps: Optimizing Sampling Schedules in Diffusion Models
- Align Your Flow: Scaling Continuous-Time Flow Map Distillation
- Parallel Decoding Distillation for Fast Image and Video Generation
- Entropic Time Schedulers for Generative Diffusion Models
- Simulation-free Schr\"odinger bridges via score and flow matching
- Mean Flow Distillation: Robust and Stable Distillation for Flow Matching Models
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks