{"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/token-turing-machines","title":"Token Turing Machines","arxiv_id":"2211.09119","date":"2022-11-16","proceeding":"CVPR 2023 1","authors":["Michael S. Ryoo","Keerthana Gopalakrishnan","Kumara Kahatapitiya","Ted Xiao","Kanishka Rao","Austin Stone","Yao Lu","Julian Ibarz","Anurag Arnab"],"abstract":"We propose Token Turing Machines (TTM), a sequential, autoregressive Transformer model with memory for real-world sequential visual understanding. Our model is inspired by the seminal Neural Turing Machine, and has an external memory consisting of a set of tokens which summarise the previous history (i.e., frames). This memory is efficiently addressed, read and written using a Transformer as the processing unit/controller at each step. The model's memory module ensures that a new observation will only be processed with the contents of the memory (and not the entire history), meaning that it can efficiently process long sequences with a bounded computational cost at each step. We show that TTM outperforms other alternatives, such as other Transformer models designed for long sequences and recurrent neural networks, on two real-world sequential visual understanding tasks: online temporal activity detection from videos and vision-based robot action policy learning. Code is publicly available at: https://github.com/google-research/scenic/tree/main/scenic/projects/token_turing","url_abs":"https://arxiv.org/abs/2211.09119v2","url_pdf":"https://arxiv.org/pdf/2211.09119v2.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":"token-turing-machines","repo_url":"https://github.com/google-research/scenic","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"jax","reach":null}],"tasks":[{"task_slug":"action-detection","task_name":"Action Detection"},{"task_slug":"activity-detection","task_name":"Activity Detection"}],"methods":[{"method_slug":"absolute-position-encodings","method_name":"Absolute Position Encodings"},{"method_slug":"adam","method_name":"Adam"},{"method_slug":"attention","method_name":"Attention"},{"method_slug":"bpe","method_name":"BPE"},{"method_slug":"content-based-attention","method_name":"Content-based Attention"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"label-smoothing","method_name":"Label Smoothing"},{"method_slug":"layer-normalization","method_name":"Layer Normalization"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"location-based-attention","method_name":"Location-based Attention"},{"method_slug":"multi-head-attention","method_name":"Multi-Head Attention"},{"method_slug":"neural-turing-machine","method_name":"Neural Turing Machine"},{"method_slug":"position-wise-feed-forward-layer","method_name":"Position-Wise Feed-Forward Layer"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"},{"method_slug":"transformer","method_name":"Transformer"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/action-detection-on-charades","task":"Action Detection","dataset":"Charades","model":"TTM","rank_in_archive_order":1,"of":16,"metrics":{"mAP":"28.79"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2211.09119","atlas_url":"https://app.syntology.ai/?focus=2211.09119","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":"2211.09119"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2211.09119\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2211.09119"},"call":"get_concepts_for_paper(arxiv_id=\"2211.09119\")"}],"by_repo":[{"repo":"google-research/scenic","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":6,"harvested_for":["2106.11297","2202.02200","2212.02400","2301.13195","2304.06708","2402.02887"],"harvested_for_calls":[{"arxiv_id":"2106.11297","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.11297"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.11297\")"},{"arxiv_id":"2202.02200","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2202.02200"},"call":"get_harvested_code_for_paper(arxiv_id=\"2202.02200\")"},{"arxiv_id":"2212.02400","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2212.02400"},"call":"get_harvested_code_for_paper(arxiv_id=\"2212.02400\")"},{"arxiv_id":"2301.13195","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2301.13195"},"call":"get_harvested_code_for_paper(arxiv_id=\"2301.13195\")"},{"arxiv_id":"2304.06708","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2304.06708"},"call":"get_harvested_code_for_paper(arxiv_id=\"2304.06708\")"},{"arxiv_id":"2402.02887","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2402.02887"},"call":"get_harvested_code_for_paper(arxiv_id=\"2402.02887\")"}]}],"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":"4b828b3d81f3043c3f40b0293d669ff51c1b8ea6bae0ffc2cc7bf51fa2a9eb73","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}