{"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/discretely-relaxing-continuous-variables-for","title":"Discretely Relaxing Continuous Variables for tractable Variational Inference","arxiv_id":"1809.04279","date":"2018-09-12","proceeding":"NeurIPS 2018","authors":["Trefor W. Evans","Prasanth B. Nair"],"abstract":"We explore a new research direction in Bayesian variational inference with\ndiscrete latent variable priors where we exploit Kronecker matrix algebra for\nefficient and exact computations of the evidence lower bound (ELBO). The\nproposed \"DIRECT\" approach has several advantages over its predecessors; (i) it\ncan exactly compute ELBO gradients (i.e. unbiased, zero-variance gradient\nestimates), eliminating the need for high-variance stochastic gradient\nestimators and enabling the use of quasi-Newton optimization methods; (ii) its\ntraining complexity is independent of the number of training points, permitting\ninference on large datasets; and (iii) its posterior samples consist of sparse\nand low-precision quantized integers which permit fast inference on hardware\nlimited devices. In addition, our DIRECT models can exactly compute statistical\nmoments of the parameterized predictive posterior without relying on Monte\nCarlo sampling. The DIRECT approach is not practical for all likelihoods,\nhowever, we identify a popular model structure which is practical, and\ndemonstrate accurate inference using latent variables discretized as extremely\nlow-precision 4-bit quantized integers. While the ELBO computations considered\nin the numerical studies require over $10^{2352}$ log-likelihood evaluations,\nwe train on datasets with over two-million points in just seconds.","url_abs":"http://arxiv.org/abs/1809.04279v3","url_pdf":"http://arxiv.org/pdf/1809.04279v3.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":"discretely-relaxing-continuous-variables-for","repo_url":"https://github.com/treforevans/direct","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"discretely-relaxing-continuous-variables-for","repo_url":"https://github.com/treforevans/uci_datasets","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"variational-inference","task_name":"Variational Inference"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"treforevans/direct","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"treforevans/uci_datasets","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2604.20409"],"harvested_for_calls":[{"arxiv_id":"2604.20409","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2604.20409"},"call":"get_harvested_code_for_paper(arxiv_id=\"2604.20409\")"}]}],"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":"3a169a1d64bf1b3c7bc5d6d1b766bc6ad1c0c181c2e883faf4b02c07c388647e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}