RAPNet: Accelerating Algebraic Multigrid with Learned Sparse Corrections

• URL: http://arxiv.org/abs/2605.26854v1
• Date: Tue, 26 May 2026 11:14:59 GMT
• Title: RAPNet: Accelerating Algebraic Multigrid with Learned Sparse Corrections
• Abstract summary: We propose RAPNet, a graph neural network (GNN) framework that resolves the trade-off between sparsity and convergence quality of coarse-grid operators.<n>Key to our approach is a level-wise training strategy that enables learning from small subgraphs and generalization to million-node domains.<n>We show that our method outperforms classical non-Galerkin baselines on diverse PDE discretizations and graph Laplacians.
• Score: 11.742065170002164
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The scalable solution of large sparse linear systems is a bottleneck in scientific computing and graph analysis. While algebraic multigrid (AMG) offers optimal linear scaling, its performance is severely constrained by the trade-off between the sparsity and convergence quality of coarse-grid operators. Classical AMG heuristics struggle to balance these objectives, often sacrificing stability or performance for sparsity. We propose RAPNet, a graph neural network (GNN) framework that resolves this trade-off by learning to generate sparse, robust coarse operators directly from the sparse algebraic system. Key to our approach is a level-wise training strategy that enables learning from small subgraphs and generalization to million-node domains, bypassing the bottlenecks of prior neural AMG attempts. RAPNet executes exclusively during the solver setup phase, ensuring that the solve phase retains its favorable computational properties. We show that our method outperforms classical non-Galerkin baselines on diverse PDE discretizations and graph Laplacians, making it particularly effective for multi-query tasks such as eigenproblems, time-dependent simulations, and inverse or design problems.

Related papers

• Graph-RHO: Critical-path-aware Heterogeneous Graph Network for Long-Horizon Flexible Job-Shop Scheduling [26.97705087364345]
  Graph-RHO is a novel critical-path-aware graph-based RHO framework.<n>We introduce a topology-aware heterogeneous graph network that encodes subproblems as operation-machine graphs with multi-relational edges.<n>We incorporate a critical-path-aware mechanism that injects inductive biases during training to distinguish highly sensitive bottleneck operations from robust ones.
  arXiv  Detail & Related papers  (2026-04-11T07:35:09Z)
• Warm-starting active-set solvers using graph neural networks [4.309217525488745]
  We propose a learning-to-optimize approach using graph neural networks (GNNs) to predict active sets in the dual active-set solver DAQP.<n>Across varying problem sizes, the GNN consistently reduces the number of solver iterations compared to cold-starting.<n>A GNN trained on varying problem sizes generalizes effectively to unseen dimensions, demonstrating flexibility and scalability.
  arXiv  Detail & Related papers  (2025-11-17T09:22:45Z)
• Improvement of Optimization using Learning Based Models in Mixed Integer Linear Programming Tasks [2.1111289252277197]
  Mixed Linear Programs (MILPs) are essential tools for solving planning and scheduling problems across critical industries such as construction, manufacturing, and logistics.<n>We present a learning-based framework that leverages Behavior Cloning (BC) and Reinforcement Learning (RL) to train Graph Neural Networks (GNNs)<n>Our method reduces optimization time and variance compared to traditional techniques while maintaining solution quality and feasibility.
  arXiv  Detail & Related papers  (2025-05-17T01:31:53Z)
• ScaleGNN: Towards Scalable Graph Neural Networks via Adaptive High-order Neighboring Feature Fusion [73.85920403511706]
  We propose ScaleGNN, a novel framework that adaptively fuses multi-hop node features for scalable and effective graph learning.<n>We show that ScaleGNN consistently outperforms state-of-the-art GNNs in both predictive accuracy and computational efficiency.
  arXiv  Detail & Related papers  (2025-04-22T14:05:11Z)
• GDSG: Graph Diffusion-based Solution Generator for Optimization Problems in MEC Networks [109.17835015018532]
  We present a Graph Diffusion-based Solution Generation (GDSG) method.<n>This approach is designed to work with suboptimal datasets while converging to the optimal solution large probably.<n>We build GDSG as a multi-task diffusion model utilizing a Graph Neural Network (GNN) to acquire the distribution of high-quality solutions.
  arXiv  Detail & Related papers  (2024-12-11T11:13:43Z)
• Decision-focused Graph Neural Networks for Combinatorial Optimization [62.34623670845006]
  An emerging strategy to tackle optimization problems involves the adoption of graph neural networks (GNNs) as an alternative to traditional algorithms. Despite the growing popularity of GNNs and traditional algorithm solvers in the realm of CO, there is limited research on their integrated use and the correlation between them within an end-to-end framework. We introduce a decision-focused framework that utilizes GNNs to address CO problems with auxiliary support.
  arXiv  Detail & Related papers  (2024-06-05T22:52:27Z)
• Network Interdiction Goes Neural [26.308933674471895]
  Network interdiction problems are optimization problems involving two players. One aims to solve an optimization problem on a network, while the other seeks to modify the network to thwart the first player's objectives.
  arXiv  Detail & Related papers  (2024-05-26T02:34:26Z)
• Unsupervised Optimal Power Flow Using Graph Neural Networks [172.33624307594158]
  We use a graph neural network to learn a nonlinear parametrization between the power demanded and the corresponding allocation. We show through simulations that the use of GNNs in this unsupervised learning context leads to solutions comparable to standard solvers.
  arXiv  Detail & Related papers  (2022-10-17T17:30:09Z)
• Leveraging power grid topology in machine learning assisted optimal power flow [0.5076419064097734]
  Machine learning assisted optimal power flow (OPF) aims to reduce the computational complexity of non-linear and non- constrained power flow problems. We assess the performance of a variety of FCNN, CNN and GNN models for two fundamental approaches to machine assisted OPF. For several synthetic grids with interconnected utilities, we show that locality properties between feature and target variables are scarce.
  arXiv  Detail & Related papers  (2021-10-01T10:39:53Z)
• Efficient Model-Based Multi-Agent Mean-Field Reinforcement Learning [89.31889875864599]
  We propose an efficient model-based reinforcement learning algorithm for learning in multi-agent systems. Our main theoretical contributions are the first general regret bounds for model-based reinforcement learning for MFC. We provide a practical parametrization of the core optimization problem.
  arXiv  Detail & Related papers  (2021-07-08T18:01:02Z)
• Towards an Efficient and General Framework of Robust Training for Graph Neural Networks [96.93500886136532]
  Graph Neural Networks (GNNs) have made significant advances on several fundamental inference tasks. Despite GNNs' impressive performance, it has been observed that carefully crafted perturbations on graph structures lead them to make wrong predictions. We propose a general framework which leverages the greedy search algorithms and zeroth-order methods to obtain robust GNNs.
  arXiv  Detail & Related papers  (2020-02-25T15:17:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.