DeepAI AI Chat
Log In Sign Up

Efficient Dynamic Graph Representation Learning at Scale

by   Xinshi Chen, et al.

Dynamic graphs with ordered sequences of events between nodes are prevalent in real-world industrial applications such as e-commerce and social platforms. However, representation learning for dynamic graphs has posed great computational challenges due to the time and structure dependency and irregular nature of the data, preventing such models from being deployed to real-world applications. To tackle this challenge, we propose an efficient algorithm, Efficient Dynamic Graph lEarning (EDGE), which selectively expresses certain temporal dependency via training loss to improve the parallelism in computations. We show that EDGE can scale to dynamic graphs with millions of nodes and hundreds of millions of temporal events and achieve new state-of-the-art (SOTA) performance.


page 1

page 2

page 3

page 4


FDGNN: Fully Dynamic Graph Neural Network

Dynamic Graph Neural Networks recently became more and more important as...

RDGSL: Dynamic Graph Representation Learning with Structure Learning

Temporal Graph Networks (TGNs) have shown remarkable performance in lear...

Relational Representation Learning for Dynamic (Knowledge) Graphs: A Survey

Graphs arise naturally in many real-world applications including social ...

Real-Time Inference with Large-Scale Temporal Bayes Nets

An increasing number of applications require real-time reasoning under u...

Incremental embedding for temporal networks

Prediction over edges and nodes in graphs requires appropriate and effic...

Learnable Encoder-Decoder Architecture for Dynamic Graph: A Survey

In recent years, the prevalent online services generate a sheer volume o...