Recovering Diversity in
Distilled Diffusion Modelsvia Low-Rank Policy-Optimized Merging
Teacher–student model merging for few-step diffusion
Recovering diversity after distillation
Timestep distillation makes diffusion models fast. But adversarial objectives can concentrate their outputs, trading away diversity. We recover much of that lost diversity by merging a distilled student with its full-step teacher.
Our framework decomposes their weight difference into low-rank directions, then learns how much of each direction to merge through Group Relative Policy Optimization (GRPO). Quality and diversity guide the merge, using just one calibration prompt.
Same inference cost
as the distilled student
SDXL DINO diversity
relative to SDXL-turbo
“a photo of a cat”
for optimization
Diversity: 0.1064 → 0.1962 on GenEval (DINOv3); +84.4%, rounded. Results from Table 2.
Sample diversity
SDXL teacher, distilled student, and merged model.
Select a prompt and compare nine samples.
“A photo of a winter coat”



SDXL samples from the supplied main and supplementary figure assets. All displayed samples are 512 × 512 pixels. The viewer displays pre-generated images.
Compare all merging baselines +
Full nine-sample grids for each method.
Low-rank policy-optimized merging
Optimize the merge in weight space,
rather than backpropagating through generation.
Instead of one global interpolation coefficient, assign a separate coefficient to each singular-vector pair. This makes merging more expressive while keeping its representation compact.
Quantitative comparison
Evaluation on SDXL and SD3.5-L.
Select a model family to view Table 2.
higher DINO diversity at the same 4-step inference cost.
| Method | NFE | DINO ↑ | CLIP ↑ | DeQA ↑ | MIQA ↑ | FID ↓ | ImgR ↑ | PicS ↑ |
|---|
Diversity: 553 GenEval prompts, five images each. Quality and preference: COCO-10K. ↑ higher is better; ↓ lower is better. Values reproduced from Table 2. Gains vary by metric; our merge does not lead every column.
Image quality comparison
Same seeds across methods.
Actual qualitative comparisons from Figure 4.
“a baseball player bunting at a baseball on a field.”
The paper reports improved crispness and reduced artifacts relative to competing merges. Images are extracted directly from the original figure assets corresponding to Figure 4.
Abstract
Diffusion models enable high-fidelity, diverse image synthesis but incur high deployment cost, motivating timestep distillation. To mitigate blurriness, distillation methods widely adopt adversarial objectives, which frequently reduce sample diversity. Existing merging methods can raise diversity, but only at the cost of quality. To recover diversity without this quality penalty, we propose a low-rank policy-optimized model merging framework that combines the teacher’s diversity with the student’s efficiency.
Specifically, we decompose the teacher–student weight difference matrices via low-rank decomposition and optimize the coefficients of the resulting singular vectors, allowing finer-grained and memory-efficient merging. However, the student’s iterative few-step inference makes direct backpropagation through sampling intractable. We address this by modeling the interpolation coefficient logits as a Gaussian distribution policy and optimizing them via Group Relative Policy Optimization (GRPO), using image quality and diversity as reward signals.
Notably, this formulation remains highly data-efficient, requiring only a single text prompt for optimization. In contrast to prior merging methods, our method recovers much of the diversity lost to distillation while maintaining or improving quality and preference, achieving the best quality-diversity balance among merging approaches at the same inference cost. We demonstrate this on both SDXL and SD3.5-L, which differ in architecture and training objective.
BibTeX
@inproceedings{seo2027recovering,
title={Recovering Diversity in Distilled Diffusion Models
via Low-Rank Policy-Optimized Merging},
author={Seo, Hoigi and Han, Woojae and Lee, Joohoon
and Chun, Se Young},
booktitle={Proceedings of the IEEE/CVF Winter Conference
on Applications of Computer Vision (WACV)},
year={2027}
}Accepted at WACV 2027. Proceedings details will be updated when available.