cs.LGNov 17, 2026

Path-Aligned Constraint Equivariance

Authors: Yuhao Wang, Yuanxi Peng

Organizations: National University of Defense Technology, Changsha, China

Abstract

Learned super-resolution of physical fields must satisfy structural constraints---such as divergence-free flow (∇⋅u=0\nabla\cdot u=0), curl-free fields (∇×u=0\nabla\times u=0), and pointwise sum-to-one normalization (1⊤p=11^\top p=1)---that standard training objectives do not enforce. Soft penalties trade fidelity against satisfaction via a scalar hyperparameter λλ but cannot drive the residual to zero; hard-constrained regression eliminates the residual by construction yet converges to the conditional mean, losing small-scale spectral structure. We observe that in Conditional Flow Matching with linear paths, a linear constraint Ax=cAx=c is preserved along the entire transport trajectory whenever the velocity field is compatible (Avθ=0Av_θ=0) and the initial noise is consistent (Ax0=cAx_0=c); along the trajectory, the latter two conditions are also necessary. We term this the path-equivariance principle and instantiate it in PACE (Path-Aligned Constraint Equivariance), a framework that enforces these conditions through a null-space parameterization of the velocity field and a constraint-respecting noise sampler, with no modification to the loss function or the ODE integrator. Across three constraint families, PACE reduces the mean constraint residual by one to five orders of magnitude relative to unconstrained baselines, matching the residual level of the data-generation pipeline itself. The proposed framework requires only a closed-form parameterization onto the null space of AA; within this scope, it offers exact constraint enforcement while recovering the spectral content and predictive diversity that conditional-mean regression systematically loses, all under a single unified recipe.

Figures & tables

Explore similar work

Aug 21, 2026

Difficulty-Calibrated Interpolation Paths for Conditional Flow Matching

Conditional Flow Matching trains generative models by regressing a network onto the velocity of a prescribed noise-to-data interpolation path. The interpolation schedule that shapes this path is known to affect convergence and sample quality, yet it is invariably fixed in advance, independent of both the data and the model. We show that the regression difficulty of Conditional Flow Matching varies systematically along the path, and we propose Difficulty-Calibrated Flow Matching, which derives the schedule from the model itself: a short pilot run with the linear path records the per-time loss, and the schedule is set to the quantile function of this difficulty profile, so the trajectory lingers where the velocity is hardest to learn. The method has a single hyperparameter, leaves the training objective and its gradient equivalence intact, composes with classifier-free guidance, and adds about two percent training overhead. In controlled experiments on CIFAR-10, MNIST, and Fashion-MNIST with an identical compact U-Net, the calibrated path attains the best FID on CIFAR-10 at full sampling budget and clearly outperforms all fixed schedules in the large-batch, few-update regime, precisely the setting where compute is scarcest.
Sep 30, 2026

MintFlow: Minimal Trajectory Intervention for Constrained Flow Matching

Flow matching models excel at generative modeling, and many downstream applications require their samples to satisfy prescribed constraints, such as observed measurements and physical laws. However, existing constrained samplers often face a trade-off: enforcing constraints can substantially displace samples from the pretrained data distribution. To address this trade-off, we introduce MintFlow, a training-free constrained sampling framework that formulates constraint enforcement as a minimal intervention on the pretrained flow trajectory. MintFlow seeks the minimal perturbation of an intermediate flow state such that its subsequent evolution under the pretrained flow field satisfies the target constraint. By minimally perturbing the flow state while keeping the pretrained flow field unchanged, MintFlow enforces the constraint while minimizing unnecessary deviation from the pretrained distribution. An adjoint formulation yields a closed-form expression for this perturbation, eliminating expensive iterative optimization. Furthermore, MintFlow adaptively selects the intervention time to balance the required perturbation magnitude with its amplification by the remaining flow. Across a range of tasks in generative vision and physical system modeling, MintFlow achieves competitive constraint satisfaction while preserving the pretrained generative distribution substantially better than state-of-the-art constrained methods.
Oct 6, 2026

Co-Evolving Paths and Flows via Path-Flow Alignment

We study path-flow alignment as a unified training objective for flow matching. Instead of fixing the interpolation path and learning only the velocity field, we jointly train an endpoint-preserving path network and a flow network using the same alignment loss: the flow learns to match the path velocity, and the path learns to align its velocity to the current flow. Although every fixed learned path defines a valid flow-matching objective, the alignment loss alone is not a reliable criterion for path learning. We identify path overfitting, a failure mode in which the alignment loss decreases while sample quality worsens. We find that this failure is associated with low-entropy bottlenecks in the induced probability path, where the learned path routes samples through overly concentrated intermediate marginals. Motivated by this diagnosis, we introduce a stochastic path regularizer that hides part of the source information from the path network while preserving exact endpoints. The resulting regularization gives an explicit entropy floor for the stochastic training-path marginals and empirically suppresses the bottleneck in the learned sampler, making joint path-flow training effective. On ImageNet-256x256 with SiT backbones, our method consistently improves FID across model scales, extends to model-guidance training, and leaves the inference-time architecture and sampler unchanged. Code is available at https://github.com/lizeyu090312/traj_opt_paper