Papers › EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learning

EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learning

22 Mar 2023arXiv:2303.12341archive 2025-07-28

Chao Chen, Haoyu Geng, Nianzu Yang, Xiaokang Yang, Junchi Yan

Dynamic graphs arise in various real-world applications, and it is often welcomed to model the dynamics directly in continuous time domain for its flexibility. This paper aims to design an easy-to-use pipeline (termed as EasyDGL which is also due to its implementation by DGL toolkit) composed of three key modules with both strong fitting ability and interpretability. Specifically the proposed pipeline which involves encoding, training and interpreting: i) a temporal point process (TPP) modulated attention architecture to endow the continuous-time resolution with the coupled spatiotemporal dynamics of the observed graph with edge-addition events; ii) a principled loss composed of task-agnostic TPP posterior maximization based on observed events on the graph, and a task-aware loss with a masking strategy over dynamic graph, where the covered tasks include dynamic link prediction, dynamic node classification and node traffic forecasting; iii) interpretation of the model outputs (e.g., representations and predictions) with scalable perturbation-based quantitative analysis in the graph Fourier domain, which could more comprehensively reflect the behavior of the learned model. Extensive experimental results on public benchmarks show the superior performance of our EasyDGL for time-conditioned predictive tasks, and in particular demonstrate that EasyDGL can effectively quantify the predictive power of frequency content that a model learn from the evolving graph data.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 8 code samples harvested from 1 repository linked to this paper: 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 8 samples from 1 repository, 7 ran (7 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

cchao0116/EasyDGL officialmentioned in papermentioned on GitHubtfMITSyntology: 8 samples, 7 ran (0 instrument-failed) · 1 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

8 samples harvested: 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

7ran
1unverified

Licence: 0 of the 8 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from cchao0116/EasyDGL. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

cchao0116/EasyDGL official repository 8 samples, 7 ran (0 instrument-failed) · 1 unverified
choice in 13 papers src/dataloader.py ran MIT (permissive) · f7109cad8993a8eb · report fixture: signature seqslen:int/0/int, ignore_head:int/0/int, maskslen:int/0/int · returned ndarray · level recorded 2026-09-24
clip_by_value src/model/EasyDGL.py ran MIT (permissive) · 892cfe044df66e78 · report fixture: signature input_tensor:SymbolicTensor/2/float · returned SymbolicTensor · level recorded 2026-09-24
create_optimizer in 37 papers src/optimization.py ran MIT (permissive) · 00d21fab37524782 · report fixture: signature loss:SymbolicTensor/0/float, init_lr:float/0/float, num_train_steps:int/0/int, num_warmup_steps:int/0/int, use_tpu:bool/0/bool · returned Operation · level recorded 2026-09-24
gelu in 308 papers
census: 43 implementations from 74 papers, 6 distinct outputs on one shared input
src/model/EasyDGL.py ran MIT (permissive) · 54425d58028099f9 · report fixture: signature input_tensor:SymbolicTensor/2/float · returned SymbolicTensor · level recorded 2026-09-24
gelu in 308 papers
census: 43 implementations from 74 papers, 6 distinct outputs on one shared input
src/model/GREC.py ran MIT (permissive) · 31a88827333397cd · report fixture: signature x:SymbolicTensor/2/float · returned SymbolicTensor · level recorded 2026-09-24
initializer src/model/BERT4REC.py ran MIT (permissive) · fa449773d8600eaa · report fixture: signature initializer_range:float/0/float · returned TruncatedNormal · level recorded 2026-09-24
layernorm in 8 papers src/model/Base.py ran MIT (permissive) · a3c3f11075934dfa · report fixture: signature inputs:SymbolicTensor/2/float, center:bool/0/bool, scale:bool/0/bool, activation_fn:callable/0/?, reuse:NoneType/0/?, trainable:bool/0/bool, begin_norm_axis:int/0/int, begin_params_axis:int/0/int, scope:NoneType/0/? · returned SymbolicTensor · level recorded 2026-09-24
ranking src/util.py unverified MIT (permissive) · 598d4ddccc605e02 · report

Tasks

Dynamic Link PredictionDynamic Node ClassificationFraud DetectionGraph LearningLink PredictionNode ClassificationSequential RecommendationTraffic Prediction

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections