AIBullisharXiv – CS AI · 6h ago6/10
🧠
Scaling Higher-Order Graph Learning with Maximal Clique Complexes
Researchers introduce simplified and factored cellular Weisfeiler Leman tests alongside maximal clique complexes to enable scalable higher-order graph neural networks. The CliqueWalk algorithm samples maximal cliques efficiently without explicit enumeration, addressing the critical scalability bottleneck that has limited adoption of topological learning approaches in production systems.