AI Paper Atlas

Research map / Graph learning / GNN architectures

Towards Explaining the Power of Constant-depth Graph Neural Networks for Structured Linear Programming

Qian Li, Minghui Ouyang, Tian Ding, Yuyi Wang, Qingjiang Shi, Ruoyu Sun

ICLR 2025 · Graph learning › GNN architectures · approach: Simple and scalable GNNs

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Provides theoretical explanation for why constant-depth GNNs can predict optimal solutions of structured linear programs well, analyzing their expressive power on LP problems.

Problem

Empirical evidence shows shallow GNNs predict LP optimal solutions well, which is counter-intuitive because LPs are global optimization problems that would seem to need deep message passing.

Approach

Theoretical analysis showing constant-depth GNNs can represent LP solution mappings for structured LPs, explaining the counter-intuitive empirical success of shallow GNNs.

Surprising findings

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