{"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/gradient-estimation-using-stochastic","title":"Gradient Estimation Using Stochastic Computation Graphs","arxiv_id":"1506.05254","date":"2015-06-17","proceeding":"NeurIPS 2015 12","authors":["John Schulman","Nicolas Heess","Theophane Weber","Pieter Abbeel"],"abstract":"In a variety of problems originating in supervised, unsupervised, and\nreinforcement learning, the loss function is defined by an expectation over a\ncollection of random variables, which might be part of a probabilistic model or\nthe external world. Estimating the gradient of this loss function, using\nsamples, lies at the core of gradient-based learning algorithms for these\nproblems. We introduce the formalism of stochastic computation\ngraphs---directed acyclic graphs that include both deterministic functions and\nconditional probability distributions---and describe how to easily and\nautomatically derive an unbiased estimator of the loss function's gradient. The\nresulting algorithm for computing the gradient estimator is a simple\nmodification of the standard backpropagation algorithm. The generic scheme we\npropose unifies estimators derived in variety of prior work, along with\nvariance-reduction techniques therein. It could assist researchers in\ndeveloping intricate models involving a combination of stochastic and\ndeterministic operations, enabling, for example, attention, memory, and control\nactions.","url_abs":"http://arxiv.org/abs/1506.05254v3","url_pdf":"http://arxiv.org/pdf/1506.05254v3.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":"gradient-estimation-using-stochastic","repo_url":"https://github.com/caravagn/GDA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1506.05254","atlas_url":"https://app.syntology.ai/?focus=1506.05254","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":"1506.05254"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1506.05254\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1506.05254"},"call":"get_concepts_for_paper(arxiv_id=\"1506.05254\")"}],"by_repo":[{"repo":"caravagn/GDA","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":"33547e40edb0e761868840c19e29b64deee29e2f0b1a8584fe43ff7f2cc94b94","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}