- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes MINT to discover shared PDEs from multiple sparse observation trajectories generated by the same partial differential equation. The method fits an independent neural field for each trajectory and employs genetic programming to search for a shared expression tree. The pipeline consists of a structure-search stage with frozen neural fields and a continuous parameter optimization stage after the tree structure is fixed. The authors further propose MINT-M, which incorporates PDE-family motifs into the initialization of genetic programming. Experiments are conducted on six analytical benchmarks, reporting equation term recovery rates, field reconstruction errors, and performance under noise, varying observation counts, and missing candidate library settings.
Critical strengths
- Addresses the ambiguity of single-trajectory PDE discovery by leveraging multiple trajectories governed by the same underlying equation.
- MINT decouples trajectory-specific field reconstruction from shared equation structure identification, providing a clear methodological rationale.
- Evaluates six PDEs under varying noise levels, observation quantities, and candidate-term omissions, using both term recovery rates and field reconstruction errors.
- MINT-M provides preliminary evidence that family-level structural motifs can guide genetic search toward identifying nonlinear terms, offering a promising direction for improving symbolic PDE discovery.
Critical weaknesses
-
Insufficient validation of the core contribution. The paper lacks controlled experiments varying trajectory counts under fixed observation and computational budgets, as well as ablations to isolate the gains of multi-trajectory consistency from other components.
-
Limited generalizability across PDEs. MINT performs unevenly across PDE benchmarks, with failures on several equations. Nonlinear evaluations are limited to traveling-wave trajectories, leaving its effectiveness on general initial-value problems unverified.
-
Unverified robustness of prior-guided MINT-M. MINT-M’s improvements rely on PDE-family motifs, but experiments do not examine incorrect or incomplete priors, leaving its robustness to prior mismatch unclear.
-
Insufficient analysis of equation recovery failures. Low field errors do not guarantee correct equation recovery. The paper lacks systematic analysis of spurious and missing terms, as well as validation on unseen trajectories.
Questions for authors
- Under fixed total observations and identical search budget, how does MINT’s recovery rate change with the number of trajectories ? Compared with single-trajectory GP, does the benefit brought by multiple trajectories still hold?
- Could the authors ablate shared terminal screening, local residual, CVaR and Stage II refinement separately, and report equation term recovery rates rather than only field errors, to clarify the contribution of each mechanism to the core results?
- How are the motifs of MINT-M constructed, and what specific prior information do they contain? How does the recovery rate change when the motif is incorrect, partially correct, or mismatched with the target equation?
- Could the authors provide representative expressions from successful and failed runs, distinguishing missing terms, spurious terms, redundant terms and coefficient errors? Can the residual or prediction performance of the discovered equations be evaluated on unseen trajectories?