{"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-q-learning-from-demonstrations","title":"Deep Q-learning from Demonstrations","arxiv_id":"1704.03732","date":"2017-04-12","proceeding":null,"authors":["Todd Hester","Matej Vecerik","Olivier Pietquin","Marc Lanctot","Tom Schaul","Bilal Piot","Dan Horgan","John Quan","Andrew Sendonaris","Gabriel Dulac-Arnold","Ian Osband","John Agapiou","Joel Z. Leibo","Audrunas Gruslys"],"abstract":"Deep reinforcement learning (RL) has achieved several high profile successes\nin difficult decision-making problems. However, these algorithms typically\nrequire a huge amount of data before they reach reasonable performance. In\nfact, their performance during learning can be extremely poor. This may be\nacceptable for a simulator, but it severely limits the applicability of deep RL\nto many real-world tasks, where the agent must learn in the real environment.\nIn this paper we study a setting where the agent may access data from previous\ncontrol of the system. We present an algorithm, Deep Q-learning from\nDemonstrations (DQfD), that leverages small sets of demonstration data to\nmassively accelerate the learning process even from relatively small amounts of\ndemonstration data and is able to automatically assess the necessary ratio of\ndemonstration data while learning thanks to a prioritized replay mechanism.\nDQfD works by combining temporal difference updates with supervised\nclassification of the demonstrator's actions. We show that DQfD has better\ninitial performance than Prioritized Dueling Double Deep Q-Networks (PDD DQN)\nas it starts with better scores on the first million steps on 41 of 42 games\nand on average it takes PDD DQN 83 million steps to catch up to DQfD's\nperformance. DQfD learns to out-perform the best demonstration given in 14 of\n42 games. In addition, DQfD leverages human demonstrations to achieve\nstate-of-the-art results for 11 games. Finally, we show that DQfD performs\nbetter than three related algorithms for incorporating demonstration data into\nDQN.","url_abs":"http://arxiv.org/abs/1704.03732v4","url_pdf":"http://arxiv.org/pdf/1704.03732v4.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-q-learning-from-demonstrations","repo_url":"https://github.com/AurelianTactics/dqfd-with-keras","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"deep-q-learning-from-demonstrations","repo_url":"https://github.com/LilTwo/DRL-using-PyTorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"deep-q-learning-from-demonstrations","repo_url":"https://github.com/asjad99/Reinforcement-Learning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"deep-q-learning-from-demonstrations","repo_url":"https://github.com/hw9603/DQfD-PyTorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"deep-q-learning-from-demonstrations","repo_url":"https://github.com/opendilab/DI-engine","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"deep-q-learning-from-demonstrations","repo_url":"https://github.com/tenvinc/CS4246-Project","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"decision-making","task_name":"Decision Making"},{"task_slug":"deep-reinforcement-learning","task_name":"Deep Reinforcement Learning"},{"task_slug":"imitation-learning","task_name":"Imitation Learning"},{"task_slug":"q-learning","task_name":"Q-Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"}],"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":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1704.03732","atlas_url":"https://app.syntology.ai/?focus=1704.03732","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":"1704.03732"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1704.03732\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1704.03732"},"call":"get_concepts_for_paper(arxiv_id=\"1704.03732\")"}],"by_repo":[{"repo":"AurelianTactics/dqfd-with-keras","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"LilTwo/DRL-using-PyTorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"asjad99/Reinforcement-Learning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"hw9603/DQfD-PyTorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"opendilab/DI-engine","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["1707.01495","1901.02860","2106.01345","2304.12824"],"harvested_for_calls":[{"arxiv_id":"1707.01495","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1707.01495"},"call":"get_harvested_code_for_paper(arxiv_id=\"1707.01495\")"},{"arxiv_id":"1901.02860","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1901.02860"},"call":"get_harvested_code_for_paper(arxiv_id=\"1901.02860\")"},{"arxiv_id":"2106.01345","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.01345"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.01345\")"},{"arxiv_id":"2304.12824","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2304.12824"},"call":"get_harvested_code_for_paper(arxiv_id=\"2304.12824\")"}]},{"repo":"tenvinc/CS4246-Project","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1707.01495"],"harvested_for_calls":[{"arxiv_id":"1707.01495","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1707.01495"},"call":"get_harvested_code_for_paper(arxiv_id=\"1707.01495\")"}]}],"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":"61d815f06b00d5bf510d205d3fcca587823adfc32ec25106fd8f6ef5af722f36","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}