atlas

Research map / Graph learning / GNN architectures

WILTing Trees: Interpreting the Distance Between MPNN Embeddings

ICML 2025 · Graph learning › GNN architectures · approach: Theory of graph convolutional networks · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Shows that trained MPNN embedding distances align with task-relevant functional distances (unlike structural distances), and distills MPNN distances into a trainable weighted Weisfeiler-Leman Labeling Tree (WILT) optimal-transport distance whose edge weights reveal functionally important subgraphs.

Problem

Existing analyses of MPNN embedding distances link them to task-agnostic structural graph distances, leaving unclear what distance MPNNs learn for a specific task and how they learn it.

Approach

Define a functional pseudometric from target labels, measure alignment of MPNN distances with it, and distill MPNN embedding distances into a weighted WL Labeling Tree optimal-transport distance (d_WILT) whose learned edge weights identify influential WL colors/subgraphs; the approach generalizes WWL and WLOA kernel distances and is computable in linear time.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Distill the GCN embedding distance with size-normalized WILT instead of the strongest fixed-weight baselineGCN with mean pooling · MutagenicityRMSE (× 10^-2): 9.25$\pm$0.87 -> 1.74$\pm$0.52Helped
Distill the GCN embedding distance with dummy-normalized WILT instead of the strongest fixed-weight baselineGCN with sum pooling · MutagenicityRMSE (× 10^-2): 5.98$\pm$1.60 -> 0.82$\pm$0.17Helped
Distill the GCN embedding distance with size-normalized WILT instead of the strongest fixed-weight baselineGCN with mean pooling · ENZYMESRMSE (× 10^-2): 12.18$\pm$0.23 -> 2.71$\pm$0.38Helped
Distill the GCN embedding distance with dummy-normalized WILT instead of the strongest fixed-weight baselineGCN with sum pooling · ENZYMESRMSE (× 10^-2): 6.83$\pm$0.41 -> 1.43$\pm$0.10Helped
Distill the GCN embedding distance with size-normalized WILT instead of the strongest fixed-weight baselineGCN with mean pooling · LipophilicityRMSE (× 10^-2): 10.92$\pm$0.42 -> 3.11$\pm$0.54Helped
Distill the GCN embedding distance with size-normalized WILT instead of the strongest fixed-weight baselineGCN with sum pooling · LipophilicityRMSE (× 10^-2): 10.00$\pm$1.34 -> 2.50$\pm$0.67Helped
Add L1 regularization to the WILT edge-weight objective (ablation)Dummy-normalized WILT distilled from a 3-layer GCN with sum pooling · MutagenicityRMSEHurt
Train WILT edge weights with L1 regularization at λ=1.0, leaving about 5% of edges non-zero (ablation)Dummy-normalized WILT distilled from a 3-layer GCN with sum pooling · MutagenicityRMSEHelped
Train the MPNN rather than use an untrained MPNNMPNN · Multiple datasetsALI_k alignment with functional distanceHelped
Increase alignment between the MPNN embedding distance and functional distanceTrained MPNNs · Mutagenicity, ENZYMES, and LipophilicityPredictive performance: 0.66, 0.70; 0.89, 0.49; -0.65, -0.57Mixed

Surprising findings

Limitations

Experimental setup

Datasets: Mutagenicity ENZYMES Lipophilicity IMDB-BINARY COLLAB

Benchmarks: Mutagenicity ENZYMES Lipophilicity IMDB-BINARY COLLAB

Metrics: Spearman rank correlation RMSE between distances alignment ALI_k

Baselines: WWL distance WLOA distance

Builds on: Weisfeiler Leman test Wasserstein Weisfeiler Leman graph kernel Weisfeiler Leman optimal assignment kernel graph convolutional networks graph isomorphism networks

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy