Pith. sign in

REVIEW 35 cited by

Fine-Tuning of Continuous-Time Diffusion Models as Entropy-Regularized Control

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.15194 v2 pith:JPSETJC4 submitted 2024-02-23 cs.LG cs.AIstat.ML

Fine-Tuning of Continuous-Time Diffusion Models as Entropy-Regularized Control

classification cs.LG cs.AIstat.ML
keywords rewarddiffusionmodelsfunctionqualityaestheticcollapsecontrol
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Diffusion models excel at capturing complex data distributions, such as those of natural images and proteins. While diffusion models are trained to represent the distribution in the training dataset, we often are more concerned with other properties, such as the aesthetic quality of the generated images or the functional properties of generated proteins. Diffusion models can be finetuned in a goal-directed way by maximizing the value of some reward function (e.g., the aesthetic quality of an image). However, these approaches may lead to reduced sample diversity, significant deviations from the training data distribution, and even poor sample quality due to the exploitation of an imperfect reward function. The last issue often occurs when the reward function is a learned model meant to approximate a ground-truth "genuine" reward, as is the case in many practical applications. These challenges, collectively termed "reward collapse," pose a substantial obstacle. To address this reward collapse, we frame the finetuning problem as entropy-regularized control against the pretrained diffusion model, i.e., directly optimizing entropy-enhanced rewards with neural SDEs. We present theoretical and empirical evidence that demonstrates our framework is capable of efficiently generating diverse samples with high genuine rewards, mitigating the overoptimization of imperfect reward models.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 35 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. How to Guide Your Flow: Few-Step Alignment via Flow Map Reward Guidance

    cs.LG 2026-04 unverdicted novelty 8.0

    FMRG reformulates guidance as deterministic optimal control, deriving a single-trajectory method using the flow map that matches or exceeds baselines on reward-guided generation and inverse problems with 3 NFEs at tex...

  2. Reinforcement Learning for Diffusion LLMs with Entropy-Guided Step Selection and Stepwise Advantages

    cs.LG 2026-03 unverdicted novelty 8.0

    Derives an exact unbiased policy gradient for RL post-training of diffusion LLMs via entropy-guided step selection and one-step denoising rewards, achieving state-of-the-art results on coding and logical reasoning benchmarks.

  3. Supervised Guidance Training for Infinite-Dimensional Diffusion Models

    cs.LG 2026-01 conditional novelty 8.0

    Supervised Guidance Training enables conditioning of infinite-dimensional diffusion models via an extended Doob h-transform so that fine-tuned models accurately sample from posteriors in function space.

  4. VINE: Taming Generative Control Policies for Reinforcement Learning

    cs.RO 2026-07 conditional novelty 7.0

    Reconstructing a fresh noisy interpolation state at every denoising step stabilizes end-to-end value-gradient training of multi-step flow-matching policies and yields state-of-the-art offline and real-robot results.

  5. TILDE: TILt-based Distributional Erasure for Concept Unlearning

    cs.LG 2026-07 conditional novelty 7.0

    TILDE derives a minimum-deviation, energy-tilted target distribution for concept unlearning in diffusion models and realizes it via residual ∇-GFlowNet training.

  6. A Markov Chain Approach to Preference Alignment

    cs.LG 2026-06 unverdicted novelty 7.0

    MCHF defines a Markov kernel from pairwise utilities U and proves geometric convergence to its stationary distribution at a rate set by the seminorm measuring non-transitivity of U, with first-order equivalence to RLH...

  7. Q-VGM: Q-Guided Value-Gradient Matching for Flow-Matching VLA Policies

    cs.RO 2026-06 unverdicted novelty 7.0

    Q-VGM introduces value-gradient matching via VGG-Flow to improve flow-matching VLA policies with a Cal-QL critic, achieving success rate lifts on LIBERO, RoboTwin, and real-robot tasks.

  8. Aligning Few-Step Generative Models by Amortizing Sample-based Variational Inference

    cs.LG 2026-05 unverdicted novelty 7.0

    FAV aligns few-step generative models by amortizing SVGD updates from reward-tilted sampling into generator parameters via fixed-point regression, requiring only sample access, and shows outperformance on robotics tas...

  9. Reinforce Adjoint Matching: Scaling RL Post-Training of Diffusion and Flow-Matching Models

    cs.LG 2026-05 unverdicted novelty 7.0

    Reinforce Adjoint Matching derives a simple consistency loss for RL post-training of diffusion models by tilting the clean distribution toward higher-reward samples under KL regularization while keeping the noising pr...

  10. Improved techniques for fine-tuning flow models via adjoint matching: a deterministic control pipeline

    cs.AI 2026-05 unverdicted novelty 7.0

    A new adjoint matching framework formulates flow model alignment as optimal control, enabling direct regression training and terminal-trajectory truncation for efficiency gains on models like SiT-XL and FLUX.

  11. How to Guide Your Flow: Few-Step Alignment via Flow Map Reward Guidance

    cs.LG 2026-04 unverdicted novelty 7.0

    FMRG is a training-free, single-trajectory guidance method for flow models derived from optimal control that achieves strong reward alignment with only 3 NFEs.

  12. Reward Score Matching: Unifying Reward-based Fine-tuning for Flow and Diffusion Models

    cs.LG 2026-04 conditional novelty 7.0

    Many reward-based fine-tuning methods for diffusion and flow models are special cases of a common score-matching objective whose differences reduce to value-guidance estimator design, temporal weighting, and trust-reg...

  13. Personalizing Text-to-Image Generation to Individual Taste

    cs.CV 2026-04 unverdicted novelty 7.0

    PAMELA provides a multi-user rating dataset and personalized reward model that predicts individual image preferences more accurately than prior population-level aesthetic models.

  14. Inference-Time Scaling of Diffusion Language Models via Trajectory Refinement

    cs.LG 2025-07 conditional novelty 7.0

    PG-DLM applies particle Gibbs sampling over full trajectories in diffusion language models to enable iterative refinement, yielding higher accuracy on reward-guided generation with theoretical convergence guarantees.

  15. Posterior Inference in Latent Space for Scalable Constrained Black-box Optimization

    cs.LG 2025-07 unverdicted novelty 7.0

    Reformulates constrained black-box optimization as posterior inference in latent space of flow-based models amortized by outsourced diffusion models, claiming superior performance on synthetic and real tasks.

  16. Are we really tilting? The mechanics of reward guidance in flow and diffusion models

    cs.LG 2026-06 unverdicted novelty 6.0

    Finite-particle approximation of the Doob h-function causes reward hacking via two failure modes in reward-guided diffusion; a damping schedule corrects within-mode bias in Gaussian settings.

  17. StressDream: Steering Video World Models for Robust Policy Evaluation and Improvement

    cs.CV 2026-05 unverdicted novelty 6.0

    StressDream optimizes initial noise in diffusion video world models using VLM semantic and plausibility objectives to steer generations toward specified high-impact outcomes for improved policy evaluation.

  18. Parallel Tempering Initial Sampling in Inference-Time Reward Alignment

    cs.LG 2026-05 unverdicted novelty 6.0

    PATHS applies parallel tempering to improve initial particle sampling for SMC reward alignment, yielding better results on layout-to-image and quantity-aware generation tasks.

  19. Hierarchical Variational Policies for Reward-Guided Diffusion

    cs.LG 2026-05 conditional novelty 6.0

    A hierarchical variational formulation amortizes test-time guidance in diffusion models to achieve strong quality-speed tradeoffs with significantly reduced inference compute.

  20. Gradient-Free Noise Optimization for Reward Alignment in Generative Models

    cs.LG 2026-05 unverdicted novelty 6.0

    ZeNO formulates noise optimization for reward alignment as a path-integral control problem solvable via zeroth-order reward evaluations alone, connecting to Langevin dynamics under an Ornstein-Uhlenbeck process.

  21. Gradient-Free Noise Optimization for Reward Alignment in Generative Models

    cs.LG 2026-05 unverdicted novelty 6.0

    ZeNO frames noise optimization as a path-integral control problem solvable from zeroth-order reward evaluations, connecting to implicit Langevin dynamics for reward-tilted distributions.

  22. Reinforce Adjoint Matching: Scaling RL Post-Training of Diffusion and Flow-Matching Models

    cs.LG 2026-05 unverdicted novelty 6.0

    Derives RAM, a reward-adjusted consistency loss extending diffusion pretraining regression to efficient KL-regularized RL post-training, achieving peak rewards up to 50x faster than Flow-GRPO on Stable Diffusion 3.5M.

  23. A unified perspective on fine-tuning and sampling with diffusion and flow models

    stat.ML 2026-04 unverdicted novelty 6.0

    A unified framework for exponential tilting in diffusion and flow models that includes bias-variance decompositions showing finite gradient variance for some methods, norm bounds on adjoint ODEs, and adapted losses wi...

  24. How to Guide Your Flow: Few-Step Alignment via Flow Map Reward Guidance

    cs.LG 2026-04 unverdicted novelty 6.0

    FMRG is a training-free single-trajectory guidance framework for flow-based models that matches or exceeds baselines on reward-guided tasks and inverse problems using as few as 3 NFEs.

  25. Robust mean field control: stochastic maximum principle and variational mean field games

    math.OC 2026-04 unverdicted novelty 6.0

    A new min-max robust formulation for mean field control and variational mean field games is introduced, with existence, uniqueness, and a stochastic maximum principle established under convexity-concavity assumptions.

  26. Reward Score Matching: Unifying Reward-based Fine-tuning for Flow and Diffusion Models

    cs.LG 2026-04 unverdicted novelty 6.0

    Reward Score Matching unifies reward-based fine-tuning for flow and diffusion models by recasting alignment as score matching to a value-guided target.

  27. Adjoint Matching through the Lens of the Stochastic Maximum Principle in Optimal Control

    math.OC 2026-03 unverdicted novelty 6.0

    Adjoint matching objectives derived from the Stochastic Maximum Principle have critical points satisfying HJB stationarity conditions for SOC problems with control-dependent drift and diffusion.

  28. Adjoint Matching through the Lens of the Stochastic Maximum Principle in Optimal Control

    math.OC 2026-03 conditional novelty 6.0

    Adjoint Matching is derived from the Stochastic Maximum Principle as a Hamiltonian objective whose critical points solve stochastic optimal control problems for generative dynamics.

  29. ETS: Energy-Guided Test-Time Scaling for Training-Free RL Alignment

    cs.LG 2026-01 conditional novelty 6.0

    ETS enables direct sampling from the optimal RL policy for language models at inference time by estimating the energy term with online Monte Carlo and acceleration techniques.

  30. ETS: Energy-Guided Test-Time Scaling for Training-Free RL Alignment

    cs.LG 2026-01 unverdicted novelty 6.0

    ETS performs training-free RL alignment for language models by energy-guided test-time scaling with Monte Carlo energy estimation and importance sampling acceleration.

  31. Stein Diffusion Guidance: Training-Free Posterior Correction for Sampling Beyond High-Density Regions

    cs.LG 2025-07 unverdicted novelty 6.0

    Stein Diffusion Guidance corrects approximate posteriors in diffusion sampling via a Stein variational mechanism and surrogate SOC objective to enable effective guidance beyond high-density regimes.

  32. DexVLA: Vision-Language Model with Plug-In Diffusion Expert for General Robot Control

    cs.RO 2025-02 unverdicted novelty 6.0

    DexVLA combines a scaled diffusion action expert with embodiment curriculum learning to achieve better generalization and performance than prior VLA models on diverse robot hardware and long-horizon tasks.

  33. On the Design Space of Discrete Diffusion Online Adaptation for Molecular Optimization

    cs.LG 2026-07 conditional novelty 5.5

    Online fine-tuning of discrete diffusion models with complementary acquisition, CVaR shaping, density-entropy debiasing, replay, and validity control finds better molecules under fixed oracle budgets than offline fine...

  34. Time-Reversed BSDEs for Accurate Gradient Estimation in Diffusion Models

    math.OC 2026-03 conditional novelty 5.5

    Time-reversed BSDEs produce adapted adjoints that yield more stable, lower-variance gradients for SOC fine-tuning of diffusion models than non-adapted adjoint matching.

  35. PAPA: Online Personalized Active Preference Alignment

    cs.LG 2026-07 unverdicted novelty 5.0

    PAPA directly optimizes diffusion models via real-time user feedback for personalized preference alignment, drawing from variational inference, with an efficiency-enhanced variant EPAPA.