PaperlayerView exact revision on arXiv

Source-linked AI summary

Learned smoothing in operator-adapted multigrid: controlled accuracy gains and computational limits

Kumar Kaushik Ranjan

arXiv:2610.30692v1math.NAcs.NA

TL;DR

Learned multigrid evaluations at a fixed iteration budget do not distinguish local approximation gains from full-cycle accuracy and practical solver efficiency. The paper tests learned smoothing in an operator-adapted V-cycle with computed transfers and coarse structure, finding gains over a fixed classical smoother on fresh problems but no computational advantage over the tested classical solvers.

  • Problem

    Fixed-budget evaluations of learned multigrid components do not distinguish local approximation gains from full-cycle accuracy and practical solver efficiency.

    Source: §1 · p. 2

  • Method

    The paper learns only the smoothers in an operator-adapted V-cycle whose transfers, coarse operators, coarsest solve, and deflation vectors are computed from each operator.

    Source: §1 · p. 2

  • Results

    About six times more accurate on conductive channels and about 1.4 times on insulating barriers: one learned pass versus four-step Jacobi-PCG smoothing in the same cycle.

    Source: §8 · p. 29

  • Takeaways & Limitations

    The local fixed-input Krylov comparison, full-cycle accuracy at larger classical budgets, and complete cost are distinct evaluation questions in this construction.

    Source: §7 · pp. 28–29

    The fixed-input Krylov-space result is a local diagnostic, not a theorem about all operators or complete cycles, and does not show that nonlinearity is necessary.

    Source: §5.2 · p. 18

Abstract

from arXiv · show

Learned multigrid components are often evaluated at a fixed iteration budget, but such comparisons do not distinguish local approximation gains from practical solver efficiency. We study this distinction for high-contrast elliptic problems on unstructured finite element meshes. A learned V-cycle uses operator-dependent transfers, Galerkin coarse operators, near-kernel deflation and an energy-norm safeguard; only its smoothers are trained. The architecture represents a specified class of fixed polynomial smoothers and is positively homogeneous in the load. On fresh conductive-channel problems, one learned pass reduces the energy error by factors of 5.7-6.1 relative to the same cycle with four-step Jacobi-preconditioned conjugate-gradient smoothing; the corresponding factors are 1.38-1.45 for insulating barriers. In a separate fixed-input test on channel problems, the fine-level learned smoother attains a smaller energy-norm error than the exact minimum over a five-dimensional Krylov space of its own input on 97-100 of 100 fresh inputs for each position and training initialization; this does not establish superiority over all polynomial-smoothed cycles. When the classical smoothing budget is increased, the paired geometric-mean accuracy crosses that of the learned cycle between 8 and 14 steps per smoothing call on channels and between 5 and 8 on barriers. The measured CPU implementation offers no computational advantage over the tested classical solvers, and load changes and floating islands further restrict its accuracy.

1. Introduction

The paper asks whether learned smoothing improves one pass through an operator-adapted multigrid cycle, and whether local accuracy gains survive stronger classical controls and practical cost comparisons. It finds substantial gains over a fixed classical smoother on channels, but those gains depend on the problem family and smoothing budget and do not translate into a computational advantage.

1. Introduction

  • The study separates fixed-smoother accuracy, performance against a specified local Krylov-space minimum, and performance when classical smoothing receives more work.The authors note that the answers can differ and that a comparison against only one fixed classical configuration can be undone by a stronger control.Source: §1 · p. 2
  • OA-VCB keeps operator-dependent transfers, Galerkin coarse operators, exact coarsest solution, and near-kernel deflation, while learning only the smoothers.Its output combines cycle directions and near-kernel vectors energy-optimally; the hierarchy, deflation, and Ritz step are classical in origin.Source: §1 · pp. 2–3
  • On conductive-channel problems, the learned pass is 5.7–6.1 times more accurate than a four-step Jacobi-PCG smoother in the same cycle.Source: §1 · p. 3
  • For a fixed input on channel problems, the learned smoother beats the exact five-dimensional Krylov-space minimum on 97–100 of 100 fresh inputs.This local comparison does not establish superiority over all polynomial-smoothed cycles.Source: §1 · p. 3
  • Classical-cycle accuracy crosses the learned cycle between 8 and 14 Jacobi-PCG steps per call on channels and between 5 and 8 on barriers.Fourteen steps are more accurate on both families; load changes and floating islands further restrict the learned cycle’s gain.Source: §1 · p. 3
  • The study reports cost, load dependence, and barrier failure cases to bound the observed gains, and makes no claim of a practical solver.Experiments focus on two-dimensional P1 elements, two coefficient families, one family of perforated domains, and the specified architecture; no convergence or approximation theory for the learned smoothers is given.Source: §1 · pp. 3–4

2. Related work

Prior work has learned components within multilevel solvers, built robust coarse spaces for high-contrast problems, and studied classical smoothing controls. This paper’s distinction is a fixed operator-adapted cycle with computed transfers and controlled evaluation of learned smoothing.

Learned multigrid

  • Learned prolongations, transfer operators, smoothers, and graph-network multilevel preconditioners are established approaches, commonly evaluated as iterated solvers or preconditioners.Here, transfers are computed rather than learned, enabling comparison of learned and classical smoothers within the same fixed architecture.Source: §2 · p. 4

Operator-adapted multiresolution and high-contrast coarse spaces

  • Operator-adapted wavelets and gamblets provide multilevel decompositions, while high-contrast coarse spaces use spectral or problem-adapted functions to resolve conductive structures.This work computes the hierarchy per sample and applies learning to the residuals that remain.Source: §2 · p. 4

Classical smoothers and evaluation of learned PDE solvers

  • Classical controls include polynomial smoothers, Krylov smoothing calls, and local Krylov-space minima; evaluation literature also motivates strong baselines and cost-aware measures.The paper’s contribution is to separate local numerical comparisons, full-cycle accuracy at larger classical budgets, and complete cost in one hybrid multilevel setting.Source: §2 · p. 5

3. An operator-adapted learned V-cycle

The paper constructs an operator-adapted learned V-cycle in which only the smoothers are learned, then establishes representation, homogeneity, and energy-safeguard properties with explicit qualifications. Its hierarchy, coarse solve, and deflation are computed from each operator.

3.1. Setting

  • The problem uses nested P1 finite-element spaces for a symmetric positive-definite, high-contrast elliptic operator, and the learned map returns a correction to the coarse solution.The main tests use isotropic coefficients with conductive channels or insulating barriers; tensor coefficients and plane-strain elasticity are supplementary checks.Source: §3.1 · p. 5

3.2. Transfers computed from the operator

  • Operator-dependent transfers approximate ideal Schur-complement interpolation with four weighted-Jacobi steps, and coarse operators are Galerkin products.The transfer hierarchy is computed per sample from its operator; increasing the Jacobi steps approaches ideal interpolation only when the iteration converges.Source: §3.2 · p. 6

3.3. The learned cycle

  • One shared pre-smoother and one shared post-smoother are learned across levels, with the input scaled by its global RMS magnitude before the network output is rescaled.The specified network uses four stages and 20,672 parameters; its global input scale means a node’s output can depend on residual entries beyond any fixed neighborhood.Source: §3.3 · p. 7

3.4. Near-kernel deflation and the Galerkin output

  • Near-kernel deflation detects low-energy indicators of unanchored strong-connection components, then combines deflation and cycle directions through an energy-minimizing Galerkin output.The detector is a scalar-diffusion heuristic whose coupling and row-sum assumptions are not guaranteed on general unstructured meshes; a low Rayleigh quotient does not ensure every important low-energy direction is found.Source: §3.4 · pp. 7–8

3.5. Structural properties

  • The learned smoother represents fixed polynomial smoothers with shared coefficients across levels, and positive homogeneity holds for positive rescalings of the load.Representation does not imply contraction or optimality, and does not cover adaptive Krylov or Chebyshev schedules. The Ritz/Galerkin output is never worse in energy than the coarse solution or deflation alone in exact arithmetic; implementation regularization preserves non-increase only up to rounding.Source: §3.5 · pp. 8–10

4. Controls and experimental design

The experiments compare learned smoothing with classical controls on high-contrast problems using operator-adapted finite-element hierarchies. The design separates confirmation evidence, paired accuracy metrics, cycle-level comparators, and CPU cost measurements.

4.1. Problems and data

  • The main tests use channel and barrier coefficient fields on a perforated unit square, with 3,486 unknowns and energy-norm algebraic error as the primary accuracy measure.Channels have conductive bands with a = 10^4; barriers have insulating bands with a = 10^-4 and may enclose floating islands.Source: §4.1 · p. 11

4.2. Evidence sets and their status

  • Stage 1 confirmation used 100 operators per family after a fixed protocol, while reserve operators tested pre-specified comparisons and stored checkpoints without retraining.Three initialisations evaluated on the same 100 operators are not 300 independent operators; bootstrap intervals are conditional on trained models and reflect test-operator variability.Source: §4.2 · pp. 12–13

4.3. Metrics

  • Comparisons are paired by operator, reporting the geometric-mean energy-error ratio and the fraction of operators on which the candidate is more accurate.Intervals are 95% percentile bootstrap intervals over operators.Source: §4.3 · p. 13

4.4. Comparators

  • Cycle controls retain OA-VCB’s transfers, Galerkin levels, coarse solution, deflation, coarsest solve, and output, replacing only smoothers unless identified as whole-system solvers.Controls include Chebyshev, Jacobi-PCG and SGS-PCG calls, fitted fixed and per-instance polynomials, plus whole-system PCG, AMG-preconditioned CG, and direct solve comparators.Source: §4.4 · pp. 13–15
  • The local Krylov diagnostic fixes one smoother-call input, so its result does not bound complete-cycle performance when earlier smoothing changes later inputs.K5 is a degree control, not an equal-information or equal-cost comparison; leaving a scalar polynomial space alone does not establish that nonlinearity is necessary.Source: §4.4 · p. 14

4.5. Cost measurement and disclosure

  • CPU costs were measured separately on the original and Stage 1 platforms, with Python implementations and learned single-precision smoothing inside double-precision deflation and output.Classical cycles used double precision, and no precision ablation was run.Source: §4.5 · p. 15

5. Results: local gains, full-cycle accuracy and cost

The learned cycle improves one-pass accuracy over the tested four-step Jacobi-PCG control, especially on channels, and its fixed-input smoother can beat a K5 minimum without establishing full-cycle or broader polynomial-space superiority. More classical smoothing work closes the full-cycle gap, while the measured CPU implementation offers no computational advantage.

5.1. Full-cycle accuracy against stronger one-pass controls

  • 5.70, 5.94, and 6.12 times more accurate on channels, OA-VCB also reaches 1.45, 1.42, and 1.38 times on barriers versus the same cycle with Jacobi-PCG(4).These are the three initialization results on the confirmation set; Table 1 defines the paired geometric-mean comparison and favors OA-VCB when G > 1.Source: §5.1 · pp. 15, 17, Table 1 · p. 16
  • Against SGS-PCG(4), the ordering reverses on barriers (G = 0.55–0.58), while the fitted polynomial candidate is more accurate than OA-VCB on barriers (G = 0.75 [0.68, 0.83]).The fitted candidate is an upper bound on the best class member's error, not a certified optimum; a winning feasible candidate refutes superiority over that class on those instances.Source: §5.1 · p. 17

5.2. A local diagnostic

  • Against fixed-input K5, the fine-level smoother beats the minimum on 97–100 of 100 fresh reserve channel inputs across positions and initializations; against K8, median ratios reverse.This is a local diagnostic, not a claim about complete cycles or dominance over a larger local space.Source: §5.2 · pp. 17–18

5.3. Larger classical budgets in the complete cycle

  • With 14 Jacobi-PCG steps per smoothing call, the classical cycle is more accurate on both families; the paired-accuracy crossover is bracketed at 8–14 steps on channels and 5–8 on barriers.The brackets concern paired geometric-mean error over operators, not every operator or an exact crossover step count.Source: Table 3 · p. 19, §5.3 · pp. 19–20

5.4. Complete cost

  • Despite its accuracy gains, OA-VCB takes a median 284 ms on channels and 282 ms on barriers per pass, versus 66–72 ms for a classical one-pass cycle.Two-grid PCG reaches OA-VCB's per-operator error in median 4.3 ms on channels and 4.0 ms on barriers given uc; these are oracle stopping times.Source: §5.4 · pp. 21, 23, Table 4 · p. 22

6. Limits of the gains, design ablations and scope

The gains are conditional: floating islands and off-training loads weaken accuracy, ablations locate contributions without establishing causation, and scope checks leave broader validation unresolved.

6.1. Floating islands

  • On island samples, mean energy error is 13–26 times larger and OA-VCB loses to the reference on 13–33% of them.Without islands, its paired margin is G = 2.2–2.7; on islands, the margin falls to G = 1.3–1.9.Source: §6.1 · p. 24

6.2. Dependence on the load

  • For off-training loads, the fixed-load network is less accurate than Jacobi-PCG(4) at G = 0.23 [0.19, 0.26], while distributional training still loses to SGS-PCG(4) at 0.54 [0.49, 0.59].The energy safeguard prevents damage relative to uc but does not promise accuracy; distributional training supports broader forcing coverage, not arbitrary loads.Source: §6.2 · pp. 25–26, Table 6 · p. 25

6.3. Design ablations

  • Geometric prolongation makes the learned cycle 1.9 times less accurate on channels and 4.1 times less accurate on barriers; ablations are not causal decompositions.On barriers, indicator deflation improves paired accuracy by G = 2.14 with plain output and 1.85 with Galerkin output; residual-linear controls gain on channels but add further nonlinear-smoother gains.Source: §6.3 · pp. 26–27

6.4. Scope checks

  • At L5 and L6, the unchanged L4-trained model retains margins of G = 8.12 [7.50, 8.67] and 4.18 [3.43, 4.88], respectively, but neither establishes mesh independence.The anisotropic tensor tests show gains over the degree-four Chebyshev cycle, but stronger controls and local Krylov diagnostics were not evaluated for that family.Source: §6.4 · p. 27

7. Discussion

The discussion separates local smoother performance from full-cycle and solver efficiency. Its conclusions remain bounded by the tested controls, loads, floating islands, hierarchy, and experimental scope.

What the controls show

  • A fixed-input win over K5 is narrower than a cycle comparison: K8 is about as good or better, and the result does not establish smoother optimality.The classical comparators share the learned cycle’s non-learned components, isolating what four learned update stages add against the tested smoothers.Source: §7 · p. 28

Why local gains do not make a solver

  • Eight Jacobi-PCG steps per call overtake OA-VCB on barriers and fourteen on both families, with less counted arithmetic; matched-accuracy timings favor classical solvers.Inference alone exceeded a complete two-grid PCG solve including setup; reuse, batched GPU execution, and optimized implementations were not measured.Source: §7 · p. 28

Loads, islands and complexity

  • One-load training does not transfer its advantage to other loads, distributional training remains vulnerable to SGS-PCG(4), and floating islands retain substantial error after indicator deflation.The tested sequential harmonic enrichment removes only a modest part of the remaining island error.Source: §7 · p. 28
  • Hierarchy operator complexity is 4.5 for three levels and 8.6 for four, a measured limitation for deeper hierarchies or three dimensions.Truncated prolongations and richer coarse spaces were not tested.Source: §7 · p. 29

What the study offers

  • The study contributes shared-component classical controls, a fixed-input Krylov diagnostic, accuracy-crossing budgets, separately reported adverse cases, and records and scripts for re-examination.The experiments are limited to two-dimensional P1 elements and Python timings on one CPU; Stage 1 reuses stored checkpoints and does not evaluate anisotropy or elasticity against stronger controls.Source: §7 · p. 29

8. Conclusion

The paper measures learned smoothing’s contribution to one pass through an operator-adapted multigrid cycle, finding accuracy gains over specified controls. Those gains do not establish a practical solver advantage in the tested implementation.

  • Against four-step Jacobi-PCG smoothing, one learned pass is about six times more accurate on channels and about 1.4 times on barriers.For fixed inputs, the learned smoother improves on the degree-matched Krylov-space energy minimum on nearly all channel inputs.Source: §8 · p. 29
  • A fourteen-step Jacobi-PCG cycle is more accurate on both families, and the implementation is slower than converged classical solvers at matched accuracy.The advantage also depends on training load, while floating islands retain substantial error; total cost to tolerance remains open.Source: §8 · p. 30

CRediT authorship contribution statement

Kumar Kaushik Ranjan is credited with contributions spanning research, software, analysis, data, and writing.

Funding

The authors report that this research received no specific grant from public, commercial, or not-for-profit funding agencies.

  • The research received no specific grant from funding agencies in the public, commercial, or not-for-profit sectors.Source: Funding · p. 30

Declaration of generative AI and AI-assisted technologies in the manuscript preparation process

The author used Claude and ChatGPT for specified research and manuscript tasks, then reviewed and edited the content and accepted responsibility for the published article.

Code and data availability

The source code, protocols, records, checkpoints, and figure and table regeneration scripts are publicly available, with licensing and an archived release specified.

Appendix A. Contained classical cycles, implementation details and numerical checks

Appendix A reports comparisons with classical cycles contained in the architecture and checks implementation safeguards and kernel reproduction; Appendix B gives supporting constructions and proofs.

Appendix A. Contained classical cycles, implementation details and numerical checks

  • 9.6–10.2 on channels, 2.0–2.2 on barriers, and 2.26 for elasticity are OA-VCB’s margins over the reference; contained Chebyshev matches the adaptive reference within a few per cent, while contained Jacobi is less accurate on every set.For contained Chebyshev, the paired ratio is 0.975–1.056.Source: Appendix A · pp. 32–33
  • 5.9 × 10−16 is the relative difference between product-form Chebyshev smoothing and its three-term recurrence on the tested level operators.The network and classical cycles also agree to 4.8 × 10−10 for the tested Chebyshev weights.Source: Appendix A · p. 33
  • 7 × 10−17 is the median finest-level rigid-body defect for elasticity transfers, but the maximum reaches 0.40; wider coarse Galerkin stencils and conditional neighborhood hypotheses limit the reproduction claim.The measured defects are reported rather than a physical-width bound.Source: Appendix A · pp. 33–34, Appendix B · p. 35
  • 7 × 10−7 is the homogeneity deviation for residual scales 10−20 to 10^8; at 10−30 it grows to 3 × 10−5 as GPU kernels flush subnormal values to zero.Finiteness and the energy bound remain unaffected.Source: Appendix A · p. 34
  • The implemented safeguard preserves energy non-increase but not, in general, the minimization equality, because finite precision, ridge regularization, or acceptance scaling can alter the correction.A failed acceptance test shrinks or rejects the correction.Source: Appendix A · p. 34
  • No safeguard violation occurred at tolerance 10−12 across real samples and 210 duplicate-direction stress cases; an earlier single-precision Gram matrix broke the bound in 11 cases.Re-evaluated checkpoints changed corrections by at most 7 × 10−6 relative, with mean errors changing by less than 10−5 relative.Source: Appendix A · pp. 34–35

Appendix B. Proofs

  • Positive homogeneity follows because smoother inputs and outputs scale with the load while normalized features and the projection span remain unchanged.Source: Appendix B · p. 36
  • The energy safeguard follows from the projection normal equations, with the zero correction admissible in both the output projection and deflation step.Source: Appendix B · p. 36

Appendix C. Stage 1: protocol chronology, provenance and further results

Appendix C records the Stage 1 protocol, confirmation comparisons, implementation costs, and validity boundaries; the accompanying original-study tables define comparison scopes but do not provide their cell values here.

Appendix C. Stage 1: protocol chronology, provenance and further results

  • The run-time frozen-scale gate was not executed, and the retrospective file-hash match does not establish what file content was present at run time.The authors do not claim that the gate was passed.Source: Appendix C · p. 37
  • The operation ledger excludes common hierarchy setup and is neither a timing nor a communication-volume measure; its ratios apply only under that counting convention.The ledger also omits some wrapper and setup operations.Source: Appendix C · p. 37
  • Reported CPU timings use medians of per-operator medians, while the operator-data share comes from a separate component profile and does not partition the median pass time.The described timing environment uses one Intel Xeon processor with two threads.Source: Appendix C · p. 38
  • The Stage 1 statistics and principal comparisons were independently recomputed, with reported agreement to 9 × 10^-16 and 5.3 × 10^-15, respectively.A table generator also recomputed intervals against stored endpoints to 10^-9.Source: Appendix C · p. 38
  • Table C.8 covers one-pass Stage 1 comparators and defines the fitted per-instance polynomial error as an upper bound, while Table C.9 splits barrier comparisons by floating-island status.Neither caption supplies the table cell values.Source: Table C.8 · p. 39, Table C.9 · p. 40
  • The per-instance polynomial candidate is an upper bound, not a certified optimum; a losing candidate does not establish superiority over the class optimum.The reported local K5 comparison is also not an equal-information or equal-cost control, and anisotropy and elasticity were not evaluated against the Stage 1 controls.Source: Appendix C · p. 40

Appendix D. Original-study main comparison, larger classical budgets and platform costs

  • Table D.11 defines the original-study comparison over 300 held-out operators, while Tables D.12 and D.13 address stronger smoothers and matched-accuracy costs on separate platform measurements.The supplied passages describe these tables’ scopes but do not report their cell values; Table D.12 was not repeated for Stage 1 operators.Source: Table D.11 · p. 41, Appendix D · p. 41

Appendix E. Original-study design ablations

The appendices test design choices, training variability, detector and transfer sensitivity, post-hoc enrichment, load coverage, additional settings, and reproducibility. These checks show both retained accuracy margins and boundaries on how broadly the results can be interpreted.

Appendix E. Original-study design ablations

  • On channels, OA-VCB is 1.17 times more accurate than OA-VCZ; Galerkin-output gains are not independent and additive across deflation and training choices.Without deflation, projected-output training improves projected error from 0.121 to 0.107 but degrades plain error from 0.233 to 0.311.Source: Appendix E · p. 41

Appendix F. Repeated training and the output/loss ablation

  • Projecting outputs from networks trained without the projection loss improves barrier errors from 0.233 to 0.121 for OA-VC and from 0.075 to 0.049 for OA-VCZ.A residual-linear OA-VCBL run also ended with 2.8 times higher final training loss and a larger plain-cycle error, while its projected mean error remained similar.Source: Appendix F · pp. 42, 45

Appendix G. Sensitivity of the detector thresholds and of the transfer steps

  • With m = 8 transfers, the trained OA-VCB retains a margin over the stronger reference: G = 11.17 on channels and 2.01 on barriers.The m = 8 model’s gains against the m = 4 reference are 12.0 and 2.88, respectively; increasing transfer steps improves the classical reference but costs more setup.Source: Appendix G · pp. 45–46

Appendix H. Harmonic enrichment: protocol, amendment and results

  • On fresh operators, the captured fraction of squared energy error has median 0.12 and quartiles 0.02 and 0.33; indicator columns alone yield numerically negligible gains.The classical reference shows similar correction behavior, while observed barrier error fraction drops from 31% to 20% after correction on development samples.Source: Appendix H · p. 49

Appendix I. Load tests

  • The load tests distinguish training-distribution coverage from extrapolation: the smooth and localized test loads remain within the stated training support.The localized Gaussian changes forcing composition rather than width, and positive homogeneity makes its amplitude immaterial.Source: Appendix I · p. 50

Appendix J. Further settings

  • Without retraining, the L4 model retains G = 8.12 on 100 L5 test samples, but its paired gain falls to 0.51 on the 21 completed L6 cases.The L6 evaluation stopped before all 24 planned samples, so its interval excludes missing cases; a model trained at L3 does not retain its margin at L4.Source: Appendix J · p. 52
  • In a preliminary plane-strain elasticity case, OA-VCB is more accurate than its reference on every test sample, with G = 2.32 and median 11 two-grid PCG iterations to reach its error.This is one training run on one data set and does not establish broad applicability to mechanics.Source: Table J.26 · p. 53, Appendix J · p. 54

Appendix K. Computing platforms and reproducibility

  • The release identifies archived files with SHA-256 hashes, and scripts regenerate the original-study and Stage 1 tables and figures from stored records.The model-code hash identifies stored model records, not all diagnostic, driver, and table-generation scripts.Source: Appendix K · p. 55
Loading 2610.30692v1…