Paper of the Day
Weisfeiler-Lehman Meets Optimal Transport: Theory, Algorithms, and Implications
How do you measure how different two networks are?
Why it matters Graph-based machine learning gains a measure of how different two networks are that is quick to compute and agrees with a classic test for telling them apart.
A classic test, named after Weisfeiler and Lehman, answers only yes or no: it checks whether two networks can be told apart by repeatedly comparing each point's neighbours. This paper turns the test into a distance, a number saying how far apart two networks are, which is zero exactly when the test cannot tell them apart. The distance can be computed efficiently and picks up finer differences than a leading existing method. From it the authors design a type of neural network that can, in principle, learn any continuous function of networks. The distance also turns out to be linked to a branch of mathematics about moving probability distributions.
Chen et al., JMLR, 14 November 2026.
Read the paper: Weisfeiler-Lehman Meets Optimal Transport: Theory, Algorithms, and Implications
























































