Deep learning for dynamic graphs: models and benchmarks
This work provides a comprehensive overview and benchmarks for dynamic graph learning, which is incremental but important for researchers in graph representation learning.
The paper addresses the challenge of making Deep Graph Networks suitable for predictive tasks on evolving real-world systems by surveying recent advances in learning temporal and spatial information for dynamic graphs and conducting a fair performance comparison of popular approaches on node and edge-level tasks, establishing a baseline for evaluating new methods.
Recent progress in research on Deep Graph Networks (DGNs) has led to a maturation of the domain of learning on graphs. Despite the growth of this research field, there are still important challenges that are yet unsolved. Specifically, there is an urge of making DGNs suitable for predictive tasks on realworld systems of interconnected entities, which evolve over time. With the aim of fostering research in the domain of dynamic graphs, at first, we survey recent advantages in learning both temporal and spatial information, providing a comprehensive overview of the current state-of-the-art in the domain of representation learning for dynamic graphs. Secondly, we conduct a fair performance comparison among the most popular proposed approaches on node and edge-level tasks, leveraging rigorous model selection and assessment for all the methods, thus establishing a sound baseline for evaluating new architectures and approaches