Beyond weisfeiler-lehman: A quantitative framework for GNN expressiveness
Designing expressive Graph Neural Networks (GNNs) is a fundamental topic in the graph
learning community. So far, GNN expressiveness has been primarily assessed via the …
learning community. So far, GNN expressiveness has been primarily assessed via the …
Efficient link prediction via gnn layers induced by negative sampling
Graph neural networks (GNNs) for link prediction can loosely be divided into two broad
categories. First, node-wise architectures pre-compute individual embeddings for each node …
categories. First, node-wise architectures pre-compute individual embeddings for each node …
Rethinking the Expressiveness of GNNs: A Computational Model Perspective
Graph Neural Networks (GNNs) are extensively employed in graph machine learning, with
considerable research focusing on their expressiveness. Current studies often assess GNN …
considerable research focusing on their expressiveness. Current studies often assess GNN …
Towards Stable, Globally Expressive Graph Representations with Laplacian Eigenvectors
Graph neural networks (GNNs) have achieved remarkable success in a variety of machine
learning tasks over graph data. Existing GNNs usually rely on message passing, ie …
learning tasks over graph data. Existing GNNs usually rely on message passing, ie …
Fine-Grained Expressive Power of Weisfeiler-Leman: A Homomorphism Counting Perspective
The ability of graph neural networks (GNNs) to count homomorphisms has recently been
proposed as a practical and fine-grained measure of their expressive power. Although …
proposed as a practical and fine-grained measure of their expressive power. Although …
Foundations and Frontiers of Graph Learning Theory
Recent advancements in graph learning have revolutionized the way to understand and
analyze data with complex structures. Notably, Graph Neural Networks (GNNs), ie neural …
analyze data with complex structures. Notably, Graph Neural Networks (GNNs), ie neural …
Weisfeiler and Leman Go Loopy: A New Hierarchy for Graph Representational Learning
We introduce $ r $-loopy Weisfeiler-Leman ($ r $-$\ell {} $ WL), a novel hierarchy of graph
isomorphism tests and a corresponding GNN framework, $ r $-$\ell {} $ MPNN, that can …
isomorphism tests and a corresponding GNN framework, $ r $-$\ell {} $ MPNN, that can …
[PDF][PDF] Expressive Attentional Communication Learning using Graph Neural Networks
YQ Chong - 2024 - ri.cmu.edu
Multi-agent reinforcement learning presents unique hurdles such as the nonstationary
problem beyond single-agent reinforcement learning that makes learning effective …
problem beyond single-agent reinforcement learning that makes learning effective …