- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper proposes repurposing the predicted subspace from a neural operator method as a preconditioner for Krylov subspace methods, particularly GMRES. The paper presents a theoretical motivation for this approach and validates it on a set of parametric PDEs.
Critical strengths
S1: Important problem
Krylov methods are the mainstay of much of large-scale scientific computing, and good preconditioning is key to their efficiency.
S2: Potentially novel approach
I'm not aware of other learned approaches that leverage invariant subspaces for preconditioning.
Critical weaknesses
W1: Clarity
The related work section is terse to the point where it's practically uninformative. Besides, it is hard to understand before having learned about the proposed method.
Key steps and definitions are missing in the background section, which makes it impossible to follow as it stands. For instance:
- in eq. (3) not defined. Not clear how (4) follows from (3).
- In (6), how can you map to ? How can you just choose to work with Chebyshev polynomials and why is the ratio still a polynomial?
- In (7), there is no explanation whatsoever of why you can bound (6) from above as stated.
- In (10), how do get the right-most bound?
- It is not sufficiently explained why "These bounds show that moving eigenvalues away from zero and clustering the positive and negative spectra can accelerate Krylov methods".
Remark 7 would make much more sense directly after defining R at the start of section 4.1.1.
In theorem 4, I don't see how eq. (29) has any bearing on why P would be SPD.
In 5.1, state and motivate the assumption going into the problems under consideration. Since you're using FNO, I suppose you consider PDEs defined on gridded domains. From the supplementary material, I infer that you're only considering system matrices arising from finite difference methods - this type of information is important to state in the main paper.
W2: Unclear novelty and significance
It's not clear whether the theoretical results in section 4.1 are claimed to be novel - it looks like standard matrix/numerical analysis to me - please clarify. In 4.1.1, I don't follow why you're talking about how to choose , despite this seemingly being an important consideration.
Since the analysis builds directly on that from NeurKItt, it is important to distinguish what is, in fact, additional contributions of this work.
W3: Experiments ignore preconditioning time
A critical flaw is that the comparisons in Tables 1 and 2 don't account for the computational cost of obtaining the preconditioner itself. Based on the reported metrics, you could get a perfect performance (convergence in a single iteration) if the "preconditioner" was . Moreover, I suppose you'd expect the GMRES iteration count to gradually converge to 1 as you increase , so the interesting thing to consider is what value of strikes the best balance between preconditioning cost and GMRES iteration cost (not that increasing descreases the GMRES iteration count - that is just a sanity check).
I see that you comment on this at the end of the experiment section, but all details are deferred to the supplementary materials. There, you indeed acknowledge the important limitations with the sentences:
Increasing k reduces the iteration count only up to a point while increasing the costs of inference, orthogonalization, storage, and low-rank application. Our experiments primarily report iteration counts and hence do not yet establish end-to-end wall-clock or memory advantages in all regimes. Frankly, "hiding" this away in the supplementary materials is not scientifically honest.
W4: Missing strong baselines
The lack of strong baselines makes it hard to assess the value of the proposed method. Currently, only classical, general-purpose preconditioners are included, which are not tailored for the problem class. Neither is there any comparison with other learned preconditioners, of which a number has been proposed in the last two years, for instance:
- Chen, "Graph neural preconditioners for iterative solutions of sparse linear systems." ICLR (2025).
- Giraud et al. "Neural network preconditioning: a case study for the solution of the parametric Helmholtz equation." Numerical Linear Algebra with Applications (2026).
- Häusner et al. "Learning incomplete factorization preconditioners for GMRES." Northern Lights Deep Learning Conference (2024).
- Trifonov et al. "Learning from linear algebra: A graph neural network approach to preconditioner design for conjugate gradient solvers." Computational Methods in Applied Mathematics 26.2 (2026).
The recent survey paper by Meng et al. (https://arxiv.org/abs/2610.07211) includes additional pointers, and could potentially also improve the related work section.
Minor:
- The theorem numbering is strange (the first theorem is numbered 2, which is followed by theorem 4).
- There is no section 4.2, hence you could promote subsubsections to subsections.
- Some references refer to arxiv preprints that are in fact published in venues such as ICLR. Please double-check all references thoroughly.
Questions for authors
Q1: Is your question from the introduction, "can the predicted subspace itself define a robust preconditioner?", really new and descriptive of your work? How is it different from how the established literature on numerical analysis approaches the problem, e.g., in the context of deflation and augmentation methods?
Q2: How long does it take to train your models? Is it memory, compute, or time that limits the problem sizes (which are too small for any gains to be practically significant)? Have you considered using a stochastic approximation of the loss in eq. (45) as in Häusner et al. (TMLR, 2024)?
Q3: In section 5, please elaborate on why "The preconditioner in Section 4 requires spectral information that would be too expensive to recompute for every member of a parametric PDE family". What information is too expensive to recompute, more precisely, and why?