Pith. sign in

REVIEW 48 cited by

A General Framework for Inference-time Scaling and Steering of Diffusion Models

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 2501.06848 v5 pith:FIT3V26Q submitted 2025-01-12 cs.LG cs.CLcs.CV

A General Framework for Inference-time Scaling and Steering of Diffusion Models

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

Diffusion models produce impressive results in modalities ranging from images and video to protein design and text. However, generating samples with user-specified properties remains a challenge. Recent research proposes fine-tuning models to maximize rewards that capture desired properties, but these methods require expensive training and are prone to mode collapse. In this work, we present Feynman-Kac (FK) steering, an inference-time framework for steering diffusion models with reward functions. FK steering works by sampling a system of multiple interacting diffusion processes, called particles, and resampling particles at intermediate steps based on scores computed using functions called potentials. Potentials are defined using rewards for intermediate states and are selected such that a high value indicates that the particle will yield a high-reward sample. We explore various choices of potentials, intermediate rewards, and samplers. We evaluate FK steering on text-to-image and text diffusion models. For steering text-to-image models with a human preference reward, we find that FK steering a 0.8B parameter model outperforms a 2.6B parameter fine-tuned model on prompt fidelity, with faster sampling and no training. For steering text diffusion models with rewards for text quality and specific text attributes, we find that FK steering generates lower perplexity, more linguistically acceptable outputs and enables gradient-free control of attributes like toxicity. Our results demonstrate that inference-time scaling and steering of diffusion models - even with off-the-shelf rewards - can provide significant sample quality gains and controllability benefits. Code is available at https://github.com/zacharyhorvitz/Fk-Diffusion-Steering .

discussion (0)

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

Forward citations

Cited by 48 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. A Priori Sampling of Transition States with Guided Diffusion

    physics.chem-ph 2026-03 conditional novelty 8.0

    ASTRA reframes transition-state search as guided diffusion inference that samples the isodensity surface between metastable basins and converges to first-order saddles via score differences and physical forces.

  3. AquaGen: Scaling generative models to molecular dynamics precision on thousands of atoms

    physics.chem-ph 2026-07 conditional novelty 7.5

    AquaGen is an all-atom explicit-solvent flow-matching model that yields AHFE estimates ~1 kcal/mol of MD at 4–10× lower GPU cost, with refinable samples and calibrated bootstrap uncertainties.

  4. Bootstrap Flow-Map Tree Sampling Enables Online Feedback Driven Search

    cs.LG 2026-07 conditional novelty 7.0

    Bootstrap Flow-Map Trees construct complete DDPM-like trajectories with a single NFE and dynamic steps, enabling efficient online feedback-driven search and alignment that beats prior tree and SMC samplers.

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

  6. Atomistic Language Models Understand and Generate Materials

    cs.LG 2026-06 unverdicted novelty 7.0

    ALMs unify pretrained atomistic encoder, LLM, and denoising diffusion via continuous projectors and staged training to reach SOTA on text-conditioned crystal prediction and de novo generation.

  7. Improving Robotic Generalist Policies via Flow Reversal Steering

    cs.RO 2026-06 unverdicted novelty 7.0

    Flow Reversal Steering steers flow matching generalist policies by reversing suboptimal actions to nearby better modes, enabling improved zero-shot control, quick distillation, and RL bootstrapping in robotic manipulation.

  8. The Power of Test-Time Training for Approximate Sampling

    cs.DS 2026-06 unverdicted novelty 7.0

    Establishes a quadratic lower bound on query complexity for sampling from large classes of distributions given approximate density oracles, answers an open question on optimality of random walks, and shows circumventi...

  9. Inference-Time Alignment of Diffusion Models via Trust-Region Iterative Twisted Sequential Monte Carlo

    cs.LG 2026-05 conditional novelty 7.0

    TRI-TSMC is a trust-region framework for learning twisting functions in SMC-based inference-time alignment of diffusion models that yields zero-variance samplers in theory and better alignment on text and image tasks ...

  10. Contrastive Distribution Matching for Amortized Sequential Monte Carlo in Discrete Diffusion

    cs.LG 2026-05 unverdicted novelty 7.0

    CDM amortizes SMC inference for reward-tilted discrete diffusion by training a parameterized twist function on contrastive samples with closed-form kernels.

  11. Inference-Time Scaling in Diffusion Models through Iterative Partial Refinement

    cs.LG 2026-05 unverdicted novelty 7.0

    IPR improves valid solution rates on MNIST Sudoku from 55.8% to 75.0% by iteratively refining partial regions in sequential diffusion models without external verifiers or reward models.

  12. SURGE: Approximation and Training Free Particle Filter for Diffusion Surrogate

    stat.ML 2026-05 unverdicted novelty 7.0

    URGE performs unbiased path-wise importance reweighting via Girsanov estimation for derivative-free inference-time scaling in diffusion models, proving equivalence to particle-wise SMC and outperforming baselines empirically.

  13. $h$-control: Training-Free Camera Control via Block-Conditional Gibbs Refinement

    cs.CV 2026-05 unverdicted novelty 7.0

    h-control introduces block-conditional pseudo-Gibbs refinement for training-free camera control in flow-matching video generators, achieving superior FVD scores on RealEstate10K and DAVIS benchmarks.

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

  15. VASR: Variance-Aware Systematic Resampling for Reward-Guided Diffusion

    cs.AI 2026-04 unverdicted novelty 7.0

    FVD applies Fleming-Viot population dynamics to diffusion model sampling at inference time to reduce diversity collapse while improving reward alignment and FID scores.

  16. Reflective Flow Sampling Enhancement

    cs.CV 2026-03 unverdicted novelty 7.0

    RF-Sampling enhances flow matching models by implicitly performing gradient ascent on text-image alignment scores via linear textual combinations and flow inversion.

  17. Iterative Inference-time Scaling with Adaptive Frequency Steering for Image Super-Resolution

    cs.CV 2025-12 unverdicted novelty 7.0

    IAFS is a training-free iterative inference-time scaling framework that uses adaptive frequency-aware particle fusion to resolve the perception-fidelity conflict in diffusion super-resolution models, outperforming pri...

  18. dMLLM-TTS: Self-Verified and Efficient Test-Time Scaling for Diffusion Multi-Modal Large Language Models

    cs.CV 2025-12 conditional novelty 7.0

    dMLLM-TTS delivers up to 6x more efficient test-time scaling for diffusion MLLMs via O(N+T) hierarchical search and self-verified feedback, improving generation quality on GenEval across three models.

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

  20. MODUS: Decoder-Only Any-to-Any Modeling of Diverse Modalities

    cs.CV 2026-07 conditional novelty 6.0

    A decoder-only transformer with two internal experts achieves competitive any-to-any translation across text and 14 vision modalities in one model, using a staged curriculum and uniform timestep sampling.

  21. Concurrent Image Understanding and Generation: Self-Correcting Coupled Markov Jump Processes

    cs.LG 2026-07 conditional novelty 6.0

    CO2Jump couples text and image denoising through cross-modal attention and remasking, achieving best joint accuracy on three concurrent-generation tasks.

  22. Sequentially-Controlled Interactive Multi-Particle Flow-Maps for Online Feedback-Driven Search

    cs.LG 2026-07 unverdicted novelty 6.0

    IMPFM is a multi-particle flow-map sampling method with sequential posterior sharing and interaction-aware correction that targets a KL-tilted distribution for global exploration in online feedback search.

  23. Inference-Time Robot Behavior Steering through Physically-Aware Reconfiguration of Task-Structure

    cs.RO 2026-06 unverdicted novelty 6.0

    ReStruct steers robot policies at inference time by reconfiguring task structure with neural automata and synchronous products, claiming up to 25% gains over VLA models in success and preference adherence.

  24. BayesFP: Posterior Estimation for Flow-Based Policies via Feynman-Kac Sampling

    cs.RO 2026-06 unverdicted novelty 6.0

    BayesFP provides a unified retraining-free sampler for diffusion and flow policies by casting constrained trajectory generation as posterior sampling via an extended Feynman-Kac corrector.

  25. NoiseTilt: Noise-Tilted Reverse Kernels for Diffusion Reward Alignment

    cs.LG 2026-06 unverdicted novelty 6.0

    NTRK uses a whitening operator to tilt the noise term in diffusion reverse kernels for reward guidance, outperforming baselines with 20x fewer steps on aesthetic tasks.

  26. NoiseTilt: Noise-Tilted Reverse Kernels for Diffusion Reward Alignment

    cs.LG 2026-06 unverdicted novelty 6.0

    NTRK is a reward-guided diffusion sampler that uses a whitening operator to bias the noise term toward high-reward outcomes, outperforming baselines with up to 20x fewer sampling steps on aesthetic tasks.

  27. Detect, Remask, Repair: Diffusion Editing for Faithful Summarization of Evolving Contexts

    cs.CL 2026-06 unverdicted novelty 6.0

    Diffusion-based localized editing framework for faithful summarization of evolving contexts, introducing the StreamSum benchmark and showing tradeoffs in faithfulness, speed, and preservation.

  28. Learning to Assist: Collaborative VLAs for Implicit Human-Robot Collaboration

    cs.RO 2026-06 conditional novelty 6.0

    VLA models with inference-time steering mitigate action leakage in implicit human-robot collaboration, supporting longer horizons and yielding faster, more reliable assembly than shorter-horizon baselines in a 16-pers...

  29. Few-step Cofolding with All-Atom Flow Maps

    cs.LG 2026-06 unverdicted novelty 6.0

    DeCAF distills all-atom cofolding diffusion models into few-step flow maps, showing improved or matched accuracy on protein-ligand tasks with 5x fewer inference steps.

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

  31. SURGE: Approximation and Training Free Particle Filter for Diffusion Surrogate

    stat.ML 2026-05 unverdicted novelty 6.0

    SURGE is an unbiased particle filter that fuses diffusion-model simulations with noisy observations via sequential Monte Carlo reweighting over diffusion trajectories.

  32. Simple Approximation and Derivative Free Inference-Time Scaling for Diffusion Models via Sequential Monte Carlo on Path Measures

    stat.ML 2026-05 unverdicted novelty 6.0

    URGE performs unbiased inference-time scaling for diffusion models by attaching multiplicative path weights from Girsanov estimation and resampling trajectories, with a proven equivalence to prior particle-wise SMC schemes.

  33. $h$-control: Training-Free Camera Control via Block-Conditional Gibbs Refinement

    cs.CV 2026-05 unverdicted novelty 6.0

    h-control augments hard-replacement guidance with block-conditional pseudo-Gibbs refinement on unobserved latent sites and adaptive 3D patch freezing to achieve superior FVD on RealEstate10K and DAVIS.

  34. EPIC: Efficient Predicate-Guided Inference-Time Control for Compositional Text-to-Image Generation

    cs.CV 2026-05 unverdicted novelty 6.0

    EPIC introduces predicate-guided inference-time search that lifts compositional T2I prompt accuracy from 34% to 71% on GenEval2 with 31-81% lower execution costs.

  35. Flow-Direct: Feedback-Efficient and Reusable Guidance for Flow Models via Non-Parametric Guidance Field

    cs.LG 2026-05 unverdicted novelty 6.0

    Flow-Direct constructs a reusable non-parametric guidance field from the log-density ratio of base and target distributions using all accumulated reward samples for feedback-efficient guidance in flow models.

  36. Stream-T1: Test-Time Scaling for Streaming Video Generation

    cs.CV 2026-05 unverdicted novelty 6.0

    Stream-T1 is a test-time scaling framework for streaming video generation using scaled noise propagation from history, reward pruning across short and long windows, and feedback-guided memory sinking to improve tempor...

  37. NoiseRater: Meta-Learned Noise Valuation for Diffusion Model Training

    cs.LG 2026-05 unverdicted novelty 6.0

    NoiseRater meta-learns instance-level importance scores for noise in diffusion training via bilevel optimization, then uses a two-stage pipeline to improve efficiency and generation quality on FFHQ and ImageNet.

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

  39. Generative optimal transport via forward-backward HJB matching

    cond-mat.stat-mech 2026-04 unverdicted novelty 6.0

    A forward-backward HJB duality computes the optimal stochastic transport control from easy forward relaxation trajectories alone, expressed as path-space free energy without backward simulation.

  40. VASR: Variance-Aware Systematic Resampling for Reward-Guided Diffusion

    cs.AI 2026-04 unverdicted novelty 6.0

    VASR separates continuation and residual variance in reward-guided diffusion SMC, using optimal mass allocation and systematic resampling to achieve up to 26% better FID scores and faster runtimes than prior SMC and M...

  41. LatSearch: Latent Reward-Guided Search for Faster Inference-Time Scaling in Video Diffusion

    cs.CV 2026-03 accept novelty 6.0

    LatSearch improves video diffusion quality and efficiency by scoring intermediate latents with a trained reward model and performing reward-guided resampling plus final pruning.

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

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

  44. Controllable protein design with particle-based Feynman-Kac steering

    cs.LG 2025-11 unverdicted novelty 6.0

    Feynman-Kac steering of RFdiffusion with ProteinMPNN-based guiding potentials improves predicted interface energetics and raises binder designability by 89.5%.

  45. Control-Augmented Autoregressive Diffusion for Data Assimilation

    cs.LG 2025-10 unverdicted novelty 6.0

    An offline-trained controller augments autoregressive diffusion models to perform fast, feed-forward data assimilation in chaotic spatiotemporal PDEs with order-of-magnitude speedups and improved accuracy over baselines.

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

  47. Not All Prediction Targets Keep Training-Free Diffusion Guidance on the Manifold

    cs.CV 2026-07 unverdicted novelty 5.0

    x-prediction maintains manifold adherence during training-free diffusion guidance better than ε- or v-prediction, per theoretical analysis and experiments on bird classification and style transfer.

  48. Drift Flow Matching

    cs.LG 2026-05 unverdicted novelty 5.0

    Drift Flow Matching connects direct transport maps from Drift Models with flow-based iterative refinement to enable adaptive computation in generative modeling.