Efficient Adjoint Matching for Fine-tuning Diffusion Models
Jeongwoo Shin, Dongsoo Shin, Yuchen Zhu, Wei Guo, Yongxin Chen, Joonseok Lee, Jaewoong Choi, Jaemoo Choi

TL;DR
This paper introduces Efficient Adjoint Matching (EAM), a novel method that significantly accelerates reward fine-tuning of diffusion models by reformulating the optimal control problem, achieving up to 4x faster convergence while maintaining or improving performance.
Contribution
EAM reformulates the SOC problem with a linear base drift and modified terminal cost, removing inefficiencies and enabling faster, deterministic training without backward adjoint simulation.
Findings
EAM converges up to 4x faster than Adjoint Matching.
EAM matches or surpasses AM in various reward metrics.
EAM maintains high-quality text-to-image generation performance.
Abstract
Reward fine-tuning has become a common approach for aligning pretrained diffusion and flow models with human preferences in text-to-image generation. Among reward-gradient-based methods, Adjoint Matching (AM) provides a principled formulation by casting reward fine-tuning as a stochastic optimal control (SOC) problem. However, AM inevitably requires a substantial computational cost: it requires (i) stochastic simulation of full generative trajectories under memoryless dynamics, resulting in a large number of function evaluations, and (ii) backward ODE simulation of the adjoint state along each sampled trajectory. In this work, we observe that both bottlenecks are closely tied to the \textit{non-trivial base drift} inherited from the pretrained model. Motivated by this observation, we propose \textbf{Efficient Adjoint Matching (EAM)}, which substantially improves training efficiency by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
