{"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/rebar-low-variance-unbiased-gradient","title":"REBAR: Low-variance, unbiased gradient estimates for discrete latent variable models","arxiv_id":"1703.07370","date":"2017-03-21","proceeding":"NeurIPS 2017 12","authors":["George Tucker","andriy mnih","Chris J. Maddison","Dieterich Lawson","Jascha Sohl-Dickstein"],"abstract":"Learning in models with discrete latent variables is challenging due to high\nvariance gradient estimators. Generally, approaches have relied on control\nvariates to reduce the variance of the REINFORCE estimator. Recent work (Jang\net al. 2016, Maddison et al. 2016) has taken a different approach, introducing\na continuous relaxation of discrete variables to produce low-variance, but\nbiased, gradient estimates. In this work, we combine the two approaches through\na novel control variate that produces low-variance, \\emph{unbiased} gradient\nestimates. Then, we introduce a modification to the continuous relaxation and\nshow that the tightness of the relaxation can be adapted online, removing it as\na hyperparameter. We show state-of-the-art variance reduction on several\nbenchmark generative modeling tasks, generally leading to faster convergence to\na better final log-likelihood.","url_abs":"http://arxiv.org/abs/1703.07370v4","url_pdf":"http://arxiv.org/pdf/1703.07370v4.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":"rebar-low-variance-unbiased-gradient","repo_url":"https://github.com/tensorflow/models","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null},{"paper_slug":"rebar-low-variance-unbiased-gradient","repo_url":"https://github.com/TalkToTheGAN/REGAN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"rebar-low-variance-unbiased-gradient","repo_url":"https://github.com/tensorflow/models/tree/master/research/rebar","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[],"methods":[{"method_slug":"reinforce","method_name":"REINFORCE"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1703.07370","atlas_url":"https://app.syntology.ai/?focus=1703.07370","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":"1703.07370"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1703.07370\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1703.07370"},"call":"get_concepts_for_paper(arxiv_id=\"1703.07370\")"}],"by_repo":[{"repo":"tensorflow/models","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["1502.03167","1512.03385","1605.07146","1704.04861"],"harvested_for_calls":[{"arxiv_id":"1502.03167","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1502.03167"},"call":"get_harvested_code_for_paper(arxiv_id=\"1502.03167\")"},{"arxiv_id":"1512.03385","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1512.03385"},"call":"get_harvested_code_for_paper(arxiv_id=\"1512.03385\")"},{"arxiv_id":"1605.07146","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1605.07146"},"call":"get_harvested_code_for_paper(arxiv_id=\"1605.07146\")"},{"arxiv_id":"1704.04861","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1704.04861"},"call":"get_harvested_code_for_paper(arxiv_id=\"1704.04861\")"}]},{"repo":"TalkToTheGAN/REGAN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"71d90d22f35383dbc671c82389f457ad8704fe5f6751aec854b4c40196c49e60","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}