- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The manuscript proposes RINS, which is a family of neural Subspace solvers. The paper is motivated by the high cost of graph-attention-based generation of correction directions. The proposed residual-image viewpoint argues that a correction subspace is useful when its image under the system operator captures the current residual. The proposed Gate-RNIS module constructs shared polynomial residual probes using Chebyshev recurrences and SpMVs. A hybrid inference setup adopts a graph-based G-RANS controller for the first correction block and Gate-RINS for the remainder. Evaluations on six linear PDEs report that Gate-RINS reaches a relative residual of 1e-5 with reported mean wall-clock speedups of 1.6-2.3x over G-RANS and 2.2-3.0x over GMRES.
Critical strengths
- The residual-image viewpoint is insightful.
- The authors conducted a theoretical interpretation.
- The reported speedup is significant and includes details such as a convergence plot, residual, e2e wall clock time, etc.
Critical weaknesses
- Somewhat limited benchmark. All six PDEs have approximately 1k unknowns.
- Theoretical analysis terminates midway. The GMRES-emulation theorem does establish the existence of a continuous neural generator, but it does not guarantee that Gate-RINS can represent that neural generator or that the training procedure can converge to it. Although this is empirically verified by the experimental results, more theoretical reasoning would be appreciated.
- The main benchmark compares Gate-RINS against GMRES and G-RANS without an external preconditioner. However, such legacy numerical routines are typically fine-tuned, especially when the type of PDE is known.
Questions for authors
- Please see "weaknesses" above.
3 comments
response to reviewer hExC (part 2)
Q3: 【Weakness 3】The main comparisons do not use external preconditioners, but practical numerical solvers are usually extensively tuned for known PDE types.
A3: Thank you for your suggestion. We added preconditioned baselines for approximately 1k two-dimensional low-wavenumber (), two-dimensional high-wavenumber (), and three-dimensional low-wavenumber () indefinite Helmholtz, with both numerical and neural methods running on GPUs. The following reports the mean full solve time ± inter-system standard deviation, with the number of successful systems in parentheses.
| Method | Two-dimensional low-wavenumber (): time (s) | Two-dimensional high-wavenumber (): time (s) | Three-dimensional low-wavenumber (): time (s) |
|---|---|---|---|
| FGMRES + Jacobi | 8.4673 ± 3.3170 (10/10) | 45.9039 ± 17.7388 (10/10) | 4.8896 ± 2.9109 (10/10) |
| FGMRES + AMG | 0.6991 ± 0.4427 (10/10) | 25.9626 ± 11.3193 (9/10) | 2.3241 ± 1.1246 (8/10) |
| GRANS | 1.1303 ± 0.1260 (10/10) | 1.1518 ± 0.1067 (10/10) | 0.6770 ± 0.1369 (10/10) |
| Gate-RINS | 0.4127 ± 0.0732 (10/10) | 0.6549 ± 0.0708 (10/10) | 0.1836 ± 0.0093 (10/10) |
The relative residual threshold is ; the numerical baselines use a restart/maximum iteration count of 4000, and the neural models use 20 directions per round, at most 200 rounds, and 4000 basis vectors. Jacobi uses inverse diagonal scaling, and AMG uses the PyAMG classical Ruge–Stuben hierarchy and a GPU V-cycle. At two-dimensional low-wavenumber (), Gate-RINS achieves a 1.69× speedup over AMG-FGMRES and a 2.74× speedup over GRANS; AMG has failed systems in the high-wavenumber () and three-dimensional cases, and the table retains its success proportions. These same-GPU comparisons show lower mean solve times for Gate-RINS on the tested approximately 1k indefinite Helmholtz systems.
Q4: 【Question 1】Please see the weaknesses above.
A4: Please see the responses to Q1–Q3.
Thank you again for your time and careful consideration, and for the constructive suggestions that help us improve the presentation of the method and the experimental comparisons.
Thank you for the response. I am keeping my original score of weak acceptance.
response to reviewer hExC (part 1)
Thank you for your in-depth review and constructive feedback.
Thank you for recognizing the residual-image perspective, theoretical interpretation, and details of the convergence curves and end-to-end timings. Below, we respond separately to the comments on experimental scope, theoretical analysis, and comparisons with preconditioned baselines.
Q1: 【Weakness 1】All six PDE benchmarks have only approximately 1k unknowns, so the experimental scope is limited.
A1: We added low-wavenumber (k0=8) and high-wavenumber (k0=24) experiments on 10k two-dimensional indefinite Helmholtz, with 10 test systems per task. The table below reports the mean full solve time ± inter-system standard deviation over successful systems.
The target is a true relative residual of 10−5; Gate-RINS uses 500 rounds, 20 directions per round, and 4000 basis vectors, while the numerical baselines use a restart/maximum iteration count of 4000. At low-wavenumber (k0=8), Gate-RINS achieves a 5.84× speedup over Jacobi-FGMRES and a higher success rate than GRANS, but remains slower than AMG; at high-wavenumber (k0=24), neither neural method reaches the threshold. The standard deviations in the table reflect differences among the 10 test systems.
Q2: 【Weakness 2】The GMRES emulation theorem only proves the existence of a continuous generator, guaranteeing neither that Gate-RINS can represent this generator nor that the training process can converge to it; despite the empirical validation provided by the experiments, more theoretical reasoning is still desired.
A2: We evaluated the Gate-RINS architecture through independent training and held-out solve experiments: each of the original six approximately 1k tasks uses five training seeds and 10 fixed test systems, and the actual trained Gate-RINS reaches a true relative residual of 10−5 in all 50 records for each task, with mean solve times of 0.0717–0.1350 seconds. The five-seed experiments on three approximately 1k indefinite Helmholtz tasks also reach the threshold in 50/50 cases each, with mean full solve times of 0.4383, 0.6610, and 0.1813 seconds for two-dimensional low-wavenumber (k0=8), two-dimensional high-wavenumber (k0=24), and three-dimensional low-wavenumber (k0=8), respectively.
Furthermore, we conducted five-seed experiments on Poisson under three scale and geometry transfer settings, freezing the models after source-domain training and solving directly in the target domain. The table below gives the wall-clock time to first reach a true relative residual of 10−5 on the prespecified targets, reporting the mean ± seed × sample joint standard deviation; grid transfer tests 10 systems per seed, geometry transfer tests 20 systems per seed, and three timings are first averaged in each cell.