- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper proposes BLADE-PDE, a two-stage framework for discovering PDEs from noisy data. It uses an implicit neural network with blended activations and SIREN-like initialization for denoising, followed by LLM-based equation discovery guided by mathematical tools and handbook information. Experiments on MDBench show improved equation recovery on both clean and noisy data. The authors also provide ablation studies and an additional experiment to evaluate the discovery of a modified PDE.
Critical strengths
The paper addresses the practical challenge of discovering PDEs from noisy data. The method recovers all six equations at 20 dB noise, while the evaluated baselines fail, demonstrating strong empirical performance.
Critical weaknesses
- My main concern is that the methodological novelty is not sufficiently established. Previous work has already explored blended activations for PDE modeling (Wang et al., 2023), neural network-based field fitting and derivative estimation for PDE discovery from noisy data (Both et al., 2021), equation discovery guided by mathematical handbooks (Xu et al., 2025), and LLM-assisted PDE discovery with external feedback (Luo et al., 2025).
Although BLADE-PDE introduces a specific SIREN-like initialization and combines these techniques into a unified framework, I believe the authors should more clearly explain the additional technical contributions over these existing methods.
Relevant references (including some already cited in the manuscript):
- Wang et al. (2023): https://doi.org/10.4208/cicp.OA-2023-0058
- Both et al. (2021): https://doi.org/10.1016/j.jcp.2020.109985
- Xu et al. (2025): https://doi.org/10.1038/s41467-025-65114-2
- Luo et al. (2025): https://aclanthology.org/2025.findings-emnlp.145/
-
Although the authors provide component ablations, several important comparisons are missing. For example, how would existing PDE discovery methods perform using the same denoised data? Is the LLM necessary when the same mathematical information and candidate library are available? Without these comparisons, it is difficult to determine whether the improvements mainly come from better denoising or the proposed LLM-based discovery mechanism.
-
I believe the experiment in Section 4.3 contains a fundamental mathematical issue. The proposed equation is essentially a KdV equation with an additional linear advection term. By introducing a moving coordinate system, , followed by simple rescaling, the equation can be transformed into the standard KdV equation. Therefore, this experiment does not demonstrate the discovery of a PDE outside known equation families, as claimed by the authors. This significantly weakens the paper's claim regarding the discovery of previously unknown PDE structures.
Questions for authors
Please refer to the Critical Weaknesses section.
7 comments
The detailed answers are as follows.
1. We agree that each ingredient has a precedent, and the revised paper states the relation to these four works more clearly (Table 13). ABU-PINN (Wang et al., 2023) blends activations to solve a known PDE with a physics-informed loss. Our denoiser fits a noisy field whose equation is unknown, with no physics term, and its purpose is derivatives up to fourth order; the technical additions are an affine transform on every basis of the blend, with a trainable scale and shift, and the SIREN-like (Sitzmann et al., 2020) compensation on the sine basis alone. The contribution of this initialisation is measured: at 20 dB the mean derivative error is 0.08, against 0.13 with SIREN initialisation on every basis, 0.10 without the compensation and 0.25 for a sine-only SIREN (Table 7). Denoising for PDE discovery is a challenging problem in its own right, because the regression target and most candidate terms are derivatives of the observed field, and differentiation amplifies the noise. DeepMoD (Both et al., 2021) is the classic method: it fits the network together with a sparse regression on a fixed library. Much research since then has aimed at discovery from noisy data, for example PDE-LEARN (Stephany and Earls, 2024), DISCOVER (Du et al., 2024) and EqGPT (Xu et al., 2025). Yet none of the methods we tested handles the strong noise of MDBench, in particular for PDEs with high-order derivatives. We have also run the PINN-based method PDE-LEARN to compare the derivatives: those of its network are less accurate than ours on every system (Table 6), which we attribute to its physics-informed loss, since a network fitted together with the equation being discovered receives wrong physics information when that equation is wrong. Our denoiser uses neither a library nor an equation, so it is a preprocessor that also serves other estimators (Table 5). On the discovery side, EqGPT trains a dedicated generative model on 221 handbook equations and composes equations from a vocabulary of 56 tokens. BLADE-PDE trains no model on equations: a general LLM reads the handbook as a list of terms with every non-polynomial function left open as , together with math tools computed on the data, and it can write a term that is in no vocabulary, such as . LLM4PD (Luo et al., 2025) lets the LLM select terms from a library of seven candidates given raw observation points, and the LLM also proposes the coefficients, which are scored with a PDE solver. BLADE-PDE does none of these: the LLM is not limited to a library, is not given raw data points and does not set the coefficients, and no PDE solver is needed. Instead, the LLM proposes free-form terms, its feedback is math tools computed on the denoised derivatives (correlations, coefficient profiles, fit gains, residual checks and weak-form scores), and the coefficients are a least-squares refit.
2. Both comparisons are now run. For existing discovery methods on the same denoised data: given our denoised field and derivatives, PDE-FIND and PySR each rise from 0/6 to 3/6 at 20 dB and stay there at 30 and 40 dB, against 6/6 for BLADE-PDE (Table 5), so the denoiser transfers to other estimators and the remaining gap belongs to the discovery stage. For the necessity of the LLM: to test whether a script can replace the LLM, we designed scripts that have everything the LLM gets: the same guide and handbook terms as candidates, with open functions filled from a fixed menu that includes , and the same math tools, refit and grading. We tested sequential thresholded least squares (Brunton et al., 2016), as in PDE-FIND, and greedy forward–backward selection, each at six thresholds and on two candidate pools (Table 8). The best single setting recovers 23/35 against 33/35 for the LLM stage; no setting recovers all six PDEs of a noisy level, and none recovers the new PDE. With the handbook pool the greedy script does recover the other three open-form equations, whose functions are on its menu, but it then loses most of the clean benchmark. The LLM matters for two reasons. First, the prompt holds many kinds of information, from field statistics and term correlations to coefficient profiles, fit gains, residual checks and weak-form scores, and a hand-crafted script can hardly judge on all of it. Second, the knowledge of the LLM makes the discovery free-form: the new PDE adds an term to a KdV-type equation, no exponential function is mentioned in the prompt, and the LLM still finds it. Moreover, even without the math tools and the handbook the LLM still recovers all six benchmark PDEs at 20 dB (Table 10). The example run in our repository shows how the term is found (new PDE, clean data, seed 1, with the complete prompts, reasoning and replies). The handbook offers only the open form , and the math tools show how the coefficient of each base symbol varies with . In round one the LLM reads that the part of that depends on alone is not constant, tries a straight line and a quadratic in , and then finds that this part divided by is constant, between −1.52 and −1.49 across the bins, so it proposes as a single term in place of a polynomial of three; from the same curves it reads (the coefficient of is linear in with slope −4) and (a flat coefficient). In round two the math tools confirm the proposal: replacing by a constant, , or lowers from 0.994 to between 0.72 and 0.85, and no further term adds more than 0.002. The refit gives .
3. We agree that the tweaked KdV equation of the submission stays within the KdV family: its transport term is removed by a moving frame and its coefficients by rescaling. Our reason for the original experiment was the following. When a PDE is solved, such a transformation yields the solution easily from that of the KdV equation. In PDE discovery, however, the equation is not known, and discovery methods, whether library-based or search-based, do not consider coordinate transformations: searching for a transformation together with a KdV equation is even harder than searching for a KdV equation with an additional term. We were therefore not sensitive enough to the transformation. The claim is revised, and that example is replaced by four open-form equations that are in no handbook and no benchmark (Table 10): the new PDE , whose exponential term is not a transport term and is not removed by a change of coordinates, and three equations with the terms , and . The structure beyond a familiar family is the non-polynomial function itself: the handbook leaves every such function open as , no exponential function is mentioned in the prompt, and the LLM still finds . At 20 dB the full prompt recovers 3/4 of these equations, against 1/4 without the handbook and none without the math tools; the equation with the rational diffusion coefficient (D) is not recovered. On clean data the new PDE is recovered on all three seeds, while the no-LLM scripts never recover it, although is on their menu (Table 8).
We thank the reviewer again for the time and the constructive comments.
Dear Reviewer,
We thank the reviewer for the careful reading and the three concerns, which we answer below, with new experiments where they were needed. In short, BLADE-PDE is library-free: the library is only a guide, and the LLM does free-form discovery, so that it even recovers a PDE with an exponential term eu in the revised new PDE experiment, a term that is not mentioned anywhere in the prompt. This separates it from the four works the reviewer lists: there the blended activation solves a known PDE, while here it denoises a field whose equation is unknown, with an initialisation whose contribution we measure; our denoiser is tied to no library and improves other estimators; and the LLM is neither restricted to a library or a trained vocabulary nor fed raw data points. The missing comparisons are now run: given our denoised field and derivatives, PDE-FIND (Rudy et al., 2017) and PySR (Cranmer, 2023) each rise from 0/6 PDEs on the raw field to 3/6 (8/18) at 20 dB, against 6/6 (18/18) for BLADE-PDE, and a no-LLM search given the same candidates and math tools recovers less at every noise level from 10 to 40 dB and never the exponential PDE. We agree that the tweaked KdV equation of the submission stays within the KdV family, and the revised experiment replaces it. The revised method enables the LLM to recover all six MDBench PDEs (Ziaei Bideh et al., 2026) at 20 dB even with neither the handbook nor the math tools. We therefore extend the evaluation with open-form PDEs that are in no handbook and no benchmark, and on these the full prompt recovers 3/4 at 20 dB while the prompts without the handbook or without the math tools perform worse.
All numbers come from the revised pipeline. The paper is being updated accordingly, and the tables cited below are in Appendix J of the revised paper. The code of the revised pipeline is in our anonymous repository, https://anonymous.4open.science/r/BLADE-PDE-5D37/, with the complete prompts, reasoning and replies of one example run. The discovery stage no longer receives equation skeletons or a property card; the handbook is a shuffled list of terms with every non-polynomial function left open as f(⋅); the LLM has no tools and at most three rounds; and the reported equation is a least-squares refit on the terms it chose. The settings of the denoiser and of the discovery stage are in Table 12. Multi-seed counts are written as PDEs (seeds), for example 6/6 (17/18): a PDE counts as recovered when at least two of its three seeds are.