{"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/dual-memory-neural-computer-for-asynchronous","title":"Dual Memory Neural Computer for Asynchronous Two-view Sequential Learning","arxiv_id":"1802.00662","date":"2018-02-02","proceeding":null,"authors":["Hung Le","Truyen Tran","Svetha Venkatesh"],"abstract":"One of the core tasks in multi-view learning is to capture relations among\nviews. For sequential data, the relations not only span across views, but also\nextend throughout the view length to form long-term intra-view and inter-view\ninteractions. In this paper, we present a new memory augmented neural network\nmodel that aims to model these complex interactions between two asynchronous\nsequential views. Our model uses two encoders for reading from and writing to\ntwo external memories for encoding input views. The intra-view interactions and\nthe long-term dependencies are captured by the use of memories during this\nencoding process. There are two modes of memory accessing in our system:\nlate-fusion and early-fusion, corresponding to late and early inter-view\ninteractions. In the late-fusion mode, the two memories are separated,\ncontaining only view-specific contents. In the early-fusion mode, the two\nmemories share the same addressing space, allowing cross-memory accessing. In\nboth cases, the knowledge from the memories will be combined by a decoder to\nmake predictions over the output space. The resulting dual memory neural\ncomputer is demonstrated on a comprehensive set of experiments, including a\nsynthetic task of summing two sequences and the tasks of drug prescription and\ndisease progression in healthcare. The results demonstrate competitive\nperformance over both traditional algorithms and deep learning methods designed\nfor multi-view problems.","url_abs":"http://arxiv.org/abs/1802.00662v2","url_pdf":"http://arxiv.org/pdf/1802.00662v2.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":"dual-memory-neural-computer-for-asynchronous","repo_url":"https://github.com/thaihungle/DMNC","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"multi-view-learning","task_name":"MULTI-VIEW LEARNING"},{"task_slug":"two","task_name":"Vocal Bursts Valence Prediction"}],"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":"thaihungle/DMNC","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"85d04a9a971d873cc189e85bbde44e8f68b1fedbc13b338604a5e7e3261ee95b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}