{"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/transfer-learning-for-temporal-link","title":"Transfer Learning for Temporal Link Prediction","arxiv_id":"2504.10925","date":"2025-04-15","proceeding":null,"authors":["Ayan Chatterjee","Barbara Ikica","Babak Ravandi","John Palowitch"],"abstract":"Link prediction on graphs has applications spanning from recommender systems to drug discovery. Temporal link prediction (TLP) refers to predicting future links in a temporally evolving graph and adds additional complexity related to the dynamic nature of graphs. State-of-the-art TLP models incorporate memory modules alongside graph neural networks to learn both the temporal mechanisms of incoming nodes and the evolving graph topology. However, memory modules only store information about nodes seen at train time, and hence such models cannot be directly transferred to entirely new graphs at test time and deployment. In this work, we study a new transfer learning task for temporal link prediction, and develop transfer-effective methods for memory-laden models. Specifically, motivated by work showing the informativeness of structural signals for the TLP task, we augment a structural mapping module to the existing TLP model architectures, which learns a mapping from graph structural (topological) features to memory embeddings. Our work paves the way for a memory-free foundation model for TLP.","url_abs":"https://arxiv.org/abs/2504.10925v2","url_pdf":"https://arxiv.org/pdf/2504.10925v2.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":"transfer-learning-for-temporal-link","repo_url":"https://github.com/google-research/google-research/tree/master/fm4tlp","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"jax","reach":null}],"tasks":[{"task_slug":"drug-discovery","task_name":"Drug Discovery"},{"task_slug":"informativeness","task_name":"Informativeness"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"google-research/google-research","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":24,"harvested_for":["1802.03268","2003.12022","2004.13912","2006.04678","2006.15055","2007.07314","2009.14794","2104.04657","2105.01237","2106.03314","2106.03760","2106.11905","2107.05768","2110.11346","2111.06888","2201.08896","2202.00512","2209.14881","2210.15458","2303.00732","2305.07011","2305.16381","2310.18893","2405.05349"],"harvested_for_calls":[{"arxiv_id":"1802.03268","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.03268"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.03268\")"},{"arxiv_id":"2003.12022","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2003.12022"},"call":"get_harvested_code_for_paper(arxiv_id=\"2003.12022\")"},{"arxiv_id":"2004.13912","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2004.13912"},"call":"get_harvested_code_for_paper(arxiv_id=\"2004.13912\")"},{"arxiv_id":"2006.04678","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.04678"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.04678\")"},{"arxiv_id":"2006.15055","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.15055"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.15055\")"},{"arxiv_id":"2007.07314","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.07314"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.07314\")"},{"arxiv_id":"2009.14794","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2009.14794"},"call":"get_harvested_code_for_paper(arxiv_id=\"2009.14794\")"},{"arxiv_id":"2104.04657","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2104.04657"},"call":"get_harvested_code_for_paper(arxiv_id=\"2104.04657\")"},{"arxiv_id":"2105.01237","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.01237"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.01237\")"},{"arxiv_id":"2106.03314","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.03314"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.03314\")"},{"arxiv_id":"2106.03760","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.03760"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.03760\")"},{"arxiv_id":"2106.11905","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.11905"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.11905\")"},{"arxiv_id":"2107.05768","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2107.05768"},"call":"get_harvested_code_for_paper(arxiv_id=\"2107.05768\")"},{"arxiv_id":"2110.11346","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.11346"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.11346\")"},{"arxiv_id":"2111.06888","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2111.06888"},"call":"get_harvested_code_for_paper(arxiv_id=\"2111.06888\")"},{"arxiv_id":"2201.08896","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2201.08896"},"call":"get_harvested_code_for_paper(arxiv_id=\"2201.08896\")"},{"arxiv_id":"2202.00512","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2202.00512"},"call":"get_harvested_code_for_paper(arxiv_id=\"2202.00512\")"},{"arxiv_id":"2209.14881","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2209.14881"},"call":"get_harvested_code_for_paper(arxiv_id=\"2209.14881\")"},{"arxiv_id":"2210.15458","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.15458"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.15458\")"},{"arxiv_id":"2303.00732","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2303.00732"},"call":"get_harvested_code_for_paper(arxiv_id=\"2303.00732\")"},{"arxiv_id":"2305.07011","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.07011"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.07011\")"},{"arxiv_id":"2305.16381","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.16381"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.16381\")"},{"arxiv_id":"2310.18893","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2310.18893"},"call":"get_harvested_code_for_paper(arxiv_id=\"2310.18893\")"},{"arxiv_id":"2405.05349","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2405.05349"},"call":"get_harvested_code_for_paper(arxiv_id=\"2405.05349\")"}]}],"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":"d27e1ccc8cef45c2f070165298316b9ee47af7234c16645906a17d54f588677f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}