REVIEW 10 cited by
Training-Free Guidance Beyond Differentiability: Scalable Path Steering with Tree Search in Diffusion and Flow 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
Training-Free Guidance Beyond Differentiability: Scalable Path Steering with Tree Search in Diffusion and Flow Models
read the original abstract
Training-free guidance enables controlled generation in diffusion and flow models, but most methods rely on gradients and assume differentiable objectives. This work focuses on training-free guidance addressing challenges from non-differentiable objectives and discrete data distributions. We propose TreeG: Tree Search-Based Path Steering Guidance, applicable to both continuous and discrete settings in diffusion and flow models. TreeG offers a unified framework for training-free guidance by proposing, evaluating, and selecting candidates at each step, enhanced with tree search over active paths and parallel exploration. We comprehensively investigate the design space of TreeG over the candidate proposal module and the evaluation function, instantiating TreeG into three novel algorithms. Our experiments show that TreeG consistently outperforms top guidance baselines in symbolic music generation, small molecule design, and enhancer DNA design with improvements of 29.01%, 16.6%, and 18.43%. Additionally, we identify an inference-time scaling law showing TreeG's scalability in inference-time computation.
Forward citations
Cited by 10 Pith papers
-
Bootstrap Flow-Map Tree Sampling Enables Online Feedback Driven Search
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.
-
Inference-Time Scaling in Diffusion Models through Iterative Partial Refinement
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.
-
Iterative Inference-time Scaling with Adaptive Frequency Steering for Image Super-Resolution
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...
-
x-Prediction Is All You Need:Training-Free Accelerated Generation via Endpoint Decodability
Affine probability paths make the clean endpoint algebraically recoverable from any intermediate state and velocity, so early-exit decoding yields training-free 20–70% NFE savings at near-matched quality.
-
Sequentially-Controlled Interactive Multi-Particle Flow-Maps for Online Feedback-Driven Search
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.
-
Slowly Annealed Langevin Dynamics: Theory and Applications to Training-Free Guided Generation
Slowly Annealed Langevin Dynamics provides non-asymptotic KL-based convergence guarantees for tracking moving targets and enables training-free guided generation via a velocity-aware correction that accounts for pretr...
-
Flow-Direct: Feedback-Efficient and Reusable Guidance for Flow Models via Non-Parametric Guidance Field
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.
-
HardFlow: Hard-Constrained Sampling for Flow-Matching Models via Trajectory Optimization
HardFlow turns hard constraint enforcement during flow-matching sampling into a tractable terminal-time trajectory optimization problem using optimal control.
-
x-Prediction Is All You Need:Training-Free Accelerated Generation via Endpoint Decodability
Truncated Jump Sampling stops the ODE early and outputs the algebraically decoded x0 estimate, reducing NFEs by 20-70% across six model families with no retraining.
-
Discrete Diffusion Models: A Unified Framework from Tokenization to Generation
Discrete diffusion models are re-framed as instances of a tokenization-centric, four-component design space (corruption, denoiser, objective, sampler) in a broad survey with no new experimental or theoretical results.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.