Logic-based Weisfeiler-Leman variants enable graph-to-table conversion for classification that matches GNN and graph transformer accuracy while running 5-20x faster without GPUs.
If w ∈ M is the node over which the chosen pebble lies, the attacker then chooses a subsetX ⊆ N(w)of the neighbours of the nodew such that(N(w), X) ∈ Q
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Graph Learning via Logic-Based Weisfeiler-Leman Variants and Tabularization
Logic-based Weisfeiler-Leman variants enable graph-to-table conversion for classification that matches GNN and graph transformer accuracy while running 5-20x faster without GPUs.