- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper introduces Physics-Aligned Finite Maps, a novel method for injecting physics constraints into generative models. The method contains two important parts: a physics-aligned teacher and sequence and transition recovery distillation. The physics-aligned teacher sequence model directly trains a generative model in a modified space where each intermediate state satisfies the physical constraint. And the transition recovery distillation models gradually correct errors in the autoregressive rollout predictions of the generative models. The method itself is very interesting and novel, but many unclear aspects of the paper's presentation, along with some weak results, have led reviewers to question its actual effectiveness.
Critical strengths
The method itself is novel. Although the current status of the paper makes it difficult to accurately evaluate the actual merits and drawbacks of this method, the idea itself is quite interesting.
Critical weaknesses
The presentation of the manuscript is poor, with many unclear and confusing concepts and discussions. The most critical issue comes from the definition of "free variables ", "physical completion map ", and "free coordinates extractor " . It is very difficult to properly understand their actual meaning before getting into the experiment setups. Even with the experiment sections, the reviewer needs to carefully dig into the Appendix to fully locate the corresponding operations in each setup. It will be much better if the author can show some examples of these variables/operations before the method discussion. Meanwhile, the unclear presentation induces many questions about the method itself, which further reduces the reliability of the current work.
Questions for authors
- What is the "free-coordinate extractor " for Kolmogorov flow? Do authors simply use for the Kolmogorov flow?
- In Eq.(4), since is a variable that contains noise, is there any guarantee that the completion map is still applicable to noisy inputs?
- Given a data sample and a physics constraint operator , can the author give some general comment on how to build/choose , , and ?
- From lines 2205 to 225, the author argues that "Crucially, the physical term does not introduce a separate transition destination" since "both terms attain zero at the same prediction". However, this holds for almost all physics-constrained training problems, i.e., if the model accurately predicts the target, the physical residual of the target is zero. What specific point does the author want to emphasize here?
- In Eq. 10, why is necessary for the input of the correction network? It seems that and are enough for the network to predict the discrepancy.
- What does the red curve "No-TRD" mean in Figure 1? Since two blue lines represent "BASE+TRD" and "BASE" respectively, does the red line actually mean "No-BASE"?
- Why do SMSE and WD show different trends in Table 2? For example, PBFM is better than PAFM in SMSE, while PAFM is better than PBFM in WD?
- Why is there unusual performance decay with more inference steps for PAFM, PCFM, and D-Flow in Figure 2?
- With fewer inference steps, e.g., N<=5, the performance of PCFM seems to be much better than PAFM. I.e., the PCFM shows a much lower physics residual with slightly higher WD. Can the author give some comments on this?
- Why is PCFM missing in the experiment of Darcy Flow?
Other comments:
- It seems that all the test cases are from the PBFM paper. It is better to cite it properly in Sec. 4.1.
5 comments
[2/3] Response to Reviewer KoXn
Q4: What do lines 220–225 mean?
We thank the reviewer for this question. Our key distinction is not merely that both losses share a feasible target, but that each finite next-state prediction directly produces a complete physical field, allowing physical constraints to be imposed without propagating generation to the final state.
In conventional FM-based methods such as PBFM, the network predicts an instantaneous velocity, requiring forward integration to obtain a terminal state for physical supervision. PAFM instead directly learns finite transitions between physically completed teacher states. Each predicted next state is already a complete physical field, so both transition matching and physical residuals can be evaluated immediately, without propagating through the remaining generative trajectory. This avoids costly terminal rollout and its associated backpropagation while aligning training with the updates actually executed during sampling.
This formulation also naturally accommodates different prescribed generation budgets. Increasing the number of finite transitions provides a finer progression toward the target distribution, which can mitigate conditional averaging and improve distributional fidelity, as supported by our additional diversity experiments and the analysis in Appendix B.2. TRD further mitigates physical inconsistency accumulated during these transitions.
Thus, the contribution is not simply a shared feasible optimum, but a constrained generative formulation in which every finite update is both a complete physical-field prediction and a directly supervised transport step.
Q5: In Eq. 10, why is necessary for the input of the correction network?
Yes, the provisional state, together with the transition time and condition , is sufficient to determine the recovery target. Our input choice in Eq. (12) provides a direct connection between BASE and TRD: we pass BASE’s existing inputs together with its output, the predicted increment , to the recovery network. TRD can internally represent the addition and learn the corresponding correction defined in Eqs. (10)–(11), without requiring the provisional state to be separately constructed as its input. This choice therefore reflects how the two networks are connected, rather than a requirement for information beyond the complete provisional state. The revised §4.4 clarifies this relationship immediately below Eq. (12).
Q6: What does the red curve "No-TRD" mean in Figure 1...
We have clarified the three curves in the revised legend and caption of Figure 2 (§5.2.1):
- BASE-only (red) follows an independent uncorrected rollout BASE.
- PAFM before TRD (purple) shows the BASE-predicted next state from each recovered PAFM state.
- PAFM (blue) shows the corresponding state after TRD.
Q7: Why do SMSE and WD show different trends in Table 2?
WD and SMSE capture different aspects of distributional fidelity. WD compares one-dimensional marginal distributions, whereas SMSE measures errors in conditional standard-deviation fields. At on Dynamic Stall, PAFM improves WD over PBFM ( versus ) but has worse SMSE ( versus ), using Table 25's scaling. The revised §5.2.2 explicitly acknowledges this limitation. The added diversity analysis (Appendix K.1, Table 27) confirms underestimated conditional variability: PAFM/PBFM variance ratios are , with coverage . PAFM improves with additional transitions, from variance ratio and coverage at . Appendix A.2, particularly Eq. (22), explains the conditional covariance lost through deterministic regression. Better marginal matching therefore does not establish better conditional spread, and learned physical recovery does not guarantee restoration of this missing variability.
Q8: Why is there unusual performance decay with more inference steps for PAFM, PCFM, and D-Flow in Figure 2?
The observed non-monotonicity depends on the metric and method. For PAFM on Dynamic Stall, WD, JS, and SMSE all improve across (Figure 3 and Table 2). Only the physical residual increases locally from to , before reaching its lowest value at . The revised §5.2.2 explicitly distinguishes these trends: more transitions improve ensemble metrics, while physical residuals need not decrease monotonically.
[3/3] Response to Reviewer KoXn
For PAFM, finer transitions reduce local averaging effects, while the final rollout also depends on learned-map errors and their propagation. More sampling steps shorten each transition, but the final physical residual also depends on errors accumulated through preceding predictions. Our Darcy diagnostic illustrates this distinction (Appendix I.2, Table 21). As increases from 5 to 20, the physical correction required after a BASE prediction decreases from 0.0371 to 0.0285 when BASE receives a teacher state. When it receives states from its own rollout, however, the required correction remains nearly unchanged (0.0383 to 0.0389). Thus, the benefit of shorter transitions observed on teacher states can be offset by accumulated prediction errors during generation. This explains why finer transitions do not necessarily yield monotonically lower final residuals and motivates TRD’s complementary role in correcting the states passed to subsequent transitions.
PCFM and D-Flow exhibit different budget-dependent trade-offs. Appendix K, Table 25, shows that D-Flow’s RE improves from to while its WD worsens; PCFM maintains a very low residual while its WD increases beyond . Their base budgets also affect additional inference operations: PCFM performs more physical corrections and projections, while D-Flow optimizes the source through the discretized generator. These mechanisms differ from PAFM’s learned finite transitions, and increasing their base budget does not by itself ensure better distributional fidelity. The results therefore support evaluating physical consistency, distributional quality, and total inference cost together when comparing sampling budgets.
Q9: With fewer inference steps, e.g., N<=5, the performance of PCFM seems to be much better than PAFM...
PCFM is a strong constraint-enforcement baseline: it has much lower Dynamic Stall residuals at all reported budgets and better JS/SMSE at . PAFM retains lower WD at . The cost difference is substantial: Table 25 reports 20 relaxed physics updates per outer step for PCFM. At , it uses constraint evaluations and projections, taking ms per sample; PAFM takes ms, approximately 8.0×/9.6× faster. Base budget therefore does not imply equal computation. §5.2.2 and Figure 3 make this accuracy–latency trade-off explicit. We do not claim learned recovery matches exact enforcement in residual accuracy.
Q10: Why is PCFM missing in the experiment of Darcy Flow?
Our initial comparison did not include PCFM because evaluating the released sampler in our Darcy setting required a task-specific adaptation to the continuous-permeability fields and Neumann boundary conditions. We have now completed this adaptation and added the comparison, with sampling steps and a fixed set of 1,024 Gaussian initializations. The adapted numerical projection uses uniform Frobenius scaling of the Jacobian and residual with relative damping .
The results are reported below using the main table’s metrics; all errors are unscaled.
| Method | RE ↓ | ↓ | ↓ | Valid ↑ | IT (ms/sample) ↓ |
|---|---|---|---|---|---|
| PCFM (adapted) | 0.188212 | 0.006255 | 1.164759 | 77.34% | 2939.94 |
RE is evaluated on all 1,024 samples. WD follows the original whole-field positive-permeability filter, retaining 792 samples; Valid reports this fraction. This additional experiment extends the Darcy comparison to PCFM under the stated adaptation and evaluation protocol. Compared with PCFM (adapted), PAFM achieves 78.8% lower RE, 60.4% lower , and 88.7% lower , while increasing validity from 77.34% to 100% (Table 3). The adapted PCFM sampler also requires a median 2.94 seconds per sample, incurring substantial sampling cost. These results show that, under the evaluated Darcy setting and adaptation, PAFM achieves stronger physical consistency and better marginal fidelity.
Other comment: Attribution of the benchmark datasets.
Thank you for this correction. The revised experimental setup, now §5.1, explicitly attributes Kolmogorov Flow and Dynamic Stall to the PBFM release (Baldan et al., 2026), and Darcy to PIDM (Bastek et al., 2025; Bastek, 2024). Appendices C.1–C.3 document provenance, numerical generation, preprocessing, and splits. PBFM is therefore credited both as a baseline and as the source of the two datasets we reuse.
[1/3] Response to Reviewer KoXn
We thank the reviewer for the constructive questions. We have reorganized the definitions and method presentation in the revised manuscript, and all references below follow its numbering.
W1: Definitions of free coordinates, extraction, and physical completion.
We have added a dedicated Preliminaries section (§3) to introduce the physical constraints, free coordinates, and physical completion before presenting the method. §3.2 explains these concepts through definitions and a concrete example. For complete state x, z=Ec(x) contains the quantities used to construct the generative path; Dc reconstructs the complete state using the selected physical relations. Both maps are prescribed, not learned. Under F=ma with known m>0 as condition, Eq. (3) gives z=F, Em(F,a)=F, and Dm(F)=(F,F/m). Table 4 and Appendix C collect the benchmark-specific constructions.
Q1: Is the Kolmogorov extractor the identity?
Yes. For physical constraints that can be enforced by projection, we can choose the identity extractor, Ec(x)=x, and use the corresponding projection as the physical completion map. For Kolmogorov Flow, Dc(z)=PLz, where PL is the Leray projector (Appendix C.1, Eq. (36)). Both velocity channels are retained as a redundant representation. “Free” describes the coordinates used to construct the path; it does not require a minimal set of independent variables. We have clarified this point in the revised §3.2.
Q2: Is completion applicable to noisy inputs?
The presence of noise does not itself invalidate physical completion; what matters is whether the intermediate coordinates remain within the admissible domain of Dc. In PAFM, randomness is introduced in appropriately chosen generating coordinates, and the coupled fields are then recomputed from those coordinates. We do not independently perturb an already completed field and assume that it remains physical. Our benchmark constructions address this requirement explicitly (Appendix C.1–C.3). For Kolmogorov Flow, the Leray projection is defined for arbitrary discrete velocity proposals, including noisy ones. For Dynamic Stall, temperature and density are represented in logarithmic coordinates; exponentiation with the specified range control preserves positivity, while the prescribed gradient parameterization permits analytical completion of pressure and wall shear. For Darcy Flow, we perturb log-permeability rather than permeability itself, so K=exp(z)>0; pressure is then obtained under the fixed compatible forcing, boundary conditions, and zero-mean gauge, subject to numerical solver accuracy. Thus, intermediate states need not resemble clean data to admit physical completion: they must satisfy the completion map’s input-domain requirements. This is why PAFM constructs the stochastic bridge in generating coordinates before completing each teacher state.
Q3: How should z, Ec, and Dc be chosen?
Our guiding principle is to identify the free variables according to the known physical relations, rather than arbitrarily reducing the state dimension. For a state x∈Rn with r independent physical constraints, the feasible states generally have n−r local degrees of freedom. We preferentially choose the physically determining quantities as z, define Ec to extract them from x, and construct Dc to recover the complete state using the governing relations.
For example, consider Newton's second law, F=ma, with mass m given as a condition. For the complete state x=(F,a), the applied force determines the acceleration. We therefore choose z=F, Ec(F,a)=F, and Dc(F)=(F,F/m). Thus, the generating variables follow the physical dependency structure, while completion reconstructs the remaining quantities.
This decomposition is not necessarily unique; we favor physically meaningful variables and computationally tractable completion operators. When an explicit free/dependent-variable decomposition is unnecessary, as in Kolmogorov Flow, we instead use a redundant representation with projection-based completion. We have clarified these general design principles and examples in the revised §3.2.