Skip to content

PathGuide: Dynamic Classifier-Free Guidance via On-Policy Transport Alignment

Aug 2026 · 0 citations · 75 references
Computer Science Mathematics

TL;DR

This work introduces PathGuide, a framework that reformulates scalar CFG selection as an on-policy transport problem and derives a selection criterion with a direct path-correctness interpretation that yields a strictly quadratic local objective with an efficient, closed-form selector for each solver interval.

Abstract

While modern generative models excel at modeling complex data, precise inference-time control in conditional generation remains a critical challenge. Classifier-free guidance (CFG) is a primary mechanism for such control, yet it is typically treated as a static tuning parameter. In flow-based models, however, the guidance scale fundamentally dictates the velocity field and the resulting probability path, making guidance selection a dynamic path-optimization problem. We introduce PathGuide, a framework that reformulates scalar CFG selection as an on-policy transport problem. Leveraging the weak form of the continuity equation, we derive a selection criterion with a direct path-correctness interpretation: we prove that if the guided field is weakly equivalent to the exact conditional field along the generated rollout, the sampler's path coincides with the target conditional law. For scalar CFG, this criterion yields a strictly quadratic local objective with an efficient, closed-form selector for each solver interval. PathGuide enables optimal guidance scales to be computed and used online during generation or fitted offline as a reusable piecewise-constant schedule. We validate our method on low-resolution image manifolds and controlled settings across various continuous-time flow constructions, demonstrating that this transport-based selector improves path alignment and sample fidelity over both fixed and state-of-the-art adaptive guidance baselines.

View source

Similar papers

Preprint Aug 2026

Beyond the Stability-Exploration Dilemma: Environmental Regularization for LLM Policy Optimization

Environment-Regularized Policy Optimization (ERPO) replaces the standard Policy-KL regularizer while achieving effective control over query distribution drift, delivering stronger accuracy and substantially more stable behavior under high-temperature decoding and long-horizon training.

Xianlei Zhou, Xiangdi Meng, Yu He et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Information-Time Proximal Policy Optimization

This paper proposes InfoPPO, which reparameterizes temporal progression using information density rather than raw token count, and extends performance-difference and policy-improvement analyses to the information-time MDP, deriving a policy-improvement lower bound when policy changes are regulated by information densit...

Yong-Cheng Zeng, Xin-Yu Cui, Yan Song et al. · 0 citations
Book Open access Aug 2026

LEAP: Learning-Dynamics-Guided Open-Loop Pricing for LLM Data Acquisition

The sustainability of AI-powered Web platforms often relies on a feedback loop: stronger models improve user experience, which can help generate interaction data for further refinement. During Large Language Model (LLM) fine-tuning, however, the marginal utility of additional data can change over time, while many incen...

Zhiheng Wang, Xuehe Wang · 0 citations
Preprint Aug 2026

Control-Oriented Scenario Tree Construction through Reinforcement Learning

Multistage stochastic model predictive control (MPC) handles uncertainty by optimizing over a scenario tree, a finite branching approximation of future outcomes constructed from sampled forecasts. To build such a tree, conventional methods focus on matching the underlying probability distribution---e.g., via Wasserstei...

Fabio Pavirani, Bert Claessens, Pierre Pinson et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Learning Multimodal One-step Flow Policy via Value-weighted Optimal Transport

This work introduces One-step Flow policy via Optimal Transport (OptiFlow), a framework for one-step flow policy learning as a structured sample-allocation problem and demonstrates that OptiFlow effectively captures optimal multimodal behaviors and achieves strong performance across diverse offline RL benchmarks.

Jaehun Shon, Jin-Ha Choi, Jongwook Jeon et al. · 0 citations
#artificial intelligence Preprint Sep 2026

OTROPE: Optimal Transport-based Robust Off-policy Evaluation for Large Language Models

The Optimal Transport-based Robust Off-Policy Evaluation (OTROPE) is proposed, a likelihood-free evaluation that performs distributional correction in a semantic space via optimal transport to align labeled behavior-policy samples with unlabeled target-policy samples, yielding a doubly robust-style evaluation.

Lin-Er Xiang, Wen-Bo Zhang, Heng-Rui Cai · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.