pith. sign in

arxiv: 1905.10990 · v1 · pith:NS2TQHMYnew · submitted 2019-05-27 · 💻 cs.LG · stat.ML

Edge Contraction Pooling for Graph Neural Networks

classification 💻 cs.LG stat.ML
keywords poolinggraphlayerscontractionedgeedgepoolneuralnodes
0
0 comments X
read the original abstract

Graph Neural Network (GNN) research has concentrated on improving convolutional layers, with little attention paid to developing graph pooling layers. Yet pooling layers can enable GNNs to reason over abstracted groups of nodes instead of single nodes. To close this gap, we propose a graph pooling layer relying on the notion of edge contraction: EdgePool learns a localized and sparse hard pooling transform. We show that EdgePool outperforms alternative pooling methods, can be easily integrated into most GNN models, and improves performance on both node and graph classification.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Hierarchical Multi-Scale Graph Neural Networks: Scalable Heterophilous Learning with Oversmoothing and Oversquashing Mitigation

    cs.LG 2026-05 unverdicted novelty 6.0

    HMH builds soft hierarchies with orthonormal Haar bases and heterophily-aware encoders to apply learnable spectral filters while using skip unpooling to avoid oversmoothing and hub bias on heterophilous graphs.

  2. Learning from Historical Activations in Graph Neural Networks

    cs.LG 2026-01 unverdicted novelty 6.0

    HISTOGRAPH applies unified layer-wise attention followed by node-wise attention over historical GNN activations to improve graph classification, especially in deep models.

  3. Torch Geometric Pool: the PyTorch library for pooling in Graph Neural Networks

    cs.LG 2025-12 accept novelty 6.0

    A new open-source library standardizes 20 hierarchical graph pooling operations under one SRCL interface with uniform outputs and batch handling for PyTorch Geometric.

  4. The Role of Node Features in Graph Pooling

    cs.LG 2026-05 unverdicted novelty 5.0

    Pooling improves graph classification only when node features align well with topology, and the authors provide a quantitative measure of this alignment quality.

  5. OpenGLT: A Comprehensive Benchmark of Graph Neural Networks for Graph-Level Tasks

    cs.LG 2025-01 unverdicted novelty 5.0

    OpenGLT benchmark finds no single GNN architecture dominates graph-level tasks, with subgraph-based models strongest in expressiveness, graph learning and SSL models in robustness, node and pooling models in efficienc...