AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Optimization-Based Algebraic Multigrid Coarsening Using Reinforcement Learning

Ali Taghibakhshi, Scott MacLachlan, Luke Olson, Matthew West

NeurIPS 2021 · Graph learning › Graph algorithms and clustering · approach: Neural combinatorial optimization on graphs · 3 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use RL coarsening instead of greedy method on structured gridsAMG coarsening · Structured gridsF-fraction: 51.5% higher; 96.4% of theoretical boundImproved
use RL coarsening instead of greedy method on unstructured grid familiesAMG coarsening · Five unstructured grid familiesF-fractionImproved
use RL coarsening instead of greedy methodtwo-level AMG · All grid familieseffective convergence factorNo clear effect
increase structured grid sizeRL coarsening · Structured gridsF-fraction vs greedyImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy