- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes a pre-training structural audit of coefficient identifiability for physics-constrained dictionary models with a fixed linear operator (or linear coefficient constraint) and a fixed sampling design. Building on the classical joint null space of the data and physics maps, the audit reports:
- explicit witness directions,
- the number of data-blind directions closed by the physics term (),
- a decomposition of coefficient space into direction classes,
- a test of whether a linear reading is determined.
Tolerance scans, high-precision recomputation and symbolic checks separate exact identities from numerical near-dependencies. On a corpus of dictionaries, the audit finds dependencies missed by pairwise and triple screens and identifies dictionaries whose residual penalty is identically zero. In a pre-registered PySINDy mean-field case, steady-state data leave jointly blind directions along which and vary individually, while stays determined. Equal-budget transient data remove these directions, and an exploratory refit on the transient data, stopped at the iteration limit, recovers all true terms. Further rule-selected studies on official PySINDy and DeePyMoD examples are reported in the appendix.
Critical strengths
- Coefficient-level reporting, demonstrated on a public pipeline. Beyond flagging rank deficiency, the audit states which coefficients or combinations the data determine and which ambiguities the physics constraint resolves, with explicit witnesses. In the mean-field case, the audit predicts before training that is undetermined while is determined on steady-state data (Table 2). The exploratory steady-state refit indeed misestimates badly while recovering accurately (Table 3). This is consequential because it shows that fit quality cannot certify coefficient readings, and that the audit tells practitioners which readings they may report.
- Careful numerical verification. Tolerance sweeps, high-precision spectra and symbolic checks separate exact identities from numerical near-dependencies, and the paper reports that only part of the numerically near-zero directions are exact (Table 6). The cut is fixed in advance, and null outcomes of the pre-registered studies are reported. This is consequential because it makes the reported counts trustworthy and the claims well calibrated.
Critical weaknesses
-
The value added over a direct SVD/GSVD diagnostic is not isolated. The audit's near-null dimensions match a plain stacked SVD on every library in the corpus, and on the libraries with a nonzero near-null space the subspaces themselves coincide (Table 5; App. B.1.3). The direction classes of Table 1 are the block structure of the GSVD of , with and as the zero block. The reported advantages are largely by construction:
- coherence and triple enumeration are support-limited (Prop. 3);
- the zero-penalty dictionaries can be identified atom by atom.
The comparison with condition numbers (Sec. 4.1; App. B.2.1, B.2.3) is qualitative. This is consequential because, apart from the exact-versus-near precision protocol credited above, the audit's verdicts coincide in principle with those of a GSVD-based analysis with coefficient projections at the same cut and normalization. The contribution therefore rests on practical value over such an analysis, and over the diagnostic of Scheipl & Greven (2016), which the paper does not demonstrate.
-
The presentation makes the report hard to use and verify. The paper introduces a number of paper-specific terms (gauge, physics-visible, reading, equation-implied completion) and several overlapping taxonomies (exact classes, numerical bins, report tiers). Main-text claims rest on statements given only in the appendix (Algorithm 1, Prop. 4, Thm. 1). Sec. 4.3 compresses the detector comparison into a few sentences whose quantities are defined only in a table caption. This is consequential because the paper's main selling point is a practitioner-legible report.
Questions for authors
Both are clarification requests.
- (Related to W1.) Apart from the exact-versus-near precision checks, two standard tools appear to yield the same identifiability verdicts in principle: a GSVD-based diagnostic at the same cut and normalization, and a standard estimability test (i.e., checking ). Could the authors clarify the additional practical value of the integrated audit? For instance, on the existing cases (e.g., the mean-field and MHD studies), which steps of the audit would a practitioner using those tools be likely to omit or get wrong, and how would that affect their coefficient interpretation or sampling decision?
- (On the reliability of reading-level verdicts.) In App. B.2.2, for the enlarged steady-state design, the share of the reading falls between the two reading thresholds, so the audit returns no numerical verdict. The reading is instead certified by exact rational elimination on a rational parameterization of the analytically known limit cycle. Is such certification a general, automated part of the audit, or does it require problem-specific symbolic analysis? The answer bears on how reliably reading-level verdicts can be obtained in practice.
Please let me know if I have misunderstood any part of the paper; I am open to revising my assessment.