{"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/bambi-blind-accelerated-multimodal-bayesian","title":"BAMBI: blind accelerated multimodal Bayesian inference","arxiv_id":"1110.2997","date":"2011-10-13","proceeding":null,"authors":["Philip Graff","Farhan Feroz","Michael P. Hobson","Anthony Lasenby"],"abstract":"In this paper we present an algorithm for rapid Bayesian analysis that\ncombines the benefits of nested sampling and artificial neural networks. The\nblind accelerated multimodal Bayesian inference (BAMBI) algorithm implements\nthe MultiNest package for nested sampling as well as the training of an\nartificial neural network (NN) to learn the likelihood function. In the case of\ncomputationally expensive likelihoods, this allows the substitution of a much\nmore rapid approximation in order to increase significantly the speed of the\nanalysis. We begin by demonstrating, with a few toy examples, the ability of a\nNN to learn complicated likelihood surfaces. BAMBI's ability to decrease\nrunning time for Bayesian inference is then demonstrated in the context of\nestimating cosmological parameters from Wilkinson Microwave Anisotropy Probe\nand other observations. We show that valuable speed increases are achieved in\naddition to obtaining NNs trained on the likelihood functions for the different\nmodel and data combinations. These NNs can then be used for an even faster\nfollow-up analysis using the same likelihood and different priors. This is a\nfully general algorithm that can be applied, without any pre-processing, to\nother problems with computationally expensive likelihood functions.","url_abs":"http://arxiv.org/abs/1110.2997v2","url_pdf":"http://arxiv.org/pdf/1110.2997v2.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":"bambi-blind-accelerated-multimodal-bayesian","repo_url":"https://github.com/DarkMachines/pyBAMBI","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"bambi-blind-accelerated-multimodal-bayesian","repo_url":"https://github.com/igomezv/neuralike","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"bayesian-inference","task_name":"Bayesian Inference"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"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":"DarkMachines/pyBAMBI","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"igomezv/neuralike","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":"931f1ce1a2121fd5c1d31435d68ee2a522034e537c5cf62544238a8bbe89ab5d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}