{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:D27P3RFNGRXKH2S7IHYV36PA6A","short_pith_number":"pith:D27P3RFN","schema_version":"1.0","canonical_sha256":"1ebefdc4ad346ea3ea5f41f15df9e0f03adcc9a38df030342861b7ac534d9cf4","source":{"kind":"arxiv","id":"1906.01537","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Optimization of Composite Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Peter I. Frazier, Raul Astudillo","submitted_at":"2019-06-04T15:51:42Z","abstract_excerpt":"We consider optimization of composite objective functions, i.e., of the form $f(x)=g(h(x))$, where $h$ is a black-box derivative-free expensive-to-evaluate function with vector-valued outputs, and $g$ is a cheap-to-evaluate real-valued function. While these problems can be solved with standard Bayesian optimization, we propose a novel approach that exploits the composite structure of the objective function to substantially improve sampling efficiency. Our approach models $h$ using a multi-output Gaussian process and chooses where to sample using the expected improvement evaluated on the implie"},"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":"1906.01537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-04T15:51:42Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"865bafa220b849a12a6af8ef183bc54ee6818b39bb9a4c6f16b5a3604a004bfe","abstract_canon_sha256":"b65c096a4f0df56f9bee08204d929a025ff0e4000c5933b4d5eaf265540b35c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:16.198059Z","signature_b64":"OqbG4NE10UoC5chX2e2G6kRMq9O6PPheZvoHqiifrdqGE7bg8PhSRcPfUZqd1KjTvwKqOtjclbNgTyPoy96fBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ebefdc4ad346ea3ea5f41f15df9e0f03adcc9a38df030342861b7ac534d9cf4","last_reissued_at":"2026-05-17T23:44:16.197459Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:16.197459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Optimization of Composite Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Peter I. Frazier, Raul Astudillo","submitted_at":"2019-06-04T15:51:42Z","abstract_excerpt":"We consider optimization of composite objective functions, i.e., of the form $f(x)=g(h(x))$, where $h$ is a black-box derivative-free expensive-to-evaluate function with vector-valued outputs, and $g$ is a cheap-to-evaluate real-valued function. While these problems can be solved with standard Bayesian optimization, we propose a novel approach that exploits the composite structure of the objective function to substantially improve sampling efficiency. Our approach models $h$ using a multi-output Gaussian process and chooses where to sample using the expected improvement evaluated on the implie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01537","kind":"arxiv","version":1},"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":"1906.01537","created_at":"2026-05-17T23:44:16.197535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01537v1","created_at":"2026-05-17T23:44:16.197535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01537","created_at":"2026-05-17T23:44:16.197535+00:00"},{"alias_kind":"pith_short_12","alias_value":"D27P3RFNGRXK","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"D27P3RFNGRXKH2S7","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"D27P3RFN","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07047","citing_title":"Accelerating integrated modeling with surrogate-based optimization: the MAESTRO workflow","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D27P3RFNGRXKH2S7IHYV36PA6A","json":"https://pith.science/pith/D27P3RFNGRXKH2S7IHYV36PA6A.json","graph_json":"https://pith.science/api/pith-number/D27P3RFNGRXKH2S7IHYV36PA6A/graph.json","events_json":"https://pith.science/api/pith-number/D27P3RFNGRXKH2S7IHYV36PA6A/events.json","paper":"https://pith.science/paper/D27P3RFN"},"agent_actions":{"view_html":"https://pith.science/pith/D27P3RFNGRXKH2S7IHYV36PA6A","download_json":"https://pith.science/pith/D27P3RFNGRXKH2S7IHYV36PA6A.json","view_paper":"https://pith.science/paper/D27P3RFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01537&json=true","fetch_graph":"https://pith.science/api/pith-number/D27P3RFNGRXKH2S7IHYV36PA6A/graph.json","fetch_events":"https://pith.science/api/pith-number/D27P3RFNGRXKH2S7IHYV36PA6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D27P3RFNGRXKH2S7IHYV36PA6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D27P3RFNGRXKH2S7IHYV36PA6A/action/storage_attestation","attest_author":"https://pith.science/pith/D27P3RFNGRXKH2S7IHYV36PA6A/action/author_attestation","sign_citation":"https://pith.science/pith/D27P3RFNGRXKH2S7IHYV36PA6A/action/citation_signature","submit_replication":"https://pith.science/pith/D27P3RFNGRXKH2S7IHYV36PA6A/action/replication_record"}},"created_at":"2026-05-17T23:44:16.197535+00:00","updated_at":"2026-05-17T23:44:16.197535+00:00"}