{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BKIMDPDHRG3MJ6ANUZQI5EZ6SG","short_pith_number":"pith:BKIMDPDH","schema_version":"1.0","canonical_sha256":"0a90c1bc6789b6c4f80da6608e933e9196586b821cde12d619efb9fae3268641","source":{"kind":"arxiv","id":"1803.08661","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Optimization with Expensive Integrands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Peter I. Frazier, Saul Toscano-Palmerin","submitted_at":"2018-03-23T05:53:26Z","abstract_excerpt":"We propose a Bayesian optimization algorithm for objective functions that are sums or integrals of expensive-to-evaluate functions, allowing noisy evaluations. These objective functions arise in multi-task Bayesian optimization for tuning machine learning hyperparameters, optimization via simulation, and sequential design of experiments with random environmental conditions. Our method is average-case optimal by construction when a single evaluation of the integrand remains within our evaluation budget. Achieving this one-step optimality requires solving a challenging value of information optim"},"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":"1803.08661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-23T05:53:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5b6aab9cf63bcc810324071b1381a31da612b3d8dadb56c3abb75c2cd31e320a","abstract_canon_sha256":"a712adb09d122f8e5195adff461700b28bc8642fd296d19e81e630f5ceea4857"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:18.932797Z","signature_b64":"ikg7kDPHJp0QzEKLJtakzGRj/Q03A+7l15vqJ4ScVAIfzT8ShQWCmjtax2srnMJXh5svXMQQuuvu73ecm40MCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a90c1bc6789b6c4f80da6608e933e9196586b821cde12d619efb9fae3268641","last_reissued_at":"2026-05-18T00:20:18.931960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:18.931960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Optimization with Expensive Integrands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Peter I. Frazier, Saul Toscano-Palmerin","submitted_at":"2018-03-23T05:53:26Z","abstract_excerpt":"We propose a Bayesian optimization algorithm for objective functions that are sums or integrals of expensive-to-evaluate functions, allowing noisy evaluations. These objective functions arise in multi-task Bayesian optimization for tuning machine learning hyperparameters, optimization via simulation, and sequential design of experiments with random environmental conditions. Our method is average-case optimal by construction when a single evaluation of the integrand remains within our evaluation budget. Achieving this one-step optimality requires solving a challenging value of information optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08661","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":"1803.08661","created_at":"2026-05-18T00:20:18.932081+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.08661v1","created_at":"2026-05-18T00:20:18.932081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08661","created_at":"2026-05-18T00:20:18.932081+00:00"},{"alias_kind":"pith_short_12","alias_value":"BKIMDPDHRG3M","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BKIMDPDHRG3MJ6AN","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BKIMDPDH","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1807.02811","citing_title":"A Tutorial on Bayesian Optimization","ref_index":90,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BKIMDPDHRG3MJ6ANUZQI5EZ6SG","json":"https://pith.science/pith/BKIMDPDHRG3MJ6ANUZQI5EZ6SG.json","graph_json":"https://pith.science/api/pith-number/BKIMDPDHRG3MJ6ANUZQI5EZ6SG/graph.json","events_json":"https://pith.science/api/pith-number/BKIMDPDHRG3MJ6ANUZQI5EZ6SG/events.json","paper":"https://pith.science/paper/BKIMDPDH"},"agent_actions":{"view_html":"https://pith.science/pith/BKIMDPDHRG3MJ6ANUZQI5EZ6SG","download_json":"https://pith.science/pith/BKIMDPDHRG3MJ6ANUZQI5EZ6SG.json","view_paper":"https://pith.science/paper/BKIMDPDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.08661&json=true","fetch_graph":"https://pith.science/api/pith-number/BKIMDPDHRG3MJ6ANUZQI5EZ6SG/graph.json","fetch_events":"https://pith.science/api/pith-number/BKIMDPDHRG3MJ6ANUZQI5EZ6SG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BKIMDPDHRG3MJ6ANUZQI5EZ6SG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BKIMDPDHRG3MJ6ANUZQI5EZ6SG/action/storage_attestation","attest_author":"https://pith.science/pith/BKIMDPDHRG3MJ6ANUZQI5EZ6SG/action/author_attestation","sign_citation":"https://pith.science/pith/BKIMDPDHRG3MJ6ANUZQI5EZ6SG/action/citation_signature","submit_replication":"https://pith.science/pith/BKIMDPDHRG3MJ6ANUZQI5EZ6SG/action/replication_record"}},"created_at":"2026-05-18T00:20:18.932081+00:00","updated_at":"2026-05-18T00:20:18.932081+00:00"}