{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/optimization-based-algebraic-multigrid","title":"Optimization-Based Algebraic Multigrid Coarsening Using Reinforcement Learning","arxiv_id":"2106.01854","date":"2021-06-03","proceeding":"NeurIPS 2021 12","authors":["Ali Taghibakhshi","Scott MacLachlan","Luke Olson","Matthew West"],"abstract":"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, a necessary step in developing fully learnable AMG methods. 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 planar training graphs and then be applied to unstructured large planar graphs, assuming bounded node degree. 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.","url_abs":"https://arxiv.org/abs/2106.01854v3","url_pdf":"https://arxiv.org/pdf/2106.01854v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"optimization-based-algebraic-multigrid","repo_url":"https://github.com/compdyn/rl_grid_coarsen","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2106.01854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01854"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/compdyn/rl_grid_coarsen","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":11},"by_repo_kind":{"official":{"samples":11,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"8185b20fffe1e7c1","entry":"Coloring","repo":"compdyn/rl_grid_coarsen","repo_kind":"official","path":"Lloyd_Unstructured.py","file_url":"https://github.com/compdyn/rl_grid_coarsen/blob/HEAD/Lloyd_Unstructured.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8185b20fffe1e7c1"}},{"code_sha256_prefix":"61a0bd66b46ac92d","entry":"check_mesh","repo":"compdyn/rl_grid_coarsen","repo_kind":"official","path":"fem.py","file_url":"https://github.com/compdyn/rl_grid_coarsen/blob/HEAD/fem.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"61a0bd66b46ac92d"}},{"code_sha256_prefix":"10bee4c9c4b2927a","entry":"cycle","repo":"compdyn/rl_grid_coarsen","repo_kind":"official","path":"Cycle.py","file_url":"https://github.com/compdyn/rl_grid_coarsen/blob/HEAD/Cycle.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"10bee4c9c4b2927a"}},{"code_sha256_prefix":"c20f9b6bbfd1f7a4","entry":"diameter","repo":"compdyn/rl_grid_coarsen","repo_kind":"official","path":"fem.py","file_url":"https://github.com/compdyn/rl_grid_coarsen/blob/HEAD/fem.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c20f9b6bbfd1f7a4"}},{"code_sha256_prefix":"984e964c5c619025","entry":"from_networkx","repo":"compdyn/rl_grid_coarsen","repo_kind":"official","path":"Optim.py","file_url":"https://github.com/compdyn/rl_grid_coarsen/blob/HEAD/Optim.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"984e964c5c619025"}},{"code_sha256_prefix":"a86f4b0a23ef9e06","entry":"from_networkx","repo":"compdyn/rl_grid_coarsen","repo_kind":"official","path":"Unstructured.py","file_url":"https://github.com/compdyn/rl_grid_coarsen/blob/HEAD/Unstructured.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"a86f4b0a23ef9e06"}},{"code_sha256_prefix":"b582e1bdd6e50099","entry":"from_scipy_sparse_matrix","repo":"compdyn/rl_grid_coarsen","repo_kind":"official","path":"Optim.py","file_url":"https://github.com/compdyn/rl_grid_coarsen/blob/HEAD/Optim.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b582e1bdd6e50099"}},{"code_sha256_prefix":"9683a6a8b9c21319","entry":"generate_quadratic","repo":"compdyn/rl_grid_coarsen","repo_kind":"official","path":"fem.py","file_url":"https://github.com/compdyn/rl_grid_coarsen/blob/HEAD/fem.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9683a6a8b9c21319"}},{"code_sha256_prefix":"120cd40b07b3a506","entry":"hop_neigh","repo":"compdyn/rl_grid_coarsen","repo_kind":"official","path":"Lloyd_Unstructured.py","file_url":"https://github.com/compdyn/rl_grid_coarsen/blob/HEAD/Lloyd_Unstructured.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"120cd40b07b3a506"}},{"code_sha256_prefix":"37bb1126cefd3957","entry":"is_pos_def","repo":"compdyn/rl_grid_coarsen","repo_kind":"official","path":"Solve_MG.py","file_url":"https://github.com/compdyn/rl_grid_coarsen/blob/HEAD/Solve_MG.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"37bb1126cefd3957"}},{"code_sha256_prefix":"caf1e3fe849bd5c5","entry":"relax_wjacobif","repo":"compdyn/rl_grid_coarsen","repo_kind":"official","path":"Solve_MG.py","file_url":"https://github.com/compdyn/rl_grid_coarsen/blob/HEAD/Solve_MG.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"caf1e3fe849bd5c5"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}