Optimization-Based Algebraic Multigrid Coarsening Using Reinforcement Learning

by   Ali Taghibakhshi, et al.

Large sparse linear systems of equations are ubiquitous in science and engineering, such as those arising from discretizations of partial differential equations. Algebraic multigrid (AMG) methods are one of the most common methods of solving such linear systems, with an extensive body of underlying mathematical theory. A system of linear equations defines a graph on the set of unknowns and each level of a multigrid solver requires the selection of an appropriate coarse graph along with restriction and interpolation operators that map to and from the coarse representation. The efficiency of the multigrid solver depends critically on this selection and many selection methods have been developed over the years. Recently, it has been demonstrated that it is possible to directly learn the AMG interpolation and restriction operators, given a coarse graph selection. In this paper, we consider the complementary problem of learning to coarsen graphs for a multigrid solver. We propose a method using a reinforcement learning (RL) agent based on graph neural networks (GNNs), which can learn to perform graph coarsening on small training graphs and then be applied to unstructured large graphs. We demonstrate that this method can produce better coarse graphs than existing algorithms, even as the graph size increases and other properties of the graph are varied. We also propose an efficient inference procedure for performing graph coarsening that results in linear time complexity in graph size.


page 1

page 2

page 3

page 4


Learning Algebraic Multigrid Using Graph Neural Networks

Efficient numerical solvers for sparse linear systems are crucial in sci...

Multipole Graph Neural Operator for Parametric Partial Differential Equations

One of the main challenges in using deep learning-based methods for simu...

Parallel Energy-Minimization Prolongation for Algebraic Multigrid

Algebraic multigrid (AMG) is one of the most widely used solution techni...

Graph Coarsening with Neural Networks

As large-scale graphs become increasingly more prevalent, it poses signi...

Coarse-Grid Selection Using Simulated Annealing

Multilevel techniques are efficient approaches for solving the large lin...

Convergence analysis of two-level methods with general coarse solvers

Multilevel methods are among the most efficient numerical methods for so...

GL-Coarsener: A Graph representation learning framework to construct coarse grid hierarchy for AMG solvers

In many numerical schemes, the computational complexity scales non-linea...

Please sign up or login with your details

Forgot password? Click here to reset