{"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/distributionally-robust-bayesian-quadrature","title":"Distributionally Robust Bayesian Quadrature Optimization","arxiv_id":"2001.06814","date":"2020-01-19","proceeding":null,"authors":["Thanh Tang Nguyen","Sunil Gupta","Huong Ha","Santu Rana","Svetha Venkatesh"],"abstract":"Bayesian quadrature optimization (BQO) maximizes the expectation of an expensive black-box integrand taken over a known probability distribution. In this work, we study BQO under distributional uncertainty in which the underlying probability distribution is unknown except for a limited set of its i.i.d. samples. A standard BQO approach maximizes the Monte Carlo estimate of the true expected objective given the fixed sample set. Though Monte Carlo estimate is unbiased, it has high variance given a small set of samples; thus can result in a spurious objective function. We adopt the distributionally robust optimization perspective to this problem by maximizing the expected objective under the most adversarial distribution. In particular, we propose a novel posterior sampling based algorithm, namely distributionally robust BQO (DRBQO) for this purpose. We demonstrate the empirical effectiveness of our proposed framework in synthetic and real-world problems, and characterize its theoretical convergence via Bayesian regret.","url_abs":"https://arxiv.org/abs/2001.06814v1","url_pdf":"https://arxiv.org/pdf/2001.06814v1.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":"distributionally-robust-bayesian-quadrature","repo_url":"https://github.com/thanhnguyentang/drbqo","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2001.06814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06814"}},"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/thanhnguyentang/drbqo","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":8},"by_repo_kind":{"official":{"samples":8,"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":"1000098e89c25373","entry":"TS_posterior_func_sample","repo":"thanhnguyentang/drbqo","repo_kind":"official","path":"acqs/TS.py","file_url":"https://github.com/thanhnguyentang/drbqo/blob/HEAD/acqs/TS.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":"1000098e89c25373"}},{"code_sha256_prefix":"c0303d8afd1621a7","entry":"Thomson_sampling","repo":"thanhnguyentang/drbqo","repo_kind":"official","path":"acqs/TS.py","file_url":"https://github.com/thanhnguyentang/drbqo/blob/HEAD/acqs/TS.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":"c0303d8afd1621a7"}},{"code_sha256_prefix":"d8c0cb14f0f56caf","entry":"latin_hypercube_sampler","repo":"thanhnguyentang/drbqo","repo_kind":"official","path":"optimizer/lbfgs.py","file_url":"https://github.com/thanhnguyentang/drbqo/blob/HEAD/optimizer/lbfgs.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":"d8c0cb14f0f56caf"}},{"code_sha256_prefix":"550899ab385771a0","entry":"min_weighted_sum_with_weights_on_chi_squared_ball","repo":"thanhnguyentang/drbqo","repo_kind":"official","path":"utils/compute_dr_weight.py","file_url":"https://github.com/thanhnguyentang/drbqo/blob/HEAD/utils/compute_dr_weight.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":"550899ab385771a0"}},{"code_sha256_prefix":"94c086615b7379a9","entry":"minimize","repo":"thanhnguyentang/drbqo","repo_kind":"official","path":"optimizer/lbfgs.py","file_url":"https://github.com/thanhnguyentang/drbqo/blob/HEAD/optimizer/lbfgs.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":"94c086615b7379a9"}},{"code_sha256_prefix":"071d32de886a3166","entry":"random_sampler","repo":"thanhnguyentang/drbqo","repo_kind":"official","path":"optimizer/lbfgs.py","file_url":"https://github.com/thanhnguyentang/drbqo/blob/HEAD/optimizer/lbfgs.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":"071d32de886a3166"}},{"code_sha256_prefix":"ea28a573735d5d4f","entry":"solve_inner_eta_for_weighted_sum","repo":"thanhnguyentang/drbqo","repo_kind":"official","path":"utils/compute_dr_weight.py","file_url":"https://github.com/thanhnguyentang/drbqo/blob/HEAD/utils/compute_dr_weight.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":"ea28a573735d5d4f"}},{"code_sha256_prefix":"52036d222bcf70a8","entry":"suggest_explorative_w","repo":"thanhnguyentang/drbqo","repo_kind":"official","path":"acqs/ei_quadrature.py","file_url":"https://github.com/thanhnguyentang/drbqo/blob/HEAD/acqs/ei_quadrature.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":"52036d222bcf70a8"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}