Brief

Researchers have developed new variants of the Weisfeiler-Leman algorithm for graph classification, which involve modifying the underlying logical framework. These variants allow graph data to be tabularized, enabling the application of standard tabular data methods. Experiments on 14 datasets showed that this approach achieves predictive performance comparable to graph neural networks and graph transformers, while being significantly faster and not requiring GPU resources. AI

Researchers have introduced Graph Hierarchical Recurrence (GHR), a new framework designed to improve how Graph Neural Networks and Graph Transformers handle long-range dependencies within graph data. GHR operates on both the original graph and a hierarchical abstraction, enabling it to capture correlations between distant graph regions more effectively. The framework demonstrates strong performance in out-of-range generalization and high parameter efficiency, outperforming existing models while using significantly fewer parameters. AI