Pith. sign in

REVIEW 11 cited by

D-Flow: Differentiating through Flows for Controlled Generation

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.14017 v2 pith:JWS55NP6 submitted 2024-02-21 cs.LG

D-Flow: Differentiating through Flows for Controlled Generation

classification cs.LG
keywords generationcontrolleddifferentiatingframeworkproblemsprocessconditionald-flow
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Taming the generation outcome of state of the art Diffusion and Flow-Matching (FM) models without having to re-train a task-specific model unlocks a powerful tool for solving inverse problems, conditional generation, and controlled generation in general. In this work we introduce D-Flow, a simple framework for controlling the generation process by differentiating through the flow, optimizing for the source (noise) point. We motivate this framework by our key observation stating that for Diffusion/FM models trained with Gaussian probability paths, differentiating through the generation process projects gradient on the data manifold, implicitly injecting the prior into the optimization process. We validate our framework on linear and non-linear controlled generation problems including: image and audio inverse problems and conditional molecule generation reaching state of the art performance across all.

discussion (0)

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

Forward citations

Cited by 11 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. Diffeomorphic Optimization

    cs.LG 2026-07 unverdicted novelty 7.0

    Proposes diffeomorphic optimization for manifold-constrained problems in generative models via flow maps, with Lie-group extensions for protein design showing metric improvements.

  3. FlowADMM: Plug-and-play ADMM with Flow-based Renoise-Denoise Priors

    cs.CV 2026-05 unverdicted novelty 7.0

    FlowADMM replaces stochastic renoise-denoise steps in flow-based plug-and-play methods with a deterministic expectation operator inside ADMM, yielding convergence guarantees under weak Lipschitz conditions and state-o...

  4. LENS: Low-Frequency Eigen Noise Shaping for Efficient Diffusion Sampling

    cs.CV 2026-05 unverdicted novelty 7.0

    LENS shapes low-frequency eigen noise with a lightweight network to enable efficient, high-quality sampling in distilled diffusion models.

  5. 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.

  6. PG-MAP: Joint MAP Optimization for Inference-Time Alignment of Diffusion and Flow-Matching Models

    cs.LG 2026-06 unverdicted novelty 6.0

    PG-MAP formulates inference-time alignment as joint MAP optimization over conditioning c and latent z_t via forward-consistency coupling for diffusion and flow-matching models, reporting gains in PickScore and HPS metrics.

  7. Diffusion Domain Expansion: Learning to Coordinate Pre-trained Diffusion Models

    cs.LG 2026-05 unverdicted novelty 6.0

    DDE introduces a compact coordinator network that combines denoised outputs from pre-trained diffusion models to enable generation in larger domains and complex conditioning settings.

  8. GenMed: A Pairwise Generative Reformulation of Medical Diagnostic Tasks

    cs.CV 2026-05 unverdicted novelty 6.0

    GenMed uses diffusion models to capture P(X,Y) for medical tasks and performs inference via gradient-based test-time optimization, supporting arbitrary observation combinations without retraining.

  9. 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.

  10. Saving Foundation Flow-Matching Priors for Inverse Problems

    cs.LG 2025-11 unverdicted novelty 6.0

    FMPlug adapts foundation flow-matching models into practical priors for inverse problems by combining instance-guided warm-start with sharp Gaussianity regularization, showing superior results on image restoration and...

  11. Inference-Time Scaling for Diffusion Models beyond Scaling Denoising Steps

    cs.CV 2025-01 conditional novelty 6.0

    Diffusion models improve generation quality via inference-time search over noise candidates guided by verifiers and algorithms, yielding gains beyond denoising step scaling on class- and text-conditioned benchmarks.