- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3(+1)
Read review
Paper summary
CARE-PDE discovers governing PDEs from observations with sample-level heterogeneous noise. It combines Cauchy-loss field reconstruction with GMM reliability estimation, reliability-guided local Legendre projection for derivatives, local integral constraints, and stability-selected sparse regression. On 12 synthetic PDE systems it recovers the exact support in all 36 main tasks and reports lower true-term coefficient errors than ten baselines, with additional results on harder noise settings, derivative quality, parameter sensitivity and ablations.
Critical strengths
- The method addresses a real difficulty in noisy equation discovery and propagates observation reliability coherently through reconstruction, derivative estimation and sparse identification. Regularizing the field before differentiation is well motivated by the instability of high-order derivatives.
- The evaluation spans 12 systems, including high-order and coupled dynamics, with one shared configuration. The derivative-quality diagnostics and ablations support the combination of projection and integral constraints; removing LICA reduces exact recovery from 36/36 to 28/36 (Table 3).
Critical weaknesses
- The evaluation protocol leaves model selection unclear. Only the training split is corrupted while the 20% validation split stays clean (Sec. 4.1, Eqs. 17–18), and Sec. 3.5 keeps the H checkpoints with the lowest reconstruction error without stating on which data this error is computed; if it is the clean split, selection uses clean targets that the NDEC setting does not provide. Independent-run variability and baseline tuning are not reported, and some entries are inconsistent: DeepMoD on Chaffee–Infante at (0%, 50%, 25%) has Etrue = 100% but Efull = 0 (Table 10), and Burgers2D at β = 50%, α = 0.25 lists P = 1.00, R = 0.50, F1 = 1.00 (Table 16).
- The experiments use only randomly assigned two-level Gaussian noise (Eqs. 17–18), which covers the motivating contamination scenarios only partially. Removing AGRE still recovers 35/36 tasks, and removing RGLP replaces projection with automatic differentiation altogether (Table 3), so no ablation isolates reliability-adaptive windows from ordinary fixed-window polynomial smoothing. The harder-setting failures, e.g. Chaffee–Infante at (5%, 25%, 50%) with F1 = 0.67 (Table 10) and λ–ω at (0%, 50%, 50%) with F1 = 0.68 (Table 12), are not discussed.
Questions for authors
- (Clarification) On which data is the reconstruction error used to retain the H checkpoints computed, and do clean validation targets influence any selection step? How were the shared hyperparameters and the baseline settings chosen? Please report variability over independent runs and correct the entries in Tables 10 and 16.
- (Clarification) How do reliability-adaptive windows compare with fixed-window projection under otherwise identical settings? What causes the harder-setting failures above, and is there evidence of robustness beyond two-level Gaussian noise? Is the adaptive Cauchy scale detached during optimization, as the gradient analysis in Appendix C assumes?
Response to Authors
Thank you for the detailed responses and additional experiments, which have addressed all of my concerns regarding the evaluation protocol, multi-seed variability, ablations and implementation details. I am raising Soundness from 2 to 3 and my overall rating from 2 to 3.