Pith. sign in

REVIEW 2 cited by

Do We Really Need Complicated Model Architectures For Temporal Networks?

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

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

classification cs.LGcs.AI
keywords temporalinformationlinkperformancearchitecturegraphmixermodelonly
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

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

    quant-ph 2026-05 unverdicted novelty 5.0 of 10

    A hybrid quantum-classical temporal graph network with adaptive amplitude encoding claims strong link-prediction results on five TGBL benchmarks, but the evaluation is undermined by a below-random baseline and missing code.

  2. Non-exchangeable Conformal Prediction for Temporal Graph Neural Networks

    cs.LG 2025-07 reject novelty 4.0 of 10

    NCPNet applies non-exchangeable conformal prediction to temporal graphs by diffusing non-conformity scores over graph and time neighbors and learning weighted quantiles to reduce prediction set size.

Pith tools