{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/sequential-bayesian-experimental-design-for","title":"Sequential Bayesian Experimental Design for Implicit Models via Mutual Information","arxiv_id":"2003.09379","date":"2020-03-20","proceeding":null,"authors":["Steven Kleinegesse","Christopher Drovandi","Michael U. Gutmann"],"abstract":"Bayesian experimental design (BED) is a framework that uses statistical models and decision making under uncertainty to optimise the cost and performance of a scientific experiment. Sequential BED, as opposed to static BED, considers the scenario where we can sequentially update our beliefs about the model parameters through data gathered in the experiment. A class of models of particular interest for the natural and medical sciences are implicit models, where the data generating distribution is intractable, but sampling from it is possible. Even though there has been a lot of work on static BED for implicit models in the past few years, the notoriously difficult problem of sequential BED for implicit models has barely been touched upon. We address this gap in the literature by devising a novel sequential design framework for parameter estimation that uses the Mutual Information (MI) between model parameters and simulated data as a utility function to find optimal experimental designs, which has not been done before for implicit models. Our approach uses likelihood-free inference by ratio estimation to simultaneously estimate posterior distributions and the MI. During the sequential BED procedure we utilise Bayesian optimisation to help us optimise the MI utility. We find that our framework is efficient for the various implicit models tested, yielding accurate parameter estimates after only a few iterations.","url_abs":"https://arxiv.org/abs/2003.09379v1","url_pdf":"https://arxiv.org/pdf/2003.09379v1.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":"sequential-bayesian-experimental-design-for","repo_url":"https://github.com/stevenkleinegesse/seqbed","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"bayesian-optimisation","task_name":"Bayesian Optimisation"},{"task_slug":"decision-making","task_name":"Decision Making"},{"task_slug":"decision-making-under-uncertainty","task_name":"Decision Making Under Uncertainty"},{"task_slug":"experimental-design","task_name":"Experimental Design"},{"task_slug":"parameter-estimation","task_name":"parameter estimation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2003.09379","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09379"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/stevenkleinegesse/seqbed","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_draft_wrong":1,"ran_honours":1,"unverified":3},"by_repo_kind":{"listed":{"samples":5,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"ed9d6f8206e51233","entry":"fun_dfun","repo":"stevenkleinegesse/seqbed","repo_kind":"listed","path":"src/seqbed/methods.py","file_url":"https://github.com/stevenkleinegesse/seqbed/blob/HEAD/src/seqbed/methods.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ed9d6f8206e51233"}},{"code_sha256_prefix":"6f1dad4692c9062d","entry":"indicator_boundaries","repo":"stevenkleinegesse/seqbed","repo_kind":"listed","path":"src/seqbed/methods.py","file_url":"https://github.com/stevenkleinegesse/seqbed/blob/HEAD/src/seqbed/methods.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6f1dad4692c9062d"}},{"code_sha256_prefix":"270017c17f0fa73f","entry":"MEstimator","repo":"stevenkleinegesse/seqbed","repo_kind":"listed","path":"src/seqbed/robust.py","file_url":"https://github.com/stevenkleinegesse/seqbed/blob/HEAD/src/seqbed/robust.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"270017c17f0fa73f"}},{"code_sha256_prefix":"5536303a60fdf9a9","entry":"Psi","repo":"stevenkleinegesse/seqbed","repo_kind":"listed","path":"src/seqbed/robust.py","file_url":"https://github.com/stevenkleinegesse/seqbed/blob/HEAD/src/seqbed/robust.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5536303a60fdf9a9"}},{"code_sha256_prefix":"1c356fe2304e9954","entry":"Root","repo":"stevenkleinegesse/seqbed","repo_kind":"listed","path":"src/seqbed/robust.py","file_url":"https://github.com/stevenkleinegesse/seqbed/blob/HEAD/src/seqbed/robust.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"1c356fe2304e9954"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}