Pith. sign in

REVIEW 1 cited by

TIGER: Temporal Interaction Graph Embedding with Restarts

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.06057 v2 pith:GVDYD5V5 submitted 2023-02-13 cs.LG cs.SI

classification cs.LGcs.SI
keywords temporalinteractionnoderepresentationsbetterembeddingeventsexisting
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Temporal interaction graphs (TIGs), consisting of sequences of timestamped interaction events, are prevalent in fields like e-commerce and social networks. To better learn dynamic node embeddings that vary over time, researchers have proposed a series of temporal graph neural networks for TIGs. However, due to the entangled temporal and structural dependencies, existing methods have to process the sequence of events chronologically and consecutively to ensure node representations are up-to-date. This prevents existing models from parallelization and reduces their flexibility in industrial applications. To tackle the above challenge, in this paper, we propose TIGER, a TIG embedding model that can restart at any timestamp. We introduce a restarter module that generates surrogate representations acting as the warm initialization of node representations. By restarting from multiple timestamps simultaneously, we divide the sequence into multiple chunks and naturally enable the parallelization of the model. Moreover, in contrast to previous models that utilize a single memory unit, we introduce a dual memory module to better exploit neighborhood information and alleviate the staleness problem. Extensive experiments on four public datasets and one industrial dataset are conducted, and the results verify both the effectiveness and the efficiency of our work.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Temporal-Aware Evaluation and Learning for Temporal Graph Neural Networks

    cs.LG 2024-12 reject novelty 6.0 of 10

    The authors introduce volatility cluster statistics (VCS) and a differentiable regularizer (VCA) to evaluate and reduce temporally clustered prediction errors in TGNNs, but the formal proof that AP/AU-ROC are blind to...

Pith tools