- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies scalar energy responses of boundary-driven, two-phase affine elliptic PDEs. It retains a short Lanczos prefix and its terminal coupling, then predicts a compact tridiagonal continuation from instance features. For a given instance, the continuation is independent of the contrast query and can serve multiple response evaluations. A recursive decoder enforces two-phase energy inequalities and applicable known zero-energy endpoint conditions when the required connectivity information is available.
Theorem 1 establishes the existence of such continuations with a uniform relative response error bound over a prescribed finite contrast interval. Proposition 1 and Corollary 1.2 compare analytic error bounds at the same reduced dimension, giving a strictly tighter continuation existence bound when . Experiments cover contrast interpolation and extrapolation on held-out IID geometries, encoder and constraint ablations, and query costs for a separately trained high-resolution model.
Critical strengths
Strength 1: The theoretical guarantee concerns the evaluated response
Theorem 1 in Section 3 and Appendix A construct compact continuations preserving the Lanczos prefix and terminal coupling, with a uniform relative energy-response error bound on a prescribed finite interval. The required continuation dimension is independent of the full discretization dimension. Appendix B also explicitly converts the ordinary Lanczos estimate to a response error, giving the bounds at equal total dimension a common target.
Strength 2: The constraints reflect the two-phase PDE's energy structure
Section 4 and Appendix D incorporate two-phase energy inequalities into the recursive decoder and use known connectivity to impose applicable zero-energy endpoint conditions. The constraints act directly on the predicted matrix. In Table 2, removing the endpoint equalities while retaining the energy inequalities increases the mean relative error at from to , demonstrating the practical role of endpoint information in this extrapolation task.
Strength 3: The experiments connect accuracy gains with query cost
At , Table 1 reports a mean error of for the constrained MLP and for ordinary 28-step Lanczos. Across twenty geometries, Table 3 reports an MLP query time of seconds and response error of . FFT-PCG takes seconds with an error of . The attained errors are comparable, although unequal. Appendix E's timings include instance assembly, numerical iterations, connectivity features, network evaluation, and response reconstruction. They measure initialized query work and exclude offline costs such as training, label generation, and reusable reference-operator setup.
Critical weaknesses
Weakness 1: The conditional network's additional benefit has not been isolated
Section 4 uses instance features to predict seven decoder logits, but Table 2 varies the constraints while training every variant. The decoder in Appendix D.1 still depends on the instance prefix and energy scalars even when the network outputs the same logits for every instance; Appendix D.2 also applies instance-dependent endpoint rules. A control fitting seven shared logits with the same labels and constraints would therefore retain an instance-dependent completed matrix. Neither this control nor the zero-logit continuation is evaluated. Comparing them with the conditional MLP would distinguish the effects of the default construction, fitting shared coordinates, and conditional prediction. The current results establish the complete method's advantage over ordinary Lanczos, while leaving the conditional network's additional contribution unclear.
Weakness 2: The high-resolution efficiency comparison lacks records needed for independent checking
Section 5 states that Table 3 uses a separately trained model, and Appendix E specifies frozen seed-11 weights. The reported 512/128 training and validation split concerns the data. The high-resolution model's dataset size, split, relationship to the twenty timed geometries, and checkpoint-selection procedure are incompletely specified. Appendix E.2 gives a general validation objective without clearly documenting its application to this model.
Solver budgets are calibrated offline and frozen before timing, and timed calls do not access reference answers. What remains needed is the actual iteration budgets, whether calibration is global or per instance, and reference-solver tolerances or accuracy-refinement checks. These records would allow readers to check Table 3's error scale around and its cost comparison.
Minor comments
- Table 1's "MLP free ext." and Table 2's variant with both constraints disabled have means consistent at Table 1's reporting precision, but different standard deviations. They report 18.08 versus 19.10 at , and 234 versus 238.77 at . Please clarify whether the fits and aggregation are the same and align the values if they are.
Questions for authors
- With the same prefixes, scalars, energy constraints, and endpoint rules, what are the test errors of the zero-logit continuation, seven shared decoder logits fitted using the same training labels, and the conditional MLP? How does conditional prediction change the test error relative to fitting shared coordinates?
- Could you specify the high-resolution dataset size, training/validation split, relationship to the timed geometries, and checkpoint-selection rule, together with Table 3's reference-accuracy checks, actual solver budgets, and calibration granularity?
- On the same test instances and queries, how do response error and complete query time change as ordinary Lanczos continues iterating? With the learned model kept frozen, what is the cost of matching its error level, and which tighter accuracy targets can each method meet?
Discussion update
The discussion period is closing and I want to note that I've not received a response from the authors. I want to remark that my concerns remain unanswered, but that I remain open to further discussion. Otherwise, my assessment is unchanged.