paper-with-me

홈 › Papers

Continuous-Time Distribution Matching for Few-Step Diffusion Distillation

2026-05-07 · Tao Liu, Hao Yan, Mengting Chen, Taihang Hu, Zhengrong Yue, Zihao Pan, Jinsong Lan, Xiaoyong Zhu, Ming-Ming Cheng, Bo Zheng, Yaxing Wang arxiv

Step distillation has become a leading technique for accelerating diffusion models, among which Distribution Matching Distillation (DMD) and Consistency Distillation are two representative paradigms. While consistency methods enforce self-consistency along the full PF-ODE trajectory to steer it toward the clean data manifold, vanilla DMD relies on sparse supervision at a few predefined discrete timesteps. This restricted discrete-time formulation and mode-seeking nature of the reverse KL divergence tends to exhibit visual artifacts and over-smoothed outputs, often necessitating complex auxiliary modules -- such as GANs or reward models -- to restore visual fidelity. In this work, we introduce Continuous-Time Distribution Matching (CDM), migrating the DMD framework from discrete anchoring to continuous optimization for the first time. CDM achieves this through two continuous-time designs. First, we replace the fixed discrete schedule with a dynamic continuous schedule of random length, so that distribution matching is enforced at arbitrary points along sampling trajectories rather than only at a few fixed anchors. Second, we propose a continuous-time alignment objective that performs active off-trajectory matching on latents extrapolated via the student's velocity field, improving generalization and preserving fine visual details. Extensive experiments on different architectures, including SD3-Medium and Longcat-Image, demonstrate that CDM provides highly competitive visual fidelity for few-step image generation without relying on complex auxiliary objectives. Code is available at https://github.com/byliutao/cdm.

📄 PDF Abstract BibTeX arXiv:2605.06376

Code (0)

등록된 구현이 없습니다.

Tasks

Image Generation

Similar Papers 제목 키워드 기반

Flow Matching Policy Gradients

2025-07-28 · David McAllister, Songwei Ge, Brent Yi, Chung Min Kim 외 arxiv

Flow-based generative models, including diffusion models, excel at modeling continuous distributions in high-dimensional spaces. In this work, we introduce Flow Policy Optimization (FPO), a simple on-policy reinforcement…

Reinforcement LearningContinuous Control

Efficient Perplexity Bound and Ratio Matching in Discrete Diffusion Language Models

2025-07-06 · Etrit Haxholli, Yeti Z. Gurbuz, Ogul Can, Eli Waxman arxiv

While continuous diffusion models excel in modeling continuous distributions, their application to categorical data has been less effective. Recent work has shown that ratio-matching through score-entropy within a contin…

Distilled Continuous Diffusion Language Models Can Write Code in Few Steps---or One

2026-09-03 · Fred Zhangzhi Peng, Kaiwen Zheng, Anru R. Zhang arxiv

Language generation is almost universally treated as a sequential process: autoregressive models emit one token at a time, while diffusion language models replace token-level seriality with a long trajectory of iterative…

Code Generation

Terminal Velocity Matching

2025-11-24 · Linqi Zhou, Mathias Parger, Ayaan Haque, Jiaming Song arxiv

We propose Terminal Velocity Matching (TVM), a generalization of flow matching that enables high-fidelity one- and few-step generative modeling. TVM models the transition between any two diffusion timesteps and regulariz…

Scalable, Explainable and Provably Robust Anomaly Detection with One-Step Flow Matching

2025-10-21 · Zhong Li, Qi Huang, Yuxuan Zhu, Lincen Yang 외 arxiv

We introduce Time-Conditioned Contraction Matching (TCCM), a novel method for semi-supervised anomaly detection in tabular data. TCCM is inspired by flow matching, a recent generative modeling framework that learns veloc…

Semi-supervised Anomaly Detection