{"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/unbiased-mlmc-stochastic-gradient-based","title":"Unbiased MLMC stochastic gradient-based optimization of Bayesian experimental designs","arxiv_id":"2005.08414","date":"2020-05-18","proceeding":null,"authors":["Takashi Goda","Tomohiko Hironaka","Wataru Kitade","Adam Foster"],"abstract":"In this paper we propose an efficient stochastic optimization algorithm to search for Bayesian experimental designs such that the expected information gain is maximized. The gradient of the expected information gain with respect to experimental design parameters is given by a nested expectation, for which the standard Monte Carlo method using a fixed number of inner samples yields a biased estimator. In this paper, applying the idea of randomized multilevel Monte Carlo (MLMC) methods, we introduce an unbiased Monte Carlo estimator for the gradient of the expected information gain with finite expected squared $\\ell_2$-norm and finite expected computational cost per sample. Our unbiased estimator can be combined well with stochastic gradient descent algorithms, which results in our proposal of an optimization algorithm to search for an optimal Bayesian experimental design. Numerical experiments confirm that our proposed algorithm works well not only for a simple test problem but also for a more realistic pharmacokinetic problem.","url_abs":"https://arxiv.org/abs/2005.08414v3","url_pdf":"https://arxiv.org/pdf/2005.08414v3.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":"unbiased-mlmc-stochastic-gradient-based","repo_url":"https://github.com/Goda-Research-Group/MLMC_stochastic_gradient","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"experimental-design","task_name":"Experimental Design"},{"task_slug":"stochastic-optimization","task_name":"Stochastic Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2005.08414","atlas_url":"https://app.syntology.ai/?focus=2005.08414","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.08414"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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/Goda-Research-Group/MLMC_stochastic_gradient","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":9},"by_repo_kind":{"official":{"samples":9,"ran":0,"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":"0577addb049ea50b","entry":"amsgrad_initialize","repo":"Goda-Research-Group/MLMC_stochastic_gradient","repo_kind":"official","path":"mlmc_eig_grad/optimize.py","file_url":"https://github.com/Goda-Research-Group/MLMC_stochastic_gradient/blob/HEAD/mlmc_eig_grad/optimize.py","link_basis":"first_harvest_node","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":"0577addb049ea50b"}},{"code_sha256_prefix":"1d6211e990fb0d6e","entry":"amsgrad_iterate","repo":"Goda-Research-Group/MLMC_stochastic_gradient","repo_kind":"official","path":"mlmc_eig_grad/optimize.py","file_url":"https://github.com/Goda-Research-Group/MLMC_stochastic_gradient/blob/HEAD/mlmc_eig_grad/optimize.py","link_basis":"first_harvest_node","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":"1d6211e990fb0d6e"}},{"code_sha256_prefix":"59d8f17f7362768b","entry":"dist_theta_pdf_test","repo":"Goda-Research-Group/MLMC_stochastic_gradient","repo_kind":"official","path":"mlmc_eig_grad/models.py","file_url":"https://github.com/Goda-Research-Group/MLMC_stochastic_gradient/blob/HEAD/mlmc_eig_grad/models.py","link_basis":"first_harvest_node","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":"59d8f17f7362768b"}},{"code_sha256_prefix":"54916a5656cc2b87","entry":"dist_theta_rvs_test","repo":"Goda-Research-Group/MLMC_stochastic_gradient","repo_kind":"official","path":"mlmc_eig_grad/models.py","file_url":"https://github.com/Goda-Research-Group/MLMC_stochastic_gradient/blob/HEAD/mlmc_eig_grad/models.py","link_basis":"first_harvest_node","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":"54916a5656cc2b87"}},{"code_sha256_prefix":"466e0c7a63b5a8df","entry":"dist_y_rvs_test","repo":"Goda-Research-Group/MLMC_stochastic_gradient","repo_kind":"official","path":"mlmc_eig_grad/models.py","file_url":"https://github.com/Goda-Research-Group/MLMC_stochastic_gradient/blob/HEAD/mlmc_eig_grad/models.py","link_basis":"first_harvest_node","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":"466e0c7a63b5a8df"}},{"code_sha256_prefix":"18e16614cf3dfd83","entry":"mlmc_eig_grad","repo":"Goda-Research-Group/MLMC_stochastic_gradient","repo_kind":"official","path":"mlmc_eig_grad/mlmc_eig.py","file_url":"https://github.com/Goda-Research-Group/MLMC_stochastic_gradient/blob/HEAD/mlmc_eig_grad/mlmc_eig.py","link_basis":"first_harvest_node","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":"18e16614cf3dfd83"}},{"code_sha256_prefix":"ce1480674a78a71d","entry":"mlmc_eig_value","repo":"Goda-Research-Group/MLMC_stochastic_gradient","repo_kind":"official","path":"mlmc_eig_grad/mlmc_eig.py","file_url":"https://github.com/Goda-Research-Group/MLMC_stochastic_gradient/blob/HEAD/mlmc_eig_grad/mlmc_eig.py","link_basis":"first_harvest_node","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":"ce1480674a78a71d"}},{"code_sha256_prefix":"bdc22bb94134802b","entry":"mlmc_eig_value_and_grad","repo":"Goda-Research-Group/MLMC_stochastic_gradient","repo_kind":"official","path":"mlmc_eig_grad/mlmc_eig.py","file_url":"https://github.com/Goda-Research-Group/MLMC_stochastic_gradient/blob/HEAD/mlmc_eig_grad/mlmc_eig.py","link_basis":"first_harvest_node","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":"bdc22bb94134802b"}},{"code_sha256_prefix":"06fdd30684b0e2b8","entry":"robbins_monro_initialize","repo":"Goda-Research-Group/MLMC_stochastic_gradient","repo_kind":"official","path":"mlmc_eig_grad/optimize.py","file_url":"https://github.com/Goda-Research-Group/MLMC_stochastic_gradient/blob/HEAD/mlmc_eig_grad/optimize.py","link_basis":"first_harvest_node","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":"06fdd30684b0e2b8"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}