{"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":"/method/memory-network/papers/ran/1","list_of":"/method/memory-network","method":"Memory Network","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not isolate this method inside it.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,24],"of":24,"counts":{"archive_papers_tagged":445,"with_a_code_link":146,"where_syntology_ran_a_sample":24,"not_listed_spam_title":0,"listed":445,"listed_where_code_ran":24,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":19,"every_run_a_failure_of_syntologys_instrument":5,"listed_with_a_run_with_no_instrument_failure":19,"listed_every_run_a_failure_of_syntologys_instrument":5,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/method/memory-network/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/a-mem-agentic-memory-for-llm-agents","slug":"a-mem-agentic-memory-for-llm-agents","title":"A-MEM: Agentic Memory for LLM Agents","date":"2025-02-17","arxiv_id":"2502.12110","n_code_links":4,"syntology":{"ran":7,"of":10,"n_ran_checked":7,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"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) · 3 unverified","official":{"repos":["agiresearch/a-mem","wujiangxu/agenticmemory"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/mobility-llm-learning-visiting-intentions-and","slug":"mobility-llm-learning-visiting-intentions-and","title":"Mobility-LLM: Learning Visiting Intentions and Travel Preferences from Human Mobility Data with Large Language Models","date":"2024-10-29","arxiv_id":"2411.00823","n_code_links":1,"syntology":{"ran":7,"of":10,"n_ran_checked":7,"n_instrument":0,"unverified":3,"pointer_only":10,"phrase":"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) · 3 unverified","official":{"repos":["LetianGong/Mobility-LLM"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/memoria-hebbian-memory-architecture-for-human","slug":"memoria-hebbian-memory-architecture-for-human","title":"Memoria: Resolving Fateful Forgetting Problem through Human-Inspired Memory Architecture","date":"2023-10-04","arxiv_id":"2310.03052","n_code_links":1,"syntology":{"ran":1,"of":10,"n_ran_checked":0,"n_instrument":1,"unverified":9,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 9 unverified","official":{"repos":["cosmoquester/memoria"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":9,"ran_from_kinds":["official"]}}},{"paper":"/paper/multi-relational-contrastive-learning-for","slug":"multi-relational-contrastive-learning-for","title":"Multi-Relational Contrastive Learning for Recommendation","date":"2023-09-03","arxiv_id":"2309.01103","n_code_links":1,"syntology":{"ran":3,"of":8,"n_ran_checked":3,"n_instrument":0,"unverified":5,"pointer_only":8,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":{"repos":["HKUDS/RCL"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/intrinsic-motivation-via-surprise-memory","slug":"intrinsic-motivation-via-surprise-memory","title":"Beyond Surprise: Improving Exploration Through Surprise Novelty","date":"2023-08-09","arxiv_id":"2308.04836","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":4,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["thaihungle/sm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/global-spectral-filter-memory-network-for","slug":"global-spectral-filter-memory-network-for","title":"Global Spectral Filter Memory Network for Video Object Segmentation","date":"2022-10-11","arxiv_id":"2210.05567","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["workforai/gsfm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/multi-modality-associative-bridging-through-1","slug":"multi-modality-associative-bridging-through-1","title":"Multi-modality Associative Bridging through Memory: Speech Sound Recollected from Face Video","date":"2022-04-04","arxiv_id":"2204.01265","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","official":null}},{"paper":"/paper/online-unsupervised-learning-of-visual","slug":"online-unsupervised-learning-of-visual","title":"Online Unsupervised Learning of Visual Representations and Categories","date":"2021-09-13","arxiv_id":"2109.05675","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["renmengye/online-unsup-proto-net"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/phycrnet-physics-informed-convolutional","slug":"phycrnet-physics-informed-convolutional","title":"PhyCRNet: Physics-informed Convolutional-Recurrent Network for Solving Spatiotemporal PDEs","date":"2021-06-26","arxiv_id":"2106.14103","n_code_links":3,"syntology":{"ran":5,"of":8,"n_ran_checked":3,"n_instrument":2,"unverified":3,"pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["isds-neu/PhyCRNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official","unlocated"]}}},{"paper":"/paper/memory-guided-unsupervised-image-to-image","slug":"memory-guided-unsupervised-image-to-image","title":"Memory-guided Unsupervised Image-to-image Translation","date":"2021-04-12","arxiv_id":"2104.05170","n_code_links":0,"syntology":{"ran":20,"of":25,"n_ran_checked":14,"n_instrument":6,"unverified":5,"pointer_only":25,"phrase":"20 ran (of which 14 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 6 where Syntology's instrument failed) · 5 unverified","official":null}},{"paper":"/paper/stmtrack-template-free-visual-tracking-with","slug":"stmtrack-template-free-visual-tracking-with","title":"STMTrack: Template-free Visual Tracking with Space-time Memory Networks","date":"2021-04-01","arxiv_id":"2104.00324","n_code_links":1,"syntology":{"ran":8,"of":11,"n_ran_checked":2,"n_instrument":6,"unverified":3,"pointer_only":0,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified","official":{"repos":["fzh0917/STMTrack"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/memory-based-graph-networks-1","slug":"memory-based-graph-networks-1","title":"Memory-Based Graph Networks","date":"2020-02-21","arxiv_id":"2002.09518","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["amirkhas/GraphMemoryNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/neural-subgraph-isomorphism-counting-1","slug":"neural-subgraph-isomorphism-counting-1","title":"Neural Subgraph Isomorphism Counting","date":"2019-12-25","arxiv_id":"1912.11589","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["HKUST-KnowComp/NeuralSubgraphCounting"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/unsupervised-scene-adaptation-with-memory","slug":"unsupervised-scene-adaptation-with-memory","title":"Unsupervised Scene Adaptation with Memory Regularization in vivo","date":"2019-12-24","arxiv_id":"1912.11164","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["layumi/Seg-Uncertainty"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/hierarchical-contextualized-representation","slug":"hierarchical-contextualized-representation","title":"Hierarchical Contextualized Representation for Named Entity Recognition","date":"2019-11-06","arxiv_id":"1911.02257","n_code_links":1,"syntology":{"ran":9,"of":9,"n_ran_checked":8,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["cslydia/Hire-NER"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/a-self-attentive-model-for-knowledge-tracing","slug":"a-self-attentive-model-for-knowledge-tracing","title":"A Self-Attentive model for Knowledge Tracing","date":"2019-07-16","arxiv_id":"1907.06837","n_code_links":10,"syntology":{"ran":8,"of":12,"n_ran_checked":4,"n_instrument":4,"unverified":4,"pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 2 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified","official":null}},{"paper":"/paper/bidirectional-attentive-memory-networks-for","slug":"bidirectional-attentive-memory-networks-for","title":"Bidirectional Attentive Memory Networks for Question Answering over Knowledge Bases","date":"2019-03-06","arxiv_id":"1903.02188","n_code_links":2,"syntology":{"ran":9,"of":11,"n_ran_checked":9,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["hugochan/BAMnet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/learning-dynamic-memory-networks-for-object","slug":"learning-dynamic-memory-networks-for-object","title":"Learning Dynamic Memory Networks for Object Tracking","date":"2018-03-20","arxiv_id":"1803.07268","n_code_links":1,"syntology":{"ran":1,"of":7,"n_ran_checked":1,"n_instrument":0,"unverified":6,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","official":{"repos":["skyoung/MemTrack"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":"/paper/memorization-precedes-generation-learning","slug":"memorization-precedes-generation-learning","title":"Memorization Precedes Generation: Learning Unsupervised GANs with Memory Networks","date":"2018-03-05","arxiv_id":"1803.01500","n_code_links":1,"syntology":{"ran":1,"of":6,"n_ran_checked":1,"n_instrument":0,"unverified":5,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":{"repos":["whyjay/memoryGAN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/visual-dialog","slug":"visual-dialog","title":"Visual Dialog","date":"2016-11-26","arxiv_id":"1611.08669","n_code_links":11,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["batra-mlp-lab/visdial-amt-chat"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/gated-end-to-end-memory-networks","slug":"gated-end-to-end-memory-networks","title":"Gated End-to-End Memory Networks","date":"2016-10-13","arxiv_id":"1610.04211","n_code_links":1,"syntology":{"ran":1,"of":6,"n_ran_checked":1,"n_instrument":0,"unverified":5,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":null}},{"paper":"/paper/aspect-level-sentiment-classification-with-1","slug":"aspect-level-sentiment-classification-with-1","title":"Aspect Level Sentiment Classification with Deep Memory Network","date":"2016-05-28","arxiv_id":"1605.08900","n_code_links":8,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":"/paper/dynamic-memory-networks-for-visual-and","slug":"dynamic-memory-networks-for-visual-and","title":"Dynamic Memory Networks for Visual and Textual Question Answering","date":"2016-03-04","arxiv_id":"1603.01417","n_code_links":10,"syntology":{"ran":7,"of":7,"n_ran_checked":0,"n_instrument":7,"unverified":0,"pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/long-short-term-memory-networks-for-machine","slug":"long-short-term-memory-networks-for-machine","title":"Long Short-Term Memory-Networks for Machine Reading","date":"2016-01-25","arxiv_id":"1601.06733","n_code_links":3,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":null}}],"record_sha256":"33ddbc7241aba4e02164572c9bcb75f69c184fe26f7fb57afbcfb78052d2338f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}