W1. One of my main concerns is that the paper does not sufficiently discuss or distinguish itself from several closely related methods. For example, PnP-Flow [1] also uses pretrained flow-matching models with iterative corrections and reinterpolation to solve inverse problems, while Lagrangian Dual Flows [2] formulates constrained generation using continuous-time dynamics, which seems closely related to the MAFM framework. Moreover, the authors themselves discuss the connection between MAFM and PCFM when the adjoint guidance is removed, although MAFM still retains an additional relaxation mechanism.
In particular, for linear constraints, the persistent-anchor update seems closely related to a relaxed projected-endpoint iteration, with the relaxation parameter controlling how much information is retained from previous predictions. While the proposed formulation is not mathematically identical to these existing approaches, I don't think the paper clearly establishes what additional advantage comes from the proposed persistent-anchor dynamics. This strengthens my concern that some of the underlying motivations and algorithmic ideas are quite similar to previously published approaches.
W2. The paper does not sufficiently compare against several closely related methods. In particular, methods such as D-Flow [3] and PnP-Flow [1] also leverage pretrained generative models and operate only during inference. More recently, Chance-constrained Flow Matching (CCFM) [4] and FunDPS [5] consider a similar problem of constraint-aware flow-based generation. Similarly, there are methods addressing PDE inverse problems using generative modeling approaches, such as DiffusionPDE.
I think including more of these baselines directly would help establish the advantages of the proposed method more convincingly, particularly because some of these methods have already been evaluated on PDE systems similar to those considered in this paper.
W3. I'm also quite surprised by the performance of the existing baselines, particularly ECI and PCFM, across several experiments. For example, in Table 1c, PCFM-Base achieves an own-IC relative L2 error of 13.6% on Euler and 12.3% on controlled Navier–Stokes, whereas even a simple terminal projection achieves much lower errors of 3.62% and 3.40%, respectively. These are quite substantial differences, especially considering that PCFM was explicitly designed to enforce constraints during sampling while preserving the quality of generated samples, and its published results also include evaluations on PDE systems.
Moreover, recent work such as CCFM [4] also evaluates PCFM on PDE-constrained generation problems, where it achieves relatively competitive performance. I understand that the experimental settings and constraints may not be exactly the same, and this is precisely what I would like to understand. I think the authors should clarify how these baselines were implemented or explain why there is such a large degradation in physical consistency. In particular, it is unclear whether this behavior arises from the choice of correction strengths, projection schedules, or other differences in the experimental setup.
W4. The current experiments do not sufficiently establish some of the broader claims made in the paper about preserving the learned generative distribution. For example, the main physical-consistency metric for the dynamical PDEs is the relative L2 error between a generated trajectory and an independently computed PDE solution using the generated initial condition. I understand this is a reasonable metric for evaluating physical consistency, but it does not necessarily evaluate or give an idea of the distribution of generated samples under the specified constraints.
There are some distributional metrics reported in the paper and appendix, but upon closer inspection, the results seem mixed. For example, resampled ECI achieves substantially better field SWD than MAFM on Burgers, while terminal projection achieves better field SWD on the fixed-energy benchmarks. I think these results deserve more discussion, particularly because one of the main motivations of the proposed method is to preserve the learned data distribution while enforcing constraints during sampling.
Moreover, the Euler and Navier–Stokes experiments use training distributions with a fixed energy level, and the inference-time constraint enforces the same energy. This does not demonstrate conditional generation at previously unseen energy levels, which seems particularly relevant to the motivation of the paper.
References
-
Martin, Ségolène, et al. "Pnp-flow: Plug-and-play image restoration with flow matching." International Conference on Learning Representations. Vol. 2025. 2025.
-
Kurtz, Vince, and Alexander Davydov. "Constrained Flow Matching via Lagrangian Dual Flows." arXiv preprint arXiv:2607.04513 (2026).
-
Ben-Hamu, Heli, et al. "D-flow: Differentiating through flows for controlled generation." arXiv preprint arXiv:2402.14017 (2024).
-
Liang, Jinhao, et al. "Chance-constrained flow matching for high-fidelity constraint-aware generation." arXiv preprint arXiv:2509.25157 (2025).
-
Yao, Jiachen, et al. "Guided diffusion sampling on function spaces with applications to pdes." Advances in Neural Information Processing Systems 38 (2026): 127057-127094.
Multiplier solve complexity and runtime compared with PCFM
Q3. What is the cost of the solve on line 9 of Algorithm 1 in the original submission? Is it slower than PCFM? (W4)
A3. We want to clarify that the computational cost in both methods is of the same order. We denote the constraint residuals as C.
PCFM evaluates JP=DC(u1) at the predicted endpoint u1 and corrects that endpoint with a Gauss–Newton projection. MAFM evaluates Jk=DC(ak) at the persistent anchor ak and solves for the multiplier λk to correct the candidate velocity wk and prescribe residual contraction at rate κ(tk). The evaluation points and right-hand sides differ. With m scalar constraints and a d-dimensional state, given the m×d Jacobian, both dense implementations take O(dm2) to form an m×m Gram matrix and O(m3) to factor and solve it.
As in PCFM [1], our experiments use m≪d, with far fewer scalar constraints than state dimensions. Fixed sensor selection gives a diagonal Gram matrix in Poisson. Mass and energy allow framewise mean and radial corrections, respectively. Imposing a strong-form PDE residual at every space-time grid point can make m comparable to d, bringing the generic dense cost to O(d3). Our main PDE experiments impose specified hard constraints during sampling and evaluate PDE consistency with an independent solver.
MAFM was slightly slower than PCFM in these timing tests. Both methods used 100 forward evaluations, and MAFM also computed 100 input vector–Jacobian products (VJPs) on Poisson. In the fixed-energy tests, both methods used zero VJPs, and MAFM performed additional work to track the endpoint and contract the radial deviation of its persistent anchor.
In the revised manuscript, we have added an explanation of the costs of dense and structured solves.
References