{"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/q-prop-sample-efficient-policy-gradient-with","title":"Q-Prop: Sample-Efficient Policy Gradient with An Off-Policy Critic","arxiv_id":"1611.02247","date":"2016-11-07","proceeding":null,"authors":["Shixiang Gu","Timothy Lillicrap","Zoubin Ghahramani","Richard E. Turner","Sergey Levine"],"abstract":"Model-free deep reinforcement learning (RL) methods have been successful in a\nwide variety of simulated domains. However, a major obstacle facing deep RL in\nthe real world is their high sample complexity. Batch policy gradient methods\noffer stable learning, but at the cost of high variance, which often requires\nlarge batches. TD-style methods, such as off-policy actor-critic and\nQ-learning, are more sample-efficient but biased, and often require costly\nhyperparameter sweeps to stabilize. In this work, we aim to develop methods\nthat combine the stability of policy gradients with the efficiency of\noff-policy RL. We present Q-Prop, a policy gradient method that uses a Taylor\nexpansion of the off-policy critic as a control variate. Q-Prop is both sample\nefficient and stable, and effectively combines the benefits of on-policy and\noff-policy methods. We analyze the connection between Q-Prop and existing\nmodel-free algorithms, and use control variate theory to derive two variants of\nQ-Prop with conservative and aggressive adaptation. We show that conservative\nQ-Prop provides substantial gains in sample efficiency over trust region policy\noptimization (TRPO) with generalized advantage estimation (GAE), and improves\nstability over deep deterministic policy gradient (DDPG), the state-of-the-art\non-policy and off-policy methods, on OpenAI Gym's MuJoCo continuous control\nenvironments.","url_abs":"http://arxiv.org/abs/1611.02247v3","url_pdf":"http://arxiv.org/pdf/1611.02247v3.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":"q-prop-sample-efficient-policy-gradient-with","repo_url":"https://github.com/shaneshixiang/rllabplusplus","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"q-prop-sample-efficient-policy-gradient-with","repo_url":"https://github.com/brain-research/mirage-rl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"continuous-control","task_name":"Continuous Control"},{"task_slug":"deep-reinforcement-learning","task_name":"Deep Reinforcement Learning"},{"task_slug":"mujoco","task_name":"MuJoCo"},{"task_slug":"policy-gradient-methods","task_name":"Policy Gradient Methods"},{"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)"},{"task_slug":"continuous-control","task_name":"continuous-control"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1611.02247","atlas_url":"https://app.syntology.ai/?focus=1611.02247","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":"1611.02247"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1611.02247\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1611.02247"},"call":"get_concepts_for_paper(arxiv_id=\"1611.02247\")"}],"by_repo":[{"repo":"shaneshixiang/rllabplusplus","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"brain-research/mirage-rl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1802.10031"],"harvested_for_calls":[{"arxiv_id":"1802.10031","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.10031"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.10031\")"}]}],"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":"94f5cb0dfa44be1bb3a3971092d4823ce696a6c4e4706a6d9e082cb176b409ea","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}