mlsanityData to 7 Oct 2026

Learnable Structural Semantic Readout for Graph Classification

arXiv 2111.11523 ↗First posted 22 Nov 2021cs.LG cs.AIcited by 13

Not on the map. Why?

Abstract (arXiv)

With the great success of deep learning in various domains, graph neural networks (GNNs) also become a dominant approach to graph classification. By the help of a global readout operation that simply aggregates all node (or node-cluster) representations, existing GNN classifiers obtain a graph-level representation of an input graph and predict its class label using the representation. However, such global aggregation does not consider the structural information of each node, which results in information loss on the global structure. Particularly, it limits the discrimination power by enforcing the same weight parameters of the classifier for all the node representations; in practice, each of them contributes to target classes differently depending on its structural semantic. In this work, we propose structural semantic readout (SSRead) to summarize the node representations at the position-level, which allows to model the position-specific weight parameters for classification as well as to effectively capture the graph semantic relevant to the global structure. Given an input graph, SSRead aims to identify structurally-meaningful positions by using the semantic alignment between its nodes and structural prototypes, which encode the prototypical features of each position. The structural prototypes are optimized to minimize the alignment cost for all training graphs, while the other GNN parameters are trained to predict the class labels. Our experimental results demonstrate that SSRead significantly improves the classification performance and interpretability of GNN classifiers while being compatible with a variety of aggregation functions, GNN architectures, and learning frameworks.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 25 of its 37 references that are in the map. First posted on arXiv 22 Nov 2021.

Builds on

25 of 37 references.

References · 25

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  4. 2017Graph Attention Networkscited by 8,854
  5. 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
  6. 2017Inductive Representation Learning on Large Graphscited by 6,284
  7. 2018How Powerful are Graph Neural Networks?cited by 4,355
  8. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
  9. 2015Learning Deep Features for Discriminative Localizationcited by 2,430
  10. 2020Graph Contrastive Learning with Augmentationscited by 1,203
  11. 2018Deep Graph Infomaxcited by 1,101
  12. 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
13 more
  1. 2015Gated Graph Sequence Neural Networkscited by 792
  2. 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 786
  3. 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 718
  4. 2019Graph U-Netscited by 489
  5. 2019InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximizationcited by 441
  6. 2019Self-Attention Graph Poolingcited by 421
  7. 2020Improving Graph Neural Network Expressivity via Subgraph Isomorphism Countingcited by 312
  8. 2019A Fair Comparison of Graph Neural Networks for Graph Classificationcited by 244
  9. 2015Order Matters: Sequence to sequence for setscited by 236
  10. 2019Position-aware Graph Neural Networkscited by 203
  11. 2019Graph Convolutional Networks with EigenPoolingcited by 94
  12. 2020Second-Order Pooling for Graph Neural Networkscited by 33
  13. 2019Towards Interpretable Sparse Graph Representation Learning with Laplacian Poolingcited by 20

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 6; 2023: 2; 2024: 2; 2025: 2; 2026: 1.

13 papers.

Sort: