{"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/augment-and-reduce-stochastic-inference-for-1","title":"Augment and Reduce: Stochastic Inference for Large Categorical Distributions","arxiv_id":"1802.04220","date":"2018-02-12","proceeding":"ICML 2018","authors":["Francisco J. R. Ruiz","Michalis K. Titsias","Adji B. Dieng","David M. Blei"],"abstract":"Categorical distributions are ubiquitous in machine learning, e.g., in\nclassification, language models, and recommendation systems. However, when the\nnumber of possible outcomes is very large, using categorical distributions\nbecomes computationally expensive, as the complexity scales linearly with the\nnumber of outcomes. To address this problem, we propose augment and reduce\n(A&R), a method to alleviate the computational complexity. A&R uses two ideas:\nlatent variable augmentation and stochastic variational inference. It maximizes\na lower bound on the marginal likelihood of the data. Unlike existing methods\nwhich are specific to softmax, A&R is more general and is amenable to other\ncategorical models, such as multinomial probit. On several large-scale\nclassification problems, we show that A&R provides a tighter bound on the\nmarginal likelihood and has better predictive performance than existing\napproaches.","url_abs":"http://arxiv.org/abs/1802.04220v3","url_pdf":"http://arxiv.org/pdf/1802.04220v3.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":"augment-and-reduce-stochastic-inference-for-1","repo_url":"https://github.com/franrruiz/augment-reduce","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"},{"task_slug":"variational-inference","task_name":"Variational Inference"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.04220","atlas_url":"https://app.syntology.ai/?focus=1802.04220","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.04220"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.04220\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.04220"},"call":"get_concepts_for_paper(arxiv_id=\"1802.04220\")"}],"by_repo":[{"repo":"franrruiz/augment-reduce","kind":"official","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":"79c7ded44ea20695e54c76853d6d5362049fa2f513922269ad522baefade6bd7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}