{"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/deep-attention-recurrent-q-network","title":"Deep Attention Recurrent Q-Network","arxiv_id":"1512.01693","date":"2015-12-05","proceeding":null,"authors":["Ivan Sorokin","Alexey Seleznev","Mikhail Pavlov","Aleksandr Fedorov","Anastasiia Ignateva"],"abstract":"A deep learning approach to reinforcement learning led to a general learner\nable to train on visual input to play a variety of arcade games at the human\nand superhuman levels. Its creators at the Google DeepMind's team called the\napproach: Deep Q-Network (DQN). We present an extension of DQN by \"soft\" and\n\"hard\" attention mechanisms. Tests of the proposed Deep Attention Recurrent\nQ-Network (DARQN) algorithm on multiple Atari 2600 games show level of\nperformance superior to that of DQN. Moreover, built-in attention mechanisms\nallow a direct online monitoring of the training process by highlighting the\nregions of the game screen the agent is focusing on when making decisions.","url_abs":"http://arxiv.org/abs/1512.01693v1","url_pdf":"http://arxiv.org/pdf/1512.01693v1.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":"deep-attention-recurrent-q-network","repo_url":"https://github.com/5vision/DARQN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"deep-attention-recurrent-q-network","repo_url":"https://github.com/ulstu/ml","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"deep-attention-recurrent-q-network","repo_url":"https://github.com/ulstu/robotics_ml","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"atari-games","task_name":"Atari Games"},{"task_slug":"deep-attention","task_name":"Deep Attention"},{"task_slug":"hard-attention","task_name":"Hard Attention"},{"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":[{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dqn","method_name":"DQN"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"q-learning","method_name":"Q-Learning"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/atari-games-on-atari-2600-breakout","task":"Atari Games","dataset":"Atari 2600 Breakout","model":"DARQN hard","rank_in_archive_order":51,"of":58,"metrics":{"Score":"20"},"uses_additional_data":false},{"leaderboard":"/sota/atari-games-on-atari-2600-gopher","task":"Atari Games","dataset":"Atari 2600 Gopher","model":"DARQN soft","rank_in_archive_order":37,"of":43,"metrics":{"Score":"5356"},"uses_additional_data":false},{"leaderboard":"/sota/atari-games-on-atari-2600-seaquest","task":"Atari Games","dataset":"Atari 2600 Seaquest","model":"DARQN soft","rank_in_archive_order":28,"of":57,"metrics":{"Score":"7263"},"uses_additional_data":false},{"leaderboard":"/sota/atari-games-on-atari-2600-space-invaders","task":"Atari Games","dataset":"Atari 2600 Space Invaders","model":"DARQN soft","rank_in_archive_order":50,"of":55,"metrics":{"Score":"650"},"uses_additional_data":false},{"leaderboard":"/sota/atari-games-on-atari-2600-tutankham","task":"Atari Games","dataset":"Atari 2600 Tutankham","model":"DARQN soft","rank_in_archive_order":25,"of":44,"metrics":{"Score":"197"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1512.01693","atlas_url":"https://app.syntology.ai/?focus=1512.01693","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":"1512.01693"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1512.01693\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1512.01693"},"call":"get_concepts_for_paper(arxiv_id=\"1512.01693\")"}],"by_repo":[{"repo":"5vision/DARQN","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ulstu/ml","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ulstu/robotics_ml","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":"cf403f20e2b24490b60046ea61a80b9ce5e93ec6196bd761be80ad92c048f10f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}