Pith. sign in

REVIEW 2 cited by

Hierarchical Graph Pooling with Structure Learning

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 1911.05954 v3 pith:YQZYWTKA submitted 2019-11-14 cs.LG stat.ML

classification cs.LGstat.ML
keywords graphlearningpoolingstructurehierarchicalneuralhgp-slnetworks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph Neural Networks (GNNs), which generalize deep neural networks to graph-structured data, have drawn considerable attention and achieved state-of-the-art performance in numerous graph related tasks. However, existing GNN models mainly focus on designing graph convolution operations. The graph pooling (or downsampling) operations, that play an important role in learning hierarchical representations, are usually overlooked. In this paper, we propose a novel graph pooling operator, called Hierarchical Graph Pooling with Structure Learning (HGP-SL), which can be integrated into various graph neural network architectures. HGP-SL incorporates graph pooling and structure learning into a unified module to generate hierarchical representations of graphs. More specifically, the graph pooling operation adaptively selects a subset of nodes to form an induced subgraph for the subsequent layers. To preserve the integrity of graph's topological information, we further introduce a structure learning mechanism to learn a refined graph structure for the pooled graph at each layer. By combining HGP-SL operator with graph neural networks, we perform graph level representation learning with focus on graph classification task. Experimental results on six widely used benchmarks demonstrate the effectiveness of our proposed model.

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. Full citation record

  1. The Generalized Skew Spectrum of Graphs

    cs.LG 2025-05 conditional novelty 6.0 of 10

    The generalized Skew Spectrum embeds attributed, multilayer, and hypergraph data into permutation-invariant vectors, and its doubly-reduced k-spectra distinguish all 7-node graphs at the same asymptotic cost as the or...

  2. MetaGMT: Improving Actionable Interpretability of Graph Multilinear Networks via Meta-Learning Filtration

    cs.LG 2025-05 conditional novelty 5.0 of 10

    MetaGMT applies a bi-level meta-learning objective to GMT, improving explanation edge-fidelity on several benchmarks while showing accuracy drops under high spurious bias.

Pith tools