- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper presents a one-step generator which meets physical constraints. A decoder is leveraged to map the generated results to physical world. The authors first analyze why ambient space residual penalties can cause ill-conditioning. The decoder is leveraged to remove the constraints and the conditioning issue is discussed.
The authors conduct experiments on some standard tests like Darcy, Burgers, Kolmogorov flow and etc, demonstrating that their framework can achieve lower error and inference cost.
Critical strengths
The paper combines one-step generator with physics constraint decoder, reducing the inference cost.
The experiments cover a wide of PDE and standard tests.
Critical weaknesses
The proposed method has limited novelty. Tackling constrained problem via coordinate mapping and perform generation in a latent space is a standard approach. The physical residual error metric in the experiment is kind of circular residual metric, since the proposed method is guaranteed to have zero error by construction.
The comparison misses some important one-step baselines, like consistency model/meanflow trained with the same network architecture and inferred with the same decoder.
Questions for authors
In Table 14, why does the RMS error rise a lot when only gamma changes? Were the decoders active in all rows? Gamma influences the generative model training, but not the decoder. Since the physical constraint is guaranteed by the decoder, why the gamma value other than 0.5 gives big RMS errors?
Part 1: Responses to the Critical Weaknesses 1
We thank the reviewer for recognizing the efficiency of one-step generation and for raising important questions about the learning mechanism and the role of the physical decoder.
W1. The methodological contribution beyond existing work is not clearly established; SoFlow already provides finite-interval maps and a consistency objective.
SoFlow already provides finite-interval flow maps and velocity-anchored solution consistency. However, SoFlow evaluates consistency of the generative velocity ODE solution map, rather than the governing PDE residual Rh(x,c)=0. PCFM[1] applies multiple physics corrections during sampling, increasing inference cost. PBFM[2] optimizes PDE residuals during training and uses unrolling for terminal-residual evaluation, increasing training cost. PMosFM generates samples in one step, with Rh(Ψc(r),c)=0 enforced by the decoder on the valid decoding domain. For the encoded constraints, PMosFM needs no additional sampling-time physics corrections, additional residual penalties, or terminal-residual unrolling during training.
With the same exact decoder, SoFlow trained in decoder coordinates has the same feasibility guarantee as PMosFM. PMosFM instead measures endpoint-matching errors in physical space and preconditions the decoder-induced metric and interpolation-state covariance. For endpoint coordinates a and b, coordinate-space consistency penalizes ‖a−b‖22, whereas PMosFM penalizes ‖Ψc(a)−Ψc(b)‖Mh2 in Eq. 12:
= (a-b)^{T}G̃_{c}(b)(a-b) + O(‖ a-b‖^{3}), G̃_{c}(b)=J_{Ψ_{c}}(b)^{T} M_{h}J_{Ψ_{c}}(b).$$ Coordinate errors with the same Euclidean norm can incur different physical-space penalties and produce different training gradients. $C_{c}$ is used to improve the conditioning of the decoder-induced metric. $P_{s,c}$ preconditions the covariance of interpolated states in Eq. 15. Neither $C_{c}$ nor $P_{s,c}$ is a scalar loss weight. Fig. 5 reports conditioning diagnostics. For an affine-isometric decoder, the two endpoint distances coincide, as expected. With the same decoder and feasible representation, PMosFM-native has lower energy distance than PMosFM–SoFlow across the reported benchmarks (Table 4; Darcy: 0.0043 vs. 0.0317). In the following PDE benchmarks, PMosFM and SoFlow both use one network evaluation, but PMosFM achieves lower RE, WD, and JS. | Benchmark | Metric | PIDM | ECI | PCFM | PBFM | PMosFM | SoFlow | | --- | --- | --- | --- | --- | --- | --- | --- | | Dynamic Stall | RE ×10⁶ ↓ | 2.96×10³ | 40.7 | 0.143 | 0.339 | **0.0421** | 468.7 | | Dynamic Stall | WD ×10⁴ ↓ | 179 | 11.1 | 4.01 | 1.81 | **0.842** | 712.1 | | Dynamic Stall | JS ×10² ↓ | 4.14 | 0.0570 | 7.46 | 0.680 | **0.0368** | 1.323 | | Dynamic Stall | NFE ↓ | 100 | 200 | 20 | 20 | **1** | **1** | | Dynamic Stall | IT [s] ↓ | 0.0866 | 0.432 | 3.91 | 0.0605 | 0.00338 | **0.00329** | | Darcy Flow | RE ↓ | **0.0220** | 3.05 | 4.19×10³ | 0.838 | 0.120 | 230.2 | | Darcy Flow | WD ×10² ↓ | 3.10 | 2.89 | 3.74 | 0.138 | **0.0490** | 7.297 | | Darcy Flow | JS ×10¹ ↓ | 3.18 | 2.82 | 0.199 | 0.256 | **0.0139** | 0.1284 | | Darcy Flow | NFE ↓ | 100 | 20 | 20 | 20 | **1** | **1** | | Darcy Flow | IT [s] ↓ | 2.05 | 0.122 | 1.33 | 0.101 | 0.0178 | **0.0174** | | Burgers | RE ×10¹ ↓ | 1.57×10³ | 0.818 | 0.473 | 0.307 | **0.0435** | 32.35 | | Burgers | WD ×10² ↓ | 248 | 2.55 | 2.73 | 4.02 | **0.129** | 7.481 | | Burgers | JS ×10² ↓ | 31.5 | 0.809 | 0.884 | 1.43 | **0.0320** | 11.17 | | Burgers | NFE ↓ | 20 | 20 | 20 | 20 | **1** | **1** | | Burgers | IT [s] ↓ | 0.0354 | 0.0902 | 0.134 | 0.0913 | 0.00237 | **0.00236** | *Note: RE denotes relative error, WD Wasserstein distance, and JS Jensen–Shannon divergence; lower is better.* [1] U. Utkarsh et al. “Physics-Constrained Flow Matching: Sampling Generative Models with Hard Constraints.” *Advances in Neural Information Processing Systems 38, 2025.* [2] G. Baldan et al. “Physics vs Distributions: Pareto Optimal Flow Matching with Physics Constraints.” *International Conference on Learning Representations ,2026.*