- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
I think it's a interesting question to study where we know flow matching shows it can be used on physics constraint generation and we know meanflow learns average velocity between timesteps in flow matching where first impression should be we can see it generalize to meanflow in multistep setting with constraints.
However, experiments on SPICE molecules and JetClass jets show that constraints applied to one-step outputs often do not carry over to multistep sampling, and vice versa. The authors connect this to where the constraint is enforced—in terms of time pairs, states, and step counts—and propose combining endpoint and sampler-step penalties. Additional physics and Lorentz-boost experiments show where this approach helps and where it falls short.
Critical strengths
The controls make the main finding more convincing. The authors do more than show that a constraint fails to transfer. Increasing the weight of a single penalty does not fix the other sampling mode, while combining penalties at the same total weight helps both. Changing the training step count also moves the region of low constraint error. These experiments give good evidence that where the constraint is applied matters, not just how strongly it is weighted.
The paper gives a useful fix and shows its limitations. Combining endpoint and sampler-step penalties improves both sampling modes on molecules and jets, and varying the training step count improves robustness across the tested budgets. I also appreciate that the authors report the incomplete transfer of physics residuals and the failure under Lorentz boosts rather than presenting the fix as universally successful.
Critical weaknesses
I’m still unsure how much of this comes from the particular MeanFlow setup. Why I say this is that I remember in paper Physics-Constrained Flow Matching, they say even for flow matching, we need to uses repeated corrections of predicted final samples during inference to enforce physical constraints. With MeanFlow supporting both one-step and multistep generation, I would expect keeping soft constraints consistent across these settings to need extra care. But how much of the observed behavior comes from the MeanFlow objective, and how much reflects the broader problem of constraints not carrying over to sampling?
The practical benefit needs stronger sample-quality checks. I agree that a mechanism paper does not need state-of-the-art generation quality. Still, I would like to know whether the combined and variable-step-count penalties improve constraint satisfaction without substantially hurting quality or diversity. This matters because the physics residuals improve transverse momentum while worsening the jet-mass distribution. For those physics experiments, comparing against an applicable inference-time correction baseline would also clarify what the training-time remedy offers beyond correcting samples during generation.
The study uses Euclidean MeanFlow with added soft penalties. How should the locality findings be interpreted for geometry-aware formulations, such as in Riemannian Flow Matching paper and in Riemannian MeanFlow paper, where some constraints are built into the probability paths and sampling maps?
Questions for authors
How broadly should we interpret the claim that the recipe applies to any few-step generator? In particular, would you expect the same behavior for additional soft constraints in geometry-aware formulations?
What if with the projection step included for meanflow as what Physics-Constrained Flow Matching done for flow matching in meanflow multistep sampling case? How does the proposed fix compare with inference-time correction alone in constraint error, sample quality/diversity, and sampling time? Does training with the penalty reduce the amount of correction needed?
3 comments
Responses to Review L2ox Part 2
Continuing on "How broadly should we interpret the claim that the recipe applies to any few-step generator? … How should the locality findings be interpreted for geometry-aware formulations (Riemannian Flow Matching, Riemannian MeanFlow)?"
Further on the architecture choice aspect, Geometry-aware models (Riemannian flow matching and the two Riemannian MeanFlow papers, now cited) build the manifold into the probability path and the sampling map, which is complementary to our analysis of additional soft terms. For soft terms added on top of such models, the distributional argument carries over directly, since every such term is still an expectation over states on the manifold. The Euclidean commutation argument holds in special cases, such as an isometric group action with an exponential-map update, and the revised limitations paragraph presents this extension as a well-motivated expectation that we plan to test. Preserving the manifold exactly does not by itself guarantee other symmetries or physical constraints, which is precisely where additional soft penalties. Therefore, we believe our analysis of them is useful.
"What if with the projection step included … How does the proposed fix compare with inference-time correction alone in constraint error, sample quality/diversity, and sampling time? Does training with the penalty reduce the amount of correction needed?"
We thank the reviewer for this valuable suggestion and have run this comparison. The baseline is a one-shot projection: each generated jet is rescaled once, at the final state, onto the conditioning targets (, , ) on which the residual is trained, a deliberately simpler version of the repeated corrections of PCFM. We measured the residual after projection, the fraction of jets for which the closed form is clipped or infeasible, the wall-clock time of sampling plus projection, and the relative correction the projection applies to each model.
The projection meets the sum rule exactly at negligible cost. Crucially, training with the residual places the samples close to the constraint surface, so the projection needs four to eight times less correction at the trained step count. The two approaches are therefore complementary, and residual training followed by projection gives the best combination of constraint error and local structure. One subtlety is that the conditioning uses the soft-drop mass, whereas the evaluated jet mass is that of the summed four-vector, so meeting the conditioning target exactly need not minimize the jet-mass Wasserstein distance. We could include the full comparison in the appendix of the final version, if permitted, as the complete set of experiments get overly heavy to conclude within the rebuttal period...
I thank authors for your extra experiments and reply. The comparison with ordinary flow matching using the same backbone, along with the shortcut-model results, largely addresses my concern that the behavior might be specific to meanflow. The clarification about geometry-aware models and additional soft constraints also makes sense to me. Hence, I maintain my positive opinion about this paper.
Responses to Reviewer L2ox (part-1)
We sincerely thank the reviewer for the encouraging assessment and for the insightful questions on generality, sample quality, and scope. The numbers below refer to the revised PDF unless marked "submitted". The appendices are relettered: submitted A–E are now B, C, D, E, and G, with a new App. A (experimental details) and a new App. F (additional experiments). Due to the size limit, we have to truncate our replies into two parts.
The comments from the reviewer are quoted in boldface to help with navigation. We will italicize our highlighted points inlined in our replies without boldfacing them to avoid confusion.
"how much of the observed behavior comes from the MeanFlow objective, and how much reflects the broader problem of constraints not carrying over to sampling?"
We thank the reviewer for this question. Two pieces of evidence show that the effect is not specific to MeanFlow, one already in the submission and one new. First, DDIM is a single-mode diffusion sampler, and there the same penalty enforced at all t retains a clear multi-step benefit, with the residual erosion matching the measured exposure bias (§4.2, App. B). Second, we retrained plain flow matching models on SPICE (App. F.2) with the same network and r pinned to t, so that the network learns only the instantaneous velocity, and swept K up to 50. The results reproduce the MeanFlow pattern: the endpoint penalty improves the single-step sampler, and the interpolant-state velocity penalty lowers the violation more than twofold at every K from 2 to 50. A shortcut model (App. F.5) shows the same dependence, with its self-consistency objective sharing part of a reduction across coupled budgets.
The dependence on the state distribution therefore holds for soft penalties on flow matching, shortcut, and diffusion samplers alike. MeanFlow adds the time-pair axis on top of it, which makes the choice of operating point a critical design decision and motivates our focus on two-time samplers. The sampler-agnostic statement is given in App. F.4 (Proposition 1): for any sampler built from Euler-type steps, the equivariance defect of the sample is the sum of the per-step velocity defects at the visited states, each carried through the remaining steps.
"The practical benefit needs stronger sample-quality checks … comparing against an applicable inference-time correction baseline"
We fully agree that this matters for practical use. We evaluated quality and diversity for the no-SEAL, endpoint, velocity, and combined models in both domains, with Chamfer and sliced-Wasserstein distances, per-feature marginals, jet observables, a short-range interatomic-distance diagnostic for SPICE, and a diversity statistic at fixed conditioning. At the deployed 10 steps, within-conditioning diversity is preserved within 10–20% in both domains, and on SPICE the constrained models match the unconstrained quality within seed noise. On jets, the combined penalty improves the per-particle marginals and the jet pT and η distributions, with a moderate cost in Chamfer distance and jet mass. The velocity-only penalty preserves single-step fidelity and is the most economical choice when only multi-step sampling is deployed. To stay within the page limit, the revised PDF summarizes these trade-offs in §6, and we will include the full tables in the appendix of the final version.
In addition, the new experiment on the released EPiC-FM generator (§4.5, Fig. 4, App. F.6) demonstrates the recipe on a model of published quality. A constraint on the high-level jet observable τ32 brings it close to the real-data level at the targeted step count, up to 61× closer than without the constraint, while the published sampler is preserved. The inference-time correction is discussed in our answer to the last question below.
"How broadly should we interpret the claim that the recipe applies to any few-step generator? … How should the locality findings be interpreted for geometry-aware formulations (Riemannian Flow Matching, Riemannian MeanFlow)?"
We thank the reviewer for raising the question of scope. Our finding has two parts, and we believe they both are broad enough.
The time-pair statement applies to any few-step generator that exposes a (t,r) pair, including MeanFlow, flow maps, and consistency-type models, and §1 and §6 now state this scope in place of the broader submitted wording. The state-distribution statement is the more general result, since it requires only an iterative sampler and a penalty sampled from some distribution of states, and the DDIM experiment and App. F.2 confirm it beyond MeanFlow. Together, these statements yield a simple principle for any soft constraint added to few-step generators: a penalty acts on the states it is sampled from, so it should be placed where the sampler travels. This makes the result relevant wherever symmetries or physical constraints are imposed through training rather than architecture.