- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces the Neural Constitutive Laws–Mass-Compression-Transport (NCL-MCT) Solver, which learns PDE-specific constitutive responses for generalized reaction-diffusion systems while keeping density evolution in one shared integrator. The density balance is . Following the energetic variational approach, transport is closed by a positive mobility and a thermodynamic driving force, with and , and reaction by a relative rate . These responses depend only on the current density, so the same modules can be reused across initial conditions and time horizons. The shared MCT integrator splits , advancing compression by a conservative finite-volume step and mass by a semi-Lagrangian step. A convolutional neural operator predicts and a pointwise network predicts . Training does not differentiate through time integration: velocity data supervise only the product , with a curl penalty on , while known laws supervise and separately, including on density fields that are not solution snapshots. Across seven systems, relative rollout errors are about to . Without retraining, errors on unseen initial-condition families are about lower than the strongest finite baseline, and over a horizon about the training window the errors change by at most about , against increases of up to about for the baselines. The main limitation is the assumption , which is strained by vanishing density in porous-medium flow.
Critical strengths
- The experimental design covers a wide range of generalized reaction-diffusion behavior and tests whether a learned constitutive module can be reused. Seven systems span linear diffusion, phase-field transport, degenerate diffusion, local reaction, and two-species coupling. Both velocity-data and known-law supervision are reported against F-FNO, CFO, and DOOL, with relative rollout errors from about to . The evaluation also goes beyond in-distribution rollouts: unseen initial-condition families, a horizon about the training window, and trajectory-free training on independently sampled density fields.
- The method is organized around a clear split between system-specific constitutive responses and a shared evolution procedure. Transport is represented by mobility and thermodynamic driving force, and reaction by a relative rate, while the MCT integrator advances compression and mass and reconstructs the density. The two supervision modes match what the data can identify: velocity observations constrain only their product, with a curl penalty on the driving force, whereas known laws supervise the two factors separately. Training does not backpropagate through time integration, and the same interface is reused across PDEs.
Critical weaknesses
- The experiments do not report training convergence or inference speed. There are no loss curves, and no wall-clock comparison of NCL-MCT with F-FNO, CFO, DOOL, or with the finite-difference and finite-volume solvers used to generate the data. A learned PDE solver is useful when inference is substantially faster than a classical discretization. This comparison is especially relevant here, because each step still evaluates a neural constitutive map inside a finite-volume and semi-Lagrangian update, so the cost relative to a standard scheme is not obvious from the accuracy tables.
- The paper does not explain how the loss weights were chosen. The velocity objective adds three terms, a velocity-matching term, a curl penalty, and a reaction term, and sets the curl weight to . The known-law objective likewise sums mobility, force, and reaction errors. There is no sensitivity study or selection procedure for these coefficients.
- The paper provides no approximation, stability, or rollout-error guarantee for the learned constitutive map composed with the MCT integrator. Comparable operator-learning methods do have such results. Chen and Chen (1995) give the classical universal approximation theorem for nonlinear operators. Lanthaler, Mishra, and Karniadakis (2022) prove approximation and generalization bounds for DeepONets. Kovachki, Lanthaler, and Mishra (2021) prove universal approximation for Fourier neural operators and explicit error bounds for PDE solution operators.
References:
- Tianping Chen and Hong Chen. "Universal approximation to nonlinear operators by neural networks with arbitrary activation functions and its application to dynamical systems." IEEE Transactions on Neural Networks, 6(4):911–917, 1995.
- Samuel Lanthaler, Siddhartha Mishra, and George Em Karniadakis. "Error estimates for DeepONets: a deep learning framework in infinite dimensions." Transactions of Mathematics and Its Applications, 6:tnac001, 2022.
- Nikola Kovachki, Samuel Lanthaler, and Siddhartha Mishra. "On universal approximation and error bounds for Fourier neural operators." Journal of Machine Learning Research, 22(290):1–76, 2021.
Questions for authors
Please see the concerns in the weaknesses.
2 comments
Response to Reviewer Vcks
Q1. Can the authors provide training-loss curves and wall-clock comparisons with F-FNO, CFO, DOOL, and the reference numerical solvers to assess training convergence and inference efficiency?
A1. Thank you. We added training-loss histories for all 14 full-window NCL-MCT Solver models. From the first to the final recorded value, the losses decrease by approximately three to five orders of magnitude. These histories indicate optimization progress but do not establish convergence by the final update; Vel. and Law also optimize different objectives (Appendix J.1; Figure 24).
We clarified that the rollout timings include network evaluations and numerical updates, and added a profiled step-time breakdown. On a single NVIDIA GeForce RTX 5090, NCL-MCT Solver requires less training time than F-FNO and CFO for 100,000 optimizer steps across all seven systems. Its mean per-step rollout time is 1.94–4.10 ms, shorter than CFO’s and longer than F-FNO’s. On the three nonreactive systems, DOOL has the shortest training and rollout times but larger rollout errors than NCL-MCT Solver (Appendix J.1; Tables 1 and 16).
For Schnakenberg, we also compare numerically evaluated and learned constitutive responses within the same MCT time-stepper. Over 20,000 steps, the mean rollout time is 62.01 s with Numerical–Numerical responses and 82.00 s with Neural–Neural responses (Appendix I.3; Table 14).
Q2. How were the loss weights chosen, particularly the curl-penalty weight of 0.01, and how sensitive is performance to these choices?
A2. Thank you. We include the curl penalty to suppress spurious local rotation in the learned driving force and encourage its curl-free physical structure, . On Fisher–KPP, gives the lowest mean , , and NAsym among the tested weights, reducing mean NAsym by approximately 87% relative to a curl-penalty weight of zero (Table 12). The Schnakenberg results are provided in Appendix I.2 (Table 13).
Ablation of the curl-penalty weight on Fisher–KPP under velocity-data supervision with MCT (Appendix I.2; Table 12). Entries are mean ± SD over ten test trajectories with 500 rollout steps. NAsym is averaged over 101 evaluation times per trajectory.
| NAsym | |||
|---|---|---|---|
| 0 | |||
| 0.01 | |||
| 0.1 | |||
| 1 |
NAsym. Following the normalized Jacobian-asymmetry diagnostic in [1], we measure the skew-symmetric share of the spatial force Jacobian. NAsym lies in ; zero indicates a symmetric spatial Jacobian, while larger values indicate greater local rotation.
[1] Chao et al. On Investigating the Conservative Property of Score-Based Generative Models. ICML 2023. arXiv:2209.12753.
Q3. What approximation, stability, or rollout-error guarantees can be established for the learned constitutive maps coupled with the MCT time-stepper?
A3. Thank you. We establish a conditional finite-horizon bound on the density difference between MCT rollouts using learned and numerically evaluated constitutive responses. At a fixed grid, time step, and reset schedule, the bound holds when both rollouts remain in a common admissible set and the stated one-step discrepancy and Lipschitz assumptions are satisfied. A bound relative to the continuous PDE solution would additionally require a discretization-error estimate (Sec. 4.2; Appendix A.5).
We also evaluate one-step discrepancies and perturbation effects across seven PDEs, using 20 reinitialized reference states and 480 sampled perturbations per PDE. Maximum relative one-step discrepancies range from to , and all sampled perturbation ratios are below one. These are local density-space diagnostics at the sampled states; they do not establish uniform stability over a full rollout or under mesh refinement (Appendix J.2; Table 17).
We thank the reviewers for their constructive comments and recognition of our framework’s physical structure, accuracy, and generalization. The seven systems share a constitutive interface and time-stepper, while each system trains its own response modules. Revisions are marked in blue. The main changes are:
Summary of our response
Contributions and ablations (u59j, Ds7E, qY9r, Vcks). We distinguish Vel. supervision of the mobility–force product from Law supervision of the individual responses under a specified physical convention. We add time-stepper comparisons using identical network weights, CNO–DeepONet comparisons, and curl-penalty weight ablations, distinguishing within-checkpoint comparisons from variation across training runs (Sec. 4.3; Appendices I.1, I.2, I.4).
I/M material state (qY9r). We clarify how the I/M decomposition retains supplied material composition information, enabling composition-dependent dynamics. In a two-population example, we show how common compression cancels in the material derivative of the population ratio and how both MCT and direct population evolution reproduce the separation of states with equal total density (Secs. 4.2, 5.1; Appendix J.5).
Constitutive identifiability (Ds7E). We show that distinct physically valid energy–dissipation laws can produce the same mobility–force product and density evolution. Thus, non-uniqueness under velocity supervision is compatible with the underlying physics (Secs. 3, 4.3; Appendix A.4).
Generalization and module reuse (u59j, qY9r). We distinguish checkpoint reuse for new initial conditions from evaluation beyond a shortened training window, and clarify Schnakenberg’s state-range screening. We also reuse single-population velocity and growth networks in a two-population system without retraining (Appendices G, J.5).
Conditional error analysis and statistics (u59j, Vcks). We establish a conditional finite-horizon bound between MCT rollouts with learned and numerically evaluated constitutive responses at fixed discretization. We also add sampled one-step diagnostics across seven PDEs and 95% confidence intervals for mean rollout errors over ten Schnakenberg trajectories (Appendices A.5, I.1, J.2).
Training, runtime, and numerical settings (u59j, Vcks). We add training-loss curves, rollout and per-step timing breakdowns, and per-PDE factor-reset intervals. For Schnakenberg, we compare native and learned updates on the same GPU, using the same precision and batch size, including a comparison at the same time step (Appendices C, J.1).