A review of relational machine learning for knowledge graphs
Relational machine learning studies methods for the statistical analysis of relational, or
graph-structured, data. In this paper, we provide a review of how such statistical models can …
graph-structured, data. In this paper, we provide a review of how such statistical models can …
Network geometry
Networks are finite metric spaces, with distances defined by the shortest paths between
nodes. However, this is not the only form of network geometry: two others are the geometry …
nodes. However, this is not the only form of network geometry: two others are the geometry …
Size-invariant graph representations for graph classification extrapolations
In general, graph representation learning methods assume that the train and test data come
from the same distribution. In this work we consider an underexplored area of an otherwise …
from the same distribution. In this work we consider an underexplored area of an otherwise …
Janossy pooling: Learning deep permutation-invariant functions for variable-size inputs
We consider a simple and overarching representation for permutation-invariant functions of
sequences (or multiset functions). Our approach, which we call Janossy pooling, expresses …
sequences (or multiset functions). Our approach, which we call Janossy pooling, expresses …
Probabilistic symmetries and invariant neural networks
B Bloem-Reddy, Y Whye - Journal of Machine Learning Research, 2020 - jmlr.org
Treating neural network inputs and outputs as random variables, we characterize the
structure of neural networks that can be used to model data that are invariant or equivariant …
structure of neural networks that can be used to model data that are invariant or equivariant …
Deep models of interactions across sets
We use deep learning to model interactions across two or more sets of objects, such as user
{–} movie ratings or protein {–} drug bindings. The canonical representation of such …
{–} movie ratings or protein {–} drug bindings. The canonical representation of such …
The many facets of community detection in complex networks
Community detection, the decomposition of a graph into essential building blocks, has been
a core research topic in network science over the past years. Since a precise notion of what …
a core research topic in network science over the past years. Since a precise notion of what …
Sparse graphs using exchangeable random measures
Statistical network modelling has focused on representing the graph as a discrete structure,
namely the adjacency matrix. When assuming exchangeability of this array—which can aid …
namely the adjacency matrix. When assuming exchangeability of this array—which can aid …
Using aggregated relational data to feasibly identify network structure without network data
Social network data are often prohibitively expensive to collect, limiting empirical network
research. We propose an inexpensive and feasible strategy for network elicitation using …
research. We propose an inexpensive and feasible strategy for network elicitation using …
Scene graph prediction with limited labels
Visual knowledge bases such as Visual Genome power numerous applications in computer
vision, including visual question answering and captioning, but suffer from sparse …
vision, including visual question answering and captioning, but suffer from sparse …