- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Typed Frame Search, a reference-free framework for identifying interpretable coordinate transformations for PDE solutions. The method searches over a predefined grammar of frame transformations and profile families, fits candidates using PDE residuals and initial/boundary conditions, and selects a canonical representation through validation and complexity regularization. Experiments across multiple synthetic PDE families demonstrate high frame recovery accuracy and improved efficiency over continuous-clock baselines.
Critical strengths
-
Interpretable framework. The method provides explicit and interpretable coordinate transformations without requiring future solution trajectories. The separation between field recovery and canonical frame identification is well motivated.
-
Comprehensive evaluation within the defined setting. The paper evaluates multiple PDE families, includes useful ablation studies, and reports strong in-bank recovery performance. The comparisons with continuous-clock baselines demonstrate the computational benefits of the structured search space.
Critical weaknesses
-
Limited methodological novelty and generalizability. The proposed approach relies on a manually designed grammar of transformations and profile families, combined with standard PDE residual optimization and complexity-based model selection. While effective within this predefined space, the method does not demonstrate the ability to discover transformations outside the grammar. The theoretical results also primarily characterize identifiability and selection within a finite candidate set. This limits the broader novelty and applicability of the approach.
-
Limited evidence of downstream benefits. Although the recovered frames are interpretable, their practical advantages are less convincing. The downstream numerical experiments show improvements mainly at coarse resolutions, while the selected-frame solver becomes less accurate at finer resolutions and remains slower when search costs are included. Furthermore, the benefits over simpler reduced-coordinate representations are not fully established. These observations weaken the practical significance of the proposed framework.
Questions for authors
-
How could the proposed framework handle PDEs whose useful coordinate transformations are not included in the predefined grammar? Could the authors clarify its advantages over classical symbolic similarity reduction methods?
-
Could the authors provide stronger evidence of downstream benefits, particularly for more challenging PDEs where the appropriate coordinate transformation is not straightforward?
-
How sensitive is the method to the design and size of the candidate grammar, and what would be required to extend it to more general transformation families?
3 comments
Thanks for the additional experiments. The same-bank comparisons show a useful efficiency advantage, but my main concern about generalizability remains.
In particular, the new composition cases require manual grammar extension, while continuous fitting already handles them. I would consider raising my rating to 3 if the method could automatically discover new combinations of existing transformation primitives, without manually adding each combination, while remaining competitive with continuous fitting.
I appreciate the improvements, but for now I'll keep my rating at 2.
Official Comment by Authors
Thank you for the precise clarification and for considering the additional evidence. We agree that automatic composition, rather than registering each combined law, is the relevant test. We have implemented and evaluated that capability.
Automatic generation from unchanged primitives.
The extension reuses the eight clock primitives already present in the original eleven programs. A uniform rule inserts unused primitives, composes their field actions and merges commuting arrangements, producing 144 words of depth at most three. Translation–dilation order is retained. An eight-word beam expands using training scores, jointly fits the five profiles and selects using independent validation. No target-specific combination, reference label or future interior field enters fitting (Sec. 3.5, Sec. 6.5, App. G).
For example, ordered composition of dilation and oscillatory translation generates , although that combined clock was never registered. Together with quadratic damping, automatic search recovers the ordered three-primitive program, with field error (App. G.4).
Unseen combinations and competitive continuous controls.
We test all 28 new two-primitive structures absent from the original catalogue, plus 12 triple structures chosen by a fixed grammar-only rule. Each has three coefficient settings and five collocation seeds, yielding 420 and 180 instances. These repetitions are not counted as independent structures. Settings were frozen before compositional evaluation. All methods share public data, profiles, objective and validation. Continuous controls also receive automatic projection and joint refinement over the same generated vocabulary. Complete CPU cost includes every upstream stage.
On pairs, beam and degree-two continuous fitting plus extraction (CC2+S) both recover 420/420 active programs, with median field errors and . Median CPU times are 2.20 and 3.64 seconds. The paired CPU ratio is 0.605, with structure-cluster interval (Table 6 (p. 10), Table 57 (p. 46)).
Triples expose a harder search tradeoff. Beam recovers 168/180 at 6.31 seconds, versus CC2+S's 175/180 at 4.05. The already-defined exhaustive control, extended unchanged to all triples, recovers 179/180 at 10.20 seconds. Continuous fitting of the same primitive basis followed by extraction recovers 180/180 at 15.74. We therefore report the beam and exhaustive policies separately. Both generate combinations automatically, with different recovery and cost. The earlier 45 composition instances and 70 original-family instances are all recovered by beam under the common active-program metric (Table 56 (p. 44)).
Checks and scope.
The appendix includes degree/warm-start controls, depth and penalty ablations, complete outcomes and same-core serial timing checks. Independent coefficient-ODE integration validates all 129 new transport references. The remaining exhaustive miss is retained and diagnosed as a numerical-fit failure on an expressible word. The expanded exhaustive study is identified as coverage extension after primary analysis, with unchanged settings.
These results provide the requested automatic discovery of new combinations within the existing primitive vocabulary and quantify competitiveness against strong continuous controls. They support bounded compositional generalization, with the depth and optimization tradeoff made explicit. Thank you again for the helpful guidance and for taking another look at the revised method and evidence.
Official Comment by Authors
Thank you for recognizing the interpretability and for your constructive comments on novelty, grammar dependence and practical value. They motivated same-bank structure-extraction controls and stronger PDE baselines.
W1: Proposed method, novelty and generalizability.
We propose Typed Frame Search to jointly infer a coordinate-law type and its profile from the PDE and prescribed IC/BC, without future trajectories. Its contribution combines joint frame/profile inference with canonical selection among field-equivalent programs. Translation is equivalent to translation–dilation with zero dilation. IC anchoring and description cost favor a concise law. Removing that cost lowers strict recovery from 96.8% to 68.2% while field equivalence stays 100% (Sec. 6.2, p. 8). The optimizer is standard. Guarantees condition on the fitted bank.
We give continuous fitting the same bank, then apply projection and joint refinement. Typed recovers 69/70 strict labels, versus 70/70 after refinement. Both recover all clocks at RMSE below 0.01. Median complete CPU costs are 3.24 seconds for Typed, 12.38 for fixed degree one plus refinement and 27.46 for degree two plus refinement. This supports lower-cost structure inference with accurate clock recovery (Table 5 (p. 9), Table 45 (p. 38)).
IC splines recover 50/50 unseen-profile frames and 2D affine tests recover 60/60, supporting profile transfer and dimensional extension (Secs. 6.3–6.4, pp. 9–10).
W2: Downstream benefit, refinement and total cost.
An amplitude- and dimension-matched physical-x control isolates coordinate choice. At 128 samples, the paired selected/control error ratio is 0.374, with 95% family-cluster interval [0.105,0.884]. Against validation-selected continuous coordinates it is 0.999, [0.997,1.001], indicating similar downstream precision (Table 46 (p. 38)).
The PDE test fixes IC data at 2572 with independently checked references. At diffusion 0.005 and perturbation 0.03, selected errors decrease through 0.0621, 0.0302, 0.0163 and 0.00856 on grids 332,652,1292,2572 (Table 49 (p. 41)). App. F.3 (pp. 38–39) separately tests IC resolution, remapping and reference discretization.
Costs include search, setup and solve. For pure affine nondiffusive flows at 100-IC reuse, Typed takes 1.055–1.091 times continuous-affine wall time and 2.09–2.17 times coefficient-informed characteristics, with matching errors (Table 53 (p. 42)). The comparisons distinguish structure-inference efficiency from solver performance.
Q1: Unrepresented transformations and symbolic similarity reduction.
An absent law is handled through explicit vocabulary extension. Adding damping with acceleration, damping with oscillation, and acceleration with dilation raises field success from 13/45 to 45/45 and lowers median error from 0.138 to 2.94×10−6 (Table 33 (p. 28)).
Symbolic similarity reduction establishes exact invariance. Our numerical criterion compares coordinate programs for the given IC/BC, including sampled spline profiles. The affine application also ranks approximate frames and evolves their residual dynamics. Our SymPy
pdsolvecalls support 13/28 original configurations, with median error 6.95×10−8 versus 6.87×10−7 for Typed. We report its supported-subset accuracy advantage and all attempts (Table 3 (p. 8)).Q2: More challenging PDEs and stronger application evidence.
The 80-case affine extension retains diffusion and nonaffine residual dynamics after coordinate selection. At ν=0.005, ϵ=0.03 and grid 1292, physical, selected and continuous upwind median errors are 0.0897, 0.0163 and 0.0443, compared with 0.00193 for the semi-Lagrangian control. Across the fixed grid/time menu, a 1% error target is attained by 10/20 selected cases and 20/20 semi-Lagrangian cases. The latter has the better accuracy–cost frontier. These results support motion removal within the shared upwind backend and clarify the solver-dependent downstream benefits (Table 51 (p. 41), Table 52 (p. 42)).
Q3: Grammar sensitivity and extension requirements.
On 70 instances, removing acceleration, oscillation or moving-self-similar programs lowers strict recovery from 98.6% to 91.4%. Adding 8/16 nearby clocks raises candidates from 55 to 95/135, preserves 98.6% recovery and increases median objective calls from 5,465 to 9,037/12,888.5 (Table 32 (p. 28)).
Extension requires differentiable, domain-invertible maps, IC anchoring, bounds, equivalence rules and independent validation. At fixed confidence, score bound and separation, sufficient validation grows logarithmically with bank size. Nearby alternatives may narrow the gap (Sec. 4, pp. 5–6).
Thank you again for your constructive comments. We would appreciate your taking another look at the revised evidence.