- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This manuscript does not propose a specific framework; instead, it investigates what a multigrid preconditioner should learn. The authors split this into three aspects, target, prediction, and cost, and studied all three. However, this paper does not yield anything meaningful that can directly build a better solver. The experimental results show that the proposed "aligned" solver underperforms the default AMG. Thus, it is hard to recommend acceptance.
Critical strengths
- The split of "target/prediction/cost" is interesting.
Critical weaknesses
- The manuscript is poorly organized, hard to follow, and its contributions are unclear. The abstract fails to convey what is proposed by the authors or what conclusion the authors want to draw. The same problem applies to the remainder as well.
- The "target-prediction-cost" model looks insightful but does not yield anything meaningful that can be used to construct a new, better solver end-to-end.
- The 2D rotated anisotropy family used for experiments is too narrow and insufficient to support the claim. A broader evaluation over multiple anisotropy regimes, grid sizes, coefficient contrasts, and base-preconditioner variants is a must to yield persuasive empirical results.
- The learned method does not demonstrate a compelling end-to-end speedup. At line 430, on the Common-hardware suite, default AMG takes 6.82s wall-clock time, and the proposed variants take 7.39s-18.35s. If a neural method, trained with the proposed "aligned" routine, decelerates the MG convergence, why would we bother to use it?
Questions for authors
- Please see "weaknesses" above.
2 comments
A broader evaluation over multiple anisotropy regimes, grid sizes, coefficient contrasts, and base-preconditioner variants is a must to yield persuasive empirical results.
We ran two new studies along these axes. Both narrow our claims.
Anisotropy regimes. We retrained both objectives over all angles (0 to 90 degrees) and anisotropy ratios from 10 to 10^4. Solver-aligned training still beats Rayleigh training, but by about one iteration rather than several, and a second AMG cycle is better than either network (8.33 against 10.65 iterations).
| Wider range (24 operators) | Mean iterations | Mean reduction |
|---|---|---|
| One AMG cycle (no correction) | 12.53 | |
| Rayleigh network | 11.68 | 4.4% |
| Exact Rayleigh space | 11.35 | 5.8% |
| Solver-aligned network | 10.65 | 9.0% |
| Finite solver target (ideal) | 10.26 | 12.7% |
| Two AMG cycles | 8.33 | 33.9% |
Coefficient contrast. We found that the paper's lognormal family, labeled "contrast 10^4", actually has a max/min coefficient ratio of 10^10 to 10^16, because 10^4 is the generator's parameter. The revised paper corrects this. We then ran a new study at moderate contrast (10^2.7 to 10^4). It is negative: solver-aligned training is about one iteration worse than Rayleigh training, and even the ideal target only ties two AMG cycles. Two of the three solver-aligned models ran out of their preset training time, so this study is incomplete, and we report it as such.
| Moderate contrast (24 operators) | Mean iterations |
|---|---|
| One AMG cycle (no correction) | 9.76 |
| Default AMG | 8.92 |
| Solver-aligned network (one pair) | 8.35 |
| Rayleigh network | 7.28 |
| Exact Rayleigh space | 7.14 |
| Finite solver target (ideal) | 6.58 |
| Two AMG cycles | 6.56 |
Grid size. We have not tested learned 2D predictors at other grid sizes. In 3D, the Rayleigh network's gain falls from 21.3% to 6.6% as the grid grows from 48 to 256, which the revised abstract now states.
Base preconditioners. The Rayleigh network is evaluated around four 2D base preconditioners (Table 1), with gains from 4% to 48%. Swapping the training targets between two preconditioners makes both worse on every operator, which supports the main finding that the target must match its base.
3D. With 200 training operators, solver-aligned training leads Rayleigh training by about one iteration on three fresh 3D suites, but the lead is not confirmed on the last, untouched suite.
Soundness: 1: I have significant concerns about the paper's soundness that do not appear easy to address.
We read the soundness concern as the narrow evaluation and the missing speedup. The revised paper now reports the wider evaluation above, including its negative results, and states plainly that the method is not faster than classical solvers. A scorecard table (Table 5) summarizes where each claim holds and where it does not.
Thank you for the review. We agree that the submitted abstract and framing were unclear, and we have uploaded a revised PDF that rewrites the abstract and introduction and adds four studies in Appendix F.
The paper is a controlled study of what a learned coarse space should be trained to predict, not a new solver. Its main finding is that training on the error the deployed preconditioner leaves behind works better than the usual Rayleigh objective: on 24 held-out 2D operators the mean iteration reduction rises from 17.6% to 31.7%, beating even the exact Rayleigh optimum (18.8%). The network predicts this target only inside its training range, and classical solvers remain faster. The revised abstract now states these three conclusions, including the negative ones, and ends with "This is a diagnostic study, not a faster solver."
To clarify the table: 6.82 s and 7.39 s are two BoomerAMG settings, 18.35 s is the base Evolution AMG without correction, and 17.85 s is the same base with our correction. You are right that the corrected solver is about 2.6 times slower than BoomerAMG, and we do not claim otherwise.
As a solver replacement, you should not. The correction does reduce iterations of its own base (28.4 to 19.5), but it is not faster than BoomerAMG and only marginally faster than its base at many right-hand sides. The value of the paper is the evaluation lesson: the training target must match the deployed preconditioner, and a learned correction must be compared against an extra cycle, simple lookup, flops and total time. Section 5 turns this into a checklist for future learned solvers.
We agree that it does not produce a faster solver, and we no longer frame it as one.