Table of Contents
Fetching ...

DeRaDiff: Denoising Time Realignment of Diffusion Models

Ratnavibusena Don Shahain Manujith, Yang Zhang, Teoh Tze Tzun, Kenji Kawaguchi

TL;DR

DeRaDiff introduces a decoding-time, denoising-time realignment for diffusion models that interpolates between a reference and an aligned model without retraining. By deriving a closed-form, per-step Gaussian update parameterized by λ, it enables on-the-fly control of the effective regularization strength β during sampling. Empirical results across PickScore, HPS v2, and CLIP show DeRaDiff closely approximates models aligned from scratch while delivering substantial compute savings, effectively turning hyperparameter sweeps into inexpensive inference-time exploration. The method extends decoding-time realignment from language to diffusion models and demonstrates robustness to multi-reward settings, with detailed reproducibility and ethical considerations included. Overall, DeRaDiff offers a practical, training-free approach to optimize alignment strength, reducing cost and accelerating RLHF-style experimentation in diffusion-based generation systems.

Abstract

Recent advances align diffusion models with human preferences to increase aesthetic appeal and mitigate artifacts and biases. Such methods aim to maximize a conditional output distribution aligned with higher rewards whilst not drifting far from a pretrained prior. This is commonly enforced by KL (Kullback Leibler) regularization. As such, a central issue still remains: how does one choose the right regularization strength? Too high of a strength leads to limited alignment and too low of a strength leads to "reward hacking". This renders the task of choosing the correct regularization strength highly non-trivial. Existing approaches sweep over this hyperparameter by aligning a pretrained model at multiple regularization strengths and then choose the best strength. Unfortunately, this is prohibitively expensive. We introduce DeRaDiff, a denoising time realignment procedure that, after aligning a pretrained model once, modulates the regularization strength during sampling to emulate models trained at other regularization strengths without any additional training or finetuning. Extending decoding-time realignment from language to diffusion models, DeRaDiff operates over iterative predictions of continuous latents by replacing the reverse step reference distribution by a geometric mixture of an aligned and reference posterior, thus giving rise to a closed form update under common schedulers and a single tunable parameter, lambda, for on the fly control. Our experiments show that across multiple text image alignment and image-quality metrics, our method consistently provides a strong approximation for models aligned entirely from scratch at different regularization strengths. Thus, our method yields an efficient way to search for the optimal strength, eliminating the need for expensive alignment sweeps and thereby substantially reducing computational costs.

DeRaDiff: Denoising Time Realignment of Diffusion Models

TL;DR

DeRaDiff introduces a decoding-time, denoising-time realignment for diffusion models that interpolates between a reference and an aligned model without retraining. By deriving a closed-form, per-step Gaussian update parameterized by λ, it enables on-the-fly control of the effective regularization strength β during sampling. Empirical results across PickScore, HPS v2, and CLIP show DeRaDiff closely approximates models aligned from scratch while delivering substantial compute savings, effectively turning hyperparameter sweeps into inexpensive inference-time exploration. The method extends decoding-time realignment from language to diffusion models and demonstrates robustness to multi-reward settings, with detailed reproducibility and ethical considerations included. Overall, DeRaDiff offers a practical, training-free approach to optimize alignment strength, reducing cost and accelerating RLHF-style experimentation in diffusion-based generation systems.

Abstract

Recent advances align diffusion models with human preferences to increase aesthetic appeal and mitigate artifacts and biases. Such methods aim to maximize a conditional output distribution aligned with higher rewards whilst not drifting far from a pretrained prior. This is commonly enforced by KL (Kullback Leibler) regularization. As such, a central issue still remains: how does one choose the right regularization strength? Too high of a strength leads to limited alignment and too low of a strength leads to "reward hacking". This renders the task of choosing the correct regularization strength highly non-trivial. Existing approaches sweep over this hyperparameter by aligning a pretrained model at multiple regularization strengths and then choose the best strength. Unfortunately, this is prohibitively expensive. We introduce DeRaDiff, a denoising time realignment procedure that, after aligning a pretrained model once, modulates the regularization strength during sampling to emulate models trained at other regularization strengths without any additional training or finetuning. Extending decoding-time realignment from language to diffusion models, DeRaDiff operates over iterative predictions of continuous latents by replacing the reverse step reference distribution by a geometric mixture of an aligned and reference posterior, thus giving rise to a closed form update under common schedulers and a single tunable parameter, lambda, for on the fly control. Our experiments show that across multiple text image alignment and image-quality metrics, our method consistently provides a strong approximation for models aligned entirely from scratch at different regularization strengths. Thus, our method yields an efficient way to search for the optimal strength, eliminating the need for expensive alignment sweeps and thereby substantially reducing computational costs.
Paper Structure (44 sections, 2 theorems, 47 equations, 31 figures, 17 tables, 2 algorithms)

This paper contains 44 sections, 2 theorems, 47 equations, 31 figures, 17 tables, 2 algorithms.

Key Result

Theorem 1

Denoting $\mu_1 = \mu_{\theta}(x_t, t, c)$, $\mu_2 = \mu^*_{\theta}[\beta](x_t, t, c)$$x_t, x_{t-1},\mu_t,\mu_{t-1} \in \mathbb{R}^\text{D}$ and $\sigma^2_1 = \sigma^2_{t|t-1} \frac{\sigma^2_{t-1}}{\sigma^2_t} \text{I} = \sigma^2_2$Note that $\sigma_1^2$ need not be equal to $\sigma_2^2$--our deriva Then, for any interpolation weight $\lambda\in[0,1]$ the stepwise realigned posterior is Gaussian

Figures (31)

  • Figure 1: DeRaDiff re-approximates a model aligned from scratch. Top row consists of images generated by an SDXL model aligned from scratch at $\beta=5000$ KL regularization strength. Bottom row consists of images obtained via DeRaDiff sampling via an anchoring SDXL model aligned at a KL regularization strength of $\beta=2000$ with no further retraining.
  • Figure 2: $\lambda$ = 0
  • Figure 3: $\lambda$ = 0.75
  • Figure 4: $\lambda$ = 1
  • Figure 5: $\lambda$ = 2.5
  • ...and 26 more figures

Theorems & Definitions (2)

  • Theorem 1: Closed-form per-step denoising realignment
  • Corollary 1: Positivity and scalar simplification