Graphprompt: Unifying pre-training and downstream tasks for graph neural networks
Graphs can model complex relationships between objects, enabling a myriad of Web
applications such as online page/article classification and social recommendation. While …
applications such as online page/article classification and social recommendation. While …
A comprehensive survey on deep graph representation learning methods
IA Chikwendu, X Zhang, IO Agyemang… - Journal of Artificial …, 2023 - jair.org
There has been a lot of activity in graph representation learning in recent years. Graph
representation learning aims to produce graph representation vectors to represent the …
representation learning aims to produce graph representation vectors to represent the …
Graph representation learning and its applications: a survey
Graphs are data structures that effectively represent relational data in the real world. Graph
representation learning is a significant task since it could facilitate various downstream …
representation learning is a significant task since it could facilitate various downstream …
Weisfeiler and leman go machine learning: The story so far
In recent years, algorithms and neural architectures based on the Weisfeiler-Leman
algorithm, a well-known heuristic for the graph isomorphism problem, have emerged as a …
algorithm, a well-known heuristic for the graph isomorphism problem, have emerged as a …
A new perspective on" how graph neural networks go beyond weisfeiler-lehman?"
A Wijesinghe, Q Wang - International Conference on Learning …, 2022 - openreview.net
We propose a new perspective on designing powerful Graph Neural Networks (GNNs). In a
nutshell, this enables a general solution to inject structural properties of graphs into a …
nutshell, this enables a general solution to inject structural properties of graphs into a …
Tree mover's distance: Bridging graph metrics and stability of graph neural networks
Understanding generalization and robustness of machine learning models fundamentally
relies on assuming an appropriate metric on the data space. Identifying such a metric is …
relies on assuming an appropriate metric on the data space. Identifying such a metric is …
Weisfeiler and leman go sparse: Towards scalable higher-order graph embeddings
Graph kernels based on the $1 $-dimensional Weisfeiler-Leman algorithm and
corresponding neural architectures recently emerged as powerful tools for (supervised) …
corresponding neural architectures recently emerged as powerful tools for (supervised) …
Curriculum reinforcement learning via constrained optimal transport
Curriculum reinforcement learning (CRL) allows solving complex tasks by generating a
tailored sequence of learning tasks, starting from easy ones and subsequently increasing …
tailored sequence of learning tasks, starting from easy ones and subsequently increasing …
Speqnets: Sparsity-aware permutation-equivariant graph networks
While message-passing graph neural networks have clear limitations in approximating
permutation-equivariant functions over graphs or general relational data, more expressive …
permutation-equivariant functions over graphs or general relational data, more expressive …
Graph kernels: A survey
Graph kernels have attracted a lot of attention during the last decade, and have evolved into
a rapidly developing branch of learning on structured data. During the past 20 years, the …
a rapidly developing branch of learning on structured data. During the past 20 years, the …