atlas

Research map / Graph learning / GNN architectures

Limitless Stability for Graph Convolutional Networks

ICLR 2023 · Graph learning › GNN architectures · approach: Theory of graph convolutional networks · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 the unnormalized graph Laplacian for collapsing strongly connected subgraphs into single nodesGraph convolutional networks · Strong-edge graph collapsetransferability error bound: K2√δHelped
Use adjacency matrices or normalized graph Laplacians instead of the unnormalized graph LaplacianGraph convolutional networks · Strong-edge graph collapsetransferability stabilityHurt
Compare resolvents rather than graph Laplacians when measuring structural changeGraph convolutional networks · Strong-edge graph collapseoperator difference: O(δ_a·δ_b)Helped
Increase the coupling strength of the collapsing subgraphGraph convolutional networks · QM7 methane graph, effective versus original representationgraph-level transferability error: O(1)Helped
Use p-norm aggregation with p ≥ 2Graph convolutional networks · Graph-level aggregationinput-signal stability boundNo clear effect

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