{"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/stochastic-variance-reduced-policy-gradient","title":"Stochastic Variance-Reduced Policy Gradient","arxiv_id":"1806.05618","date":"2018-06-14","proceeding":"ICML 2018 7","authors":["Matteo Papini","Damiano Binaghi","Giuseppe Canonaco","Matteo Pirotta","Marcello Restelli"],"abstract":"In this paper, we propose a novel reinforcement- learning algorithm\nconsisting in a stochastic variance-reduced version of policy gradient for\nsolving Markov Decision Processes (MDPs). Stochastic variance-reduced gradient\n(SVRG) methods have proven to be very successful in supervised learning.\nHowever, their adaptation to policy gradient is not straightforward and needs\nto account for I) a non-concave objective func- tion; II) approximations in the\nfull gradient com- putation; and III) a non-stationary sampling pro- cess. The\nresult is SVRPG, a stochastic variance- reduced policy gradient algorithm that\nleverages on importance weights to preserve the unbiased- ness of the gradient\nestimate. Under standard as- sumptions on the MDP, we provide convergence\nguarantees for SVRPG with a convergence rate that is linear under increasing\nbatch sizes. Finally, we suggest practical variants of SVRPG, and we\nempirically evaluate them on continuous MDPs.","url_abs":"http://arxiv.org/abs/1806.05618v1","url_pdf":"http://arxiv.org/pdf/1806.05618v1.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":"stochastic-variance-reduced-policy-gradient","repo_url":"https://github.com/Dam930/rllab","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1806.05618","atlas_url":"https://app.syntology.ai/?focus=1806.05618","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":"1806.05618"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1806.05618\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1806.05618"},"call":"get_concepts_for_paper(arxiv_id=\"1806.05618\")"}],"by_repo":[{"repo":"Dam930/rllab","kind":"official","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":"0e4b46d76eb24ef5c2f3b50142e60a598d17515a5898628bd11e34a28345a7c0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}