{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/dyg2vec-representation-learning-for-dynamic","title":"DyG2Vec: Efficient Representation Learning for Dynamic Graphs","arxiv_id":"2210.16906","date":"2022-10-30","proceeding":null,"authors":["Mohammad Ali Alomrani","Mahdi Biparva","Yingxue Zhang","Mark Coates"],"abstract":"Temporal graph neural networks have shown promising results in learning inductive representations by automatically extracting temporal patterns. However, previous works often rely on complex memory modules or inefficient random walk methods to construct temporal representations. To address these limitations, we present an efficient yet effective attention-based encoder that leverages temporal edge encodings and window-based subgraph sampling to generate task-agnostic embeddings. Moreover, we propose a joint-embedding architecture using non-contrastive SSL to learn rich temporal embeddings without labels. Experimental results on 7 benchmark datasets indicate that on average, our model outperforms SoTA baselines on the future link prediction task by 4.23% for the transductive setting and 3.30% for the inductive setting while only requiring 5-10x less training/inference time. Lastly, different aspects of the proposed framework are investigated through experimental analysis and ablation studies. The code is publicly available at https://github.com/huawei-noah/noah-research/tree/master/graph_atlas.","url_abs":"https://arxiv.org/abs/2210.16906v3","url_pdf":"https://arxiv.org/pdf/2210.16906v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"dyg2vec-representation-learning-for-dynamic","repo_url":"https://github.com/huawei-noah/noah-research","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"dyg2vec-representation-learning-for-dynamic","repo_url":"https://github.com/huawei-noah/noah-research/tree/master/graph_atlas","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"dynamic-link-prediction","task_name":"Dynamic Link Prediction"},{"task_slug":"dynamic-node-classification","task_name":"Dynamic Node Classification"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"representation-learning","task_name":"Representation Learning"},{"task_slug":"self-supervised-learning","task_name":"Self-Supervised Learning"}],"methods":[{"method_slug":"tgn","method_name":"TGN"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/dynamic-link-prediction-on-enron","task":"Dynamic Link Prediction","dataset":"Enron","model":"DyG2Vec","rank_in_archive_order":1,"of":1,"metrics":{"AP":"99.1"},"uses_additional_data":false},{"leaderboard":"/sota/dynamic-link-prediction-on-lastfm","task":"Dynamic Link Prediction","dataset":"LastFM","model":"DyG2Vec","rank_in_archive_order":1,"of":1,"metrics":{"AP":"96"},"uses_additional_data":false},{"leaderboard":"/sota/dynamic-link-prediction-on-mooc","task":"Dynamic Link Prediction","dataset":"MOOC","model":"DyG2Vec","rank_in_archive_order":1,"of":1,"metrics":{"AP":"98"},"uses_additional_data":false},{"leaderboard":"/sota/dynamic-link-prediction-on-reddit","task":"Dynamic Link Prediction","dataset":"Reddit","model":"DyG2Vec","rank_in_archive_order":1,"of":1,"metrics":{"AP":"99.6"},"uses_additional_data":false},{"leaderboard":"/sota/dynamic-link-prediction-on-social-evolution","task":"Dynamic Link Prediction","dataset":"Social Evolution","model":"DyG2Vec","rank_in_archive_order":1,"of":1,"metrics":{"AP":"98.7"},"uses_additional_data":false},{"leaderboard":"/sota/dynamic-link-prediction-on-uci","task":"Dynamic Link Prediction","dataset":"UCI","model":"DyG2Vec","rank_in_archive_order":1,"of":1,"metrics":{"AP":"98.8"},"uses_additional_data":false},{"leaderboard":"/sota/dynamic-link-prediction-on-wikipedia","task":"Dynamic Link Prediction","dataset":"Wikipedia","model":"DyG2Vec","rank_in_archive_order":1,"of":1,"metrics":{"AP":"99.5"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2210.16906","atlas_url":"https://app.syntology.ai/?focus=2210.16906","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2210.16906"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2210.16906\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2210.16906"},"call":"get_concepts_for_paper(arxiv_id=\"2210.16906\")"}],"by_repo":[{"repo":"huawei-noah/noah-research","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2204.08721"],"harvested_for_calls":[{"arxiv_id":"2204.08721","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2204.08721"},"call":"get_harvested_code_for_paper(arxiv_id=\"2204.08721\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"aa2a62f52c89148b1be398b039c7e3fdbbc21e9498d038ceb06ae068803d9a51","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}