The reviewed record of science sign in
Pith

arxiv: 2302.11636 · v1 · pith:GTY6YYEJ · submitted 2023-02-22 · cs.LG · cs.AI

Do We Really Need Complicated Model Architectures For Temporal Networks?

Reviewed by Pithpith:GTY6YYEJopen to challenge →

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

Recurrent neural network (RNN) and self-attention mechanism (SAM) are the de facto methods to extract spatial-temporal information for temporal graph learning. Interestingly, we found that although both RNN and SAM could lead to a good performance, in practice neither of them is always necessary. In this paper, we propose GraphMixer, a conceptually and technically simple architecture that consists of three components: (1) a link-encoder that is only based on multi-layer perceptrons (MLP) to summarize the information from temporal links, (2) a node-encoder that is only based on neighbor mean-pooling to summarize node information, and (3) an MLP-based link classifier that performs link prediction based on the outputs of the encoders. Despite its simplicity, GraphMixer attains an outstanding performance on temporal link prediction benchmarks with faster convergence and better generalization performance. These results motivate us to rethink the importance of simpler model architecture.

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 3 Pith papers

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

  1. Graph Retention Networks for Dynamic Graphs

    cs.LG 2024-11 unverdicted novelty 7.0

    Graph Retention Networks extend retention to dynamic graphs to enable parallelizable training, O(1) inference, and chunkwise long-term training while delivering competitive performance with major efficiency gains.

  2. Forget Less, Generalize More: Unifying Temporal and Structural Adaptation for Dynamic Graphs

    cs.LG 2026-05 unverdicted novelty 6.0

    DSRD unifies temporal and structural adaptation for dynamic graphs via a single recurrent retentive state with learnable time-sensitivity parameters in the decay kernels.

  3. A2QTGN: Adaptive Amplitude Quantum-Integrated Temporal Graph Network for Dynamic Link Prediction

    quant-ph 2026-05 unverdicted novelty 5.0

    A2QTGN combines adaptive quantum amplitude encoding with a temporal graph network to improve dynamic link prediction, showing strong results on five benchmark datasets.