{"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/fixing-a-broken-elbo","title":"Fixing a Broken ELBO","arxiv_id":"1711.00464","date":"2017-11-01","proceeding":"ICML 2018 7","authors":["Alexander A. Alemi","Ben Poole","Ian Fischer","Joshua V. Dillon","Rif A. Saurous","Kevin Murphy"],"abstract":"Recent work in unsupervised representation learning has focused on learning\ndeep directed latent-variable models. Fitting these models by maximizing the\nmarginal likelihood or evidence is typically intractable, thus a common\napproximation is to maximize the evidence lower bound (ELBO) instead. However,\nmaximum likelihood training (whether exact or approximate) does not necessarily\nresult in a good latent representation, as we demonstrate both theoretically\nand empirically. In particular, we derive variational lower and upper bounds on\nthe mutual information between the input and the latent variable, and use these\nbounds to derive a rate-distortion curve that characterizes the tradeoff\nbetween compression and reconstruction accuracy. Using this framework, we\ndemonstrate that there is a family of models with identical ELBO, but different\nquantitative and qualitative characteristics. Our framework also suggests a\nsimple new method to ensure that latent variable models with powerful\nstochastic decoders do not ignore their latent code.","url_abs":"http://arxiv.org/abs/1711.00464v3","url_pdf":"http://arxiv.org/pdf/1711.00464v3.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":"fixing-a-broken-elbo","repo_url":"https://github.com/suvalaki/Deeper","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1711.00464","atlas_url":"https://app.syntology.ai/?focus=1711.00464","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":"1711.00464"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1711.00464\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1711.00464"},"call":"get_concepts_for_paper(arxiv_id=\"1711.00464\")"}],"by_repo":[{"repo":"suvalaki/Deeper","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":"ba5c8fcb5695919f1a100a34764d5481fb4ed8eeea4a8005a656112de484b972","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}