{"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/leveraging-demonstrations-for-deep","title":"Leveraging Demonstrations for Deep Reinforcement Learning on Robotics Problems with Sparse Rewards","arxiv_id":"1707.08817","date":"2017-07-27","proceeding":null,"authors":["Mel Vecerik","Todd Hester","Jonathan Scholz","Fumin Wang","Olivier Pietquin","Bilal Piot","Nicolas Heess","Thomas Rothörl","Thomas Lampe","Martin Riedmiller"],"abstract":"We propose a general and model-free approach for Reinforcement Learning (RL)\non real robotics with sparse rewards. We build upon the Deep Deterministic\nPolicy Gradient (DDPG) algorithm to use demonstrations. Both demonstrations and\nactual interactions are used to fill a replay buffer and the sampling ratio\nbetween demonstrations and transitions is automatically tuned via a prioritized\nreplay mechanism. Typically, carefully engineered shaping rewards are required\nto enable the agents to efficiently explore on high dimensional control\nproblems such as robotics. They are also required for model-based acceleration\nmethods relying on local solvers such as iLQG (e.g. Guided Policy Search and\nNormalized Advantage Function). The demonstrations replace the need for\ncarefully engineered rewards, and reduce the exploration problem encountered by\nclassical RL approaches in these domains. Demonstrations are collected by a\nrobot kinesthetically force-controlled by a human demonstrator. Results on four\nsimulated insertion tasks show that DDPG from demonstrations out-performs DDPG,\nand does not require engineered rewards. Finally, we demonstrate the method on\na real robotics task consisting of inserting a clip (flexible object) into a\nrigid object.","url_abs":"http://arxiv.org/abs/1707.08817v2","url_pdf":"http://arxiv.org/pdf/1707.08817v2.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":"leveraging-demonstrations-for-deep","repo_url":"https://github.com/MrSyee/pg-is-all-you-need","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"leveraging-demonstrations-for-deep","repo_url":"https://github.com/Zartris/TD3_continuous_control","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"leveraging-demonstrations-for-deep","repo_url":"https://github.com/Zartris/TD3_multi_agent_tennis","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"leveraging-demonstrations-for-deep","repo_url":"https://github.com/kairproject/kair_algorithms_draft","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"deep-reinforcement-learning","task_name":"Deep Reinforcement Learning"},{"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":"adam","method_name":"Adam"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"ddpg","method_name":"DDPG"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"experience-replay","method_name":"Experience Replay"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"weight-decay","method_name":"Weight Decay"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1707.08817","atlas_url":"https://app.syntology.ai/?focus=1707.08817","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":"1707.08817"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1707.08817\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1707.08817"},"call":"get_concepts_for_paper(arxiv_id=\"1707.08817\")"}],"by_repo":[{"repo":"MrSyee/pg-is-all-you-need","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Zartris/TD3_continuous_control","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Zartris/TD3_multi_agent_tennis","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"kairproject/kair_algorithms_draft","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":"a1dbf2bb0ad8fb9ea904639496a6046cdb5257f556cbae1d1e41c6aaec6585e9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}