{"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/dice-the-infinitely-differentiable-monte","title":"DiCE: The Infinitely Differentiable Monte-Carlo Estimator","arxiv_id":"1802.05098","date":"2018-02-14","proceeding":null,"authors":["Jakob Foerster","Gregory Farquhar","Maruan Al-Shedivat","Tim Rocktäschel","Eric P. Xing","Shimon Whiteson"],"abstract":"The score function estimator is widely used for estimating gradients of\nstochastic objectives in stochastic computation graphs (SCG), eg, in\nreinforcement learning and meta-learning. While deriving the first-order\ngradient estimators by differentiating a surrogate loss (SL) objective is\ncomputationally and conceptually simple, using the same approach for\nhigher-order derivatives is more challenging. Firstly, analytically deriving\nand implementing such estimators is laborious and not compliant with automatic\ndifferentiation. Secondly, repeatedly applying SL to construct new objectives\nfor each order derivative involves increasingly cumbersome graph manipulations.\nLastly, to match the first-order gradient under differentiation, SL treats part\nof the cost as a fixed sample, which we show leads to missing and wrong terms\nfor estimators of higher-order derivatives. To address all these shortcomings\nin a unified way, we introduce DiCE, which provides a single objective that can\nbe differentiated repeatedly, generating correct estimators of derivatives of\nany order in SCGs. Unlike SL, DiCE relies on automatic differentiation for\nperforming the requisite graph manipulations. We verify the correctness of DiCE\nboth through a proof and numerical evaluation of the DiCE derivative estimates.\nWe also use DiCE to propose and evaluate a novel approach for multi-agent\nlearning. Our code is available at https://www.github.com/alshedivat/lola.","url_abs":"http://arxiv.org/abs/1802.05098v3","url_pdf":"http://arxiv.org/pdf/1802.05098v3.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":"dice-the-infinitely-differentiable-monte","repo_url":"https://github.com/alshedivat/lola","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"dice-the-infinitely-differentiable-monte","repo_url":"https://github.com/alexis-jacq/LOLA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"dice-the-infinitely-differentiable-monte","repo_url":"https://github.com/alexis-jacq/LOLA_DICE","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"dice-the-infinitely-differentiable-monte","repo_url":"https://github.com/longtermrisk/marltoolbox","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"dice-the-infinitely-differentiable-monte","repo_url":"https://github.com/yannbouteiller/gym-airsimdroneracinglab","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"meta-learning","task_name":"Meta-Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.05098","atlas_url":"https://app.syntology.ai/?focus=1802.05098","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":"1802.05098"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.05098\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.05098"},"call":"get_concepts_for_paper(arxiv_id=\"1802.05098\")"}],"by_repo":[{"repo":"alshedivat/lola","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2210.10125"],"harvested_for_calls":[{"arxiv_id":"2210.10125","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.10125"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.10125\")"}]},{"repo":"alexis-jacq/LOLA","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2011.00382"],"harvested_for_calls":[{"arxiv_id":"2011.00382","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2011.00382"},"call":"get_harvested_code_for_paper(arxiv_id=\"2011.00382\")"}]},{"repo":"alexis-jacq/LOLA_DICE","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1709.04326"],"harvested_for_calls":[{"arxiv_id":"1709.04326","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1709.04326"},"call":"get_harvested_code_for_paper(arxiv_id=\"1709.04326\")"}]},{"repo":"longtermrisk/marltoolbox","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1806.04067"],"harvested_for_calls":[{"arxiv_id":"1806.04067","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1806.04067"},"call":"get_harvested_code_for_paper(arxiv_id=\"1806.04067\")"}]},{"repo":"yannbouteiller/gym-airsimdroneracinglab","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1911.04448"],"harvested_for_calls":[{"arxiv_id":"1911.04448","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1911.04448"},"call":"get_harvested_code_for_paper(arxiv_id=\"1911.04448\")"}]}],"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":"d52300cc98e9267e4c652872d5383a304d106e1c6ec34c6dcf4bdcbce25f21e5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}