Pith. sign in

REVIEW 2 cited by

Graph Pooling for Graph Neural Networks: Progress, Challenges, and Opportunities

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2204.07321 v2 pith:HQM7B7M5 submitted 2022-04-15 cs.LG

classification cs.LG
keywords graphpoolingmethodsarchitecturebeenchallengesfuturegraph-level
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph neural networks have emerged as a leading architecture for many graph-level tasks, such as graph classification and graph generation. As an essential component of the architecture, graph pooling is indispensable for obtaining a holistic graph-level representation of the whole graph. Although a great variety of methods have been proposed in this promising and fast-developing research field, to the best of our knowledge, little effort has been made to systematically summarize these works. To set the stage for the development of future works, in this paper, we attempt to fill this gap by providing a broad review of recent methods for graph pooling. Specifically, 1) we first propose a taxonomy of existing graph pooling methods with a mathematical summary for each category; 2) then, we provide an overview of the libraries related to graph pooling, including the commonly used datasets, model architectures for downstream tasks, and open-source implementations; 3) next, we further outline the applications that incorporate the idea of graph pooling in a variety of domains; 4) finally, we discuss certain critical challenges facing current studies and share our insights on future potential directions for research on the improvement of graph pooling.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 9 citations worldwide. Full citation record

  1. Context Pooling: Query-specific Graph Pooling for Generic Inductive Link Prediction in Knowledge Graphs

    cs.AI 2025-07 conditional novelty 6.0 of 10

    Context Pooling improves inductive link prediction in knowledge graphs by building a query-specific subgraph that keeps only neighbors whose relation types co-occur with the query relation.

  2. Mitigating Context Bias in Domain Adaptation for Object Detection using Mask Pooling

    cs.CV 2025-05 conditional novelty 6.0 of 10

    Mask Pooling, which pools foreground and background separately using ground-truth masks, improves object-detection robustness on domain-shift benchmarks but requires masks at inference and lacks a rigorous causal derivation.

Pith tools