{"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/dynamic-computational-time-for-visual","title":"Dynamic Computational Time for Visual Attention","arxiv_id":"1703.10332","date":"2017-03-30","proceeding":null,"authors":["Zhichao Li","Yi Yang","Xiao Liu","Feng Zhou","Shilei Wen","Wei Xu"],"abstract":"We propose a dynamic computational time model to accelerate the average\nprocessing time for recurrent visual attention (RAM). Rather than attention\nwith a fixed number of steps for each input image, the model learns to decide\nwhen to stop on the fly. To achieve this, we add an additional continue/stop\naction per time step to RAM and use reinforcement learning to learn both the\noptimal attention policy and stopping policy. The modification is simple but\ncould dramatically save the average computational time while keeping the same\nrecognition performance as RAM. Experimental results on CUB-200-2011 and\nStanford Cars dataset demonstrate the dynamic computational model can work\neffectively for fine-grained image recognition.The source code of this paper\ncan be obtained from https://github.com/baidu-research/DT-RAM","url_abs":"http://arxiv.org/abs/1703.10332v3","url_pdf":"http://arxiv.org/pdf/1703.10332v3.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":"dynamic-computational-time-for-visual","repo_url":"https://github.com/baidu-research/DT-RAM","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"torch","reach":{"status":"ok"}},{"paper_slug":"dynamic-computational-time-for-visual","repo_url":"https://github.com/kiwi1944/CRISense","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1703.10332","atlas_url":"https://app.syntology.ai/?focus=1703.10332","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":"1703.10332"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1703.10332\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1703.10332"},"call":"get_concepts_for_paper(arxiv_id=\"1703.10332\")"}],"by_repo":[{"repo":"baidu-research/DT-RAM","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"kiwi1944/CRISense","kind":"listed","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":"388a5c741064aa668e9cb4b056409ee256e80bb3b04423dad709395109b418e6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}