The reviewed record of science sign in
Pith

arxiv: 2203.10480 · v2 · pith:PHKQWZK7 · submitted 2022-03-20 · cs.LG

Encoder-Decoder Architecture for Supervised Dynamic Graph Learning: A Survey

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:PHKQWZK7record.jsonopen to challenge →

classification cs.LG
keywords graphdynamiclearningsurveytemporaldataframeworkgraphs
0
0 comments X
read the original abstract

In recent years, the prevalent online services generate a sheer volume of user activity data. Service providers collect these data in order to perform client behavior analysis, and offer better and more customized services. Majority of these data can be modeled and stored as graph, such as the social graph in Facebook, user-video interaction graph in Youtube. These graphs need to evolve over time to capture the dynamics in the real world, leading to the invention of dynamic graphs. However, the temporal information embedded in the dynamic graphs brings new challenges in analyzing and deploying them. Events staleness, temporal information learning and explicit time dimension usage are some example challenges in dynamic graph learning. In order to offer a convenient reference to both the industry and academia, this survey presents the Three Stages Recurrent Temporal Learning Framework based on dynamic graph evolution theories, so as to interpret the learning of temporal information with a generalized framework. Under this framework, this survey categories and reviews different learnable encoder-decoder architectures for supervised dynamic graph learning. We believe that this survey could supply useful guidelines to researchers and engineers in finding suitable graph structures for their dynamic learning tasks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. OPD-Evolver: Cultivating Holistic Agent Evolver via On-Policy Distillation

    cs.CL 2026-06 unverdicted novelty 6.0

    OPD-Evolver uses on-policy self-distillation in fast interaction and slow attribution loops to build agents with holistic memory competence, outperforming prior systems by up to 11.5% and allowing a 9B model to compet...

  2. Attention-based graph neural networks: a survey

    cs.SI 2026-05 unverdicted novelty 5.0

    The survey groups attention-based GNNs into three stages—graph recurrent attention networks, graph attention networks, and graph transformers—while reviewing architectures and future directions.