{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:C464OVRGRBE7RPBIVZYF3G62NS","short_pith_number":"pith:C464OVRG","schema_version":"1.0","canonical_sha256":"173dc756268849f8bc28ae705d9bda6ca6eccfc991936c32a28ba17fc3a7210e","source":{"kind":"arxiv","id":"1602.05149","version":4},"attestation_state":"computed","paper":{"title":"Parallel Bayesian Global Optimization of Expensive Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"stat.ML","authors_text":"Eric Liu, Jialei Wang, Peter I. Frazier, Scott C. Clark","submitted_at":"2016-02-16T19:40:15Z","abstract_excerpt":"We consider parallel global optimization of derivative-free expensive-to-evaluate functions, and propose an efficient method based on stochastic approximation for implementing a conceptual Bayesian optimization algorithm proposed by Ginsbourger et al. (2007). At the heart of this algorithm is maximizing the information criterion called the \"multi-points expected improvement'', or the q-EI. To accomplish this, we use infinitessimal perturbation analysis (IPA) to construct a stochastic gradient estimator and show that this estimator is unbiased. We also show that the stochastic gradient ascent a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1602.05149","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-16T19:40:15Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b909dcbe070253b18826ac5f279b738b2be081c67d7def26c2b819e03c17632e","abstract_canon_sha256":"0834db4121d5ed5dd6438603df2f10c14161ef2112b7809b618bc3d40fb9c257"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:06.164107Z","signature_b64":"U1Zp6/6Bog76AW776DIqyLP2We1qu2R2LjgJlXXc1At74B2WN6aksW3Nd8TWuSN3Pot40lg9oFjDTdrY6RbgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"173dc756268849f8bc28ae705d9bda6ca6eccfc991936c32a28ba17fc3a7210e","last_reissued_at":"2026-05-17T23:47:06.163371Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:06.163371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Bayesian Global Optimization of Expensive Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"stat.ML","authors_text":"Eric Liu, Jialei Wang, Peter I. Frazier, Scott C. Clark","submitted_at":"2016-02-16T19:40:15Z","abstract_excerpt":"We consider parallel global optimization of derivative-free expensive-to-evaluate functions, and propose an efficient method based on stochastic approximation for implementing a conceptual Bayesian optimization algorithm proposed by Ginsbourger et al. (2007). At the heart of this algorithm is maximizing the information criterion called the \"multi-points expected improvement'', or the q-EI. To accomplish this, we use infinitessimal perturbation analysis (IPA) to construct a stochastic gradient estimator and show that this estimator is unbiased. We also show that the stochastic gradient ascent a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05149","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.05149","created_at":"2026-05-17T23:47:06.163491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.05149v4","created_at":"2026-05-17T23:47:06.163491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05149","created_at":"2026-05-17T23:47:06.163491+00:00"},{"alias_kind":"pith_short_12","alias_value":"C464OVRGRBE7","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C464OVRGRBE7RPBI","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C464OVRG","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2404.03099","citing_title":"Composite Bayesian Optimization In Function Spaces Using NEON -- Neural Epistemic Operator Networks","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2506.09894","citing_title":"Choosing a Suitable Acquisition Function for Batch Bayesian Optimization: Comparison of Serial and Monte Carlo Approaches","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"1807.02811","citing_title":"A Tutorial on Bayesian Optimization","ref_index":94,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C464OVRGRBE7RPBIVZYF3G62NS","json":"https://pith.science/pith/C464OVRGRBE7RPBIVZYF3G62NS.json","graph_json":"https://pith.science/api/pith-number/C464OVRGRBE7RPBIVZYF3G62NS/graph.json","events_json":"https://pith.science/api/pith-number/C464OVRGRBE7RPBIVZYF3G62NS/events.json","paper":"https://pith.science/paper/C464OVRG"},"agent_actions":{"view_html":"https://pith.science/pith/C464OVRGRBE7RPBIVZYF3G62NS","download_json":"https://pith.science/pith/C464OVRGRBE7RPBIVZYF3G62NS.json","view_paper":"https://pith.science/paper/C464OVRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.05149&json=true","fetch_graph":"https://pith.science/api/pith-number/C464OVRGRBE7RPBIVZYF3G62NS/graph.json","fetch_events":"https://pith.science/api/pith-number/C464OVRGRBE7RPBIVZYF3G62NS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C464OVRGRBE7RPBIVZYF3G62NS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C464OVRGRBE7RPBIVZYF3G62NS/action/storage_attestation","attest_author":"https://pith.science/pith/C464OVRGRBE7RPBIVZYF3G62NS/action/author_attestation","sign_citation":"https://pith.science/pith/C464OVRGRBE7RPBIVZYF3G62NS/action/citation_signature","submit_replication":"https://pith.science/pith/C464OVRGRBE7RPBIVZYF3G62NS/action/replication_record"}},"created_at":"2026-05-17T23:47:06.163491+00:00","updated_at":"2026-05-17T23:47:06.163491+00:00"}