DiffPool (Differentiable Pooling) is a learnable hierarchical graph pooling method that generates soft cluster assignments using a GNN, mapping nodes to a coarsened graph at each pooling layer — enabling end-to-end learning of hierarchical graph representations where the clustering structure is optimized jointly with the downstream task, rather than relying on fixed heuristic pooling strategies.

What Is DiffPool?

• Definition: DiffPool (Ying et al., 2018) uses two parallel GNNs at each pooling layer: (1) an embedding GNN that computes node feature embeddings $Z = ext{GNN}_{embed}(A, X)$, and (2) an assignment GNN that computes a soft assignment matrix $S = ext{softmax}( ext{GNN}_{pool}(A, X)) in mathbb{R}^{N imes K}$, where $S_{ij}$ is the probability that node $i$ belongs to cluster $j$. The coarsened graph is: $A' = S^T A S in mathbb{R}^{K imes K}$ (new adjacency) and $X' = S^T Z in mathbb{R}^{K imes d}$ (new features).
• Hierarchical Coarsening: Stacking multiple DiffPool layers creates a hierarchy: the first layer groups atoms into functional groups, the second groups functional groups into molecular scaffolds, the third produces a single graph-level embedding. Each layer reduces the graph by a factor (e.g., from 100 nodes to 25 to 5 to 1), progressively abstracting local structure into global representation.
• Differentiable Assignment: Unlike hard pooling methods (TopKPool, which drops nodes) or fixed methods (graph coarsening by edge contraction), DiffPool's soft assignment is fully differentiable — gradients flow from the classification loss through the assignment matrix $S$ back to the assignment GNN, learning to cluster nodes in whatever way best serves the downstream task.

Why DiffPool Matters

• End-to-End Hierarchy Learning: Prior graph pooling methods used fixed strategies — global mean/sum pooling (losing structural information) or TopK selection (heuristically dropping nodes). DiffPool learns the hierarchical structure jointly with the task, discovering that benzene rings should be grouped together for toxicity prediction but fragmented for solubility prediction. The clustering adapts to the objective.
• Graph Classification Performance: DiffPool achieved state-of-the-art results on graph classification benchmarks (protein structure classification, social network classification, molecular property prediction) by capturing multi-scale features — local substructure patterns at early layers and global graph properties at late layers.
• Theoretical Insight: DiffPool demonstrates that hierarchical graph representations are learnable — the assignment GNN can discover meaningful graph hierarchies without explicit supervision on the clustering structure. This validates the hypothesis that graph-level tasks benefit from multi-resolution features, analogous to how image classification benefits from hierarchical convolutional feature maps.
• Limitations and Successors: DiffPool has $O(kN)$ memory per layer (the assignment matrix $S$), limiting scalability to graphs with thousands of nodes. This motivated efficient alternatives: MinCutPool (spectral objective), SAGPool (attention-based selection), and ASAPool (adaptive structure-aware pooling) that achieve comparable quality with lower memory footprint.

DiffPool Architecture

DiffPool is learned graph compression — teaching a neural network to discover the optimal hierarchical grouping of nodes at each level, producing multi-scale graph representations that are end-to-end optimized for the downstream classification or regression task.