{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SQMQ725NBIAUUB6IKKZYRIMAUM","short_pith_number":"pith:SQMQ725N","schema_version":"1.0","canonical_sha256":"94190febad0a014a07c852b388a180a335e7885d62c30b91034e9e0564892464","source":{"kind":"arxiv","id":"1706.01445","version":4},"attestation_state":"computed","paper":{"title":"Batched Large-scale Bayesian Optimization in High-dimensional Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Clement Gehring, Pushmeet Kohli, Stefanie Jegelka, Zi Wang","submitted_at":"2017-06-05T17:50:44Z","abstract_excerpt":"Bayesian optimization (BO) has become an effective approach for black-box function optimization problems when function evaluations are expensive and the optimum can be achieved within a relatively small number of queries. However, many cases, such as the ones with high-dimensional inputs, may require a much larger number of observations for optimization. Despite an abundance of observations thanks to parallel experiments, current BO techniques have been limited to merely a few thousand observations. In this paper, we propose ensemble Bayesian optimization (EBO) to address three current challen"},"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":"1706.01445","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-05T17:50:44Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"cca34de4a94fc937efc5ea1d781616250dff6b64675a65a4fc28d0f8c170f6a1","abstract_canon_sha256":"5c6d652948608ec31f33eb8b3db764cd4b7eb975b1f2f494e0fa390d434ab5a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:00.597420Z","signature_b64":"CXbQMtpUrz+GFsthkje1n96iof7EXQtAhokk6vBLNECYocJQ6dNgSDBLcxxQotojO4NToPTr+xY007hJMENPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94190febad0a014a07c852b388a180a335e7885d62c30b91034e9e0564892464","last_reissued_at":"2026-05-18T00:09:00.596725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:00.596725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Batched Large-scale Bayesian Optimization in High-dimensional Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Clement Gehring, Pushmeet Kohli, Stefanie Jegelka, Zi Wang","submitted_at":"2017-06-05T17:50:44Z","abstract_excerpt":"Bayesian optimization (BO) has become an effective approach for black-box function optimization problems when function evaluations are expensive and the optimum can be achieved within a relatively small number of queries. However, many cases, such as the ones with high-dimensional inputs, may require a much larger number of observations for optimization. Despite an abundance of observations thanks to parallel experiments, current BO techniques have been limited to merely a few thousand observations. In this paper, we propose ensemble Bayesian optimization (EBO) to address three current challen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01445","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":"1706.01445","created_at":"2026-05-18T00:09:00.596832+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.01445v4","created_at":"2026-05-18T00:09:00.596832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01445","created_at":"2026-05-18T00:09:00.596832+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQMQ725NBIAU","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQMQ725NBIAUUB6I","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQMQ725N","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.01468","citing_title":"Computation-Aware Kalman Filtering with Model Selection for Neural Dynamics","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SQMQ725NBIAUUB6IKKZYRIMAUM","json":"https://pith.science/pith/SQMQ725NBIAUUB6IKKZYRIMAUM.json","graph_json":"https://pith.science/api/pith-number/SQMQ725NBIAUUB6IKKZYRIMAUM/graph.json","events_json":"https://pith.science/api/pith-number/SQMQ725NBIAUUB6IKKZYRIMAUM/events.json","paper":"https://pith.science/paper/SQMQ725N"},"agent_actions":{"view_html":"https://pith.science/pith/SQMQ725NBIAUUB6IKKZYRIMAUM","download_json":"https://pith.science/pith/SQMQ725NBIAUUB6IKKZYRIMAUM.json","view_paper":"https://pith.science/paper/SQMQ725N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.01445&json=true","fetch_graph":"https://pith.science/api/pith-number/SQMQ725NBIAUUB6IKKZYRIMAUM/graph.json","fetch_events":"https://pith.science/api/pith-number/SQMQ725NBIAUUB6IKKZYRIMAUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQMQ725NBIAUUB6IKKZYRIMAUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQMQ725NBIAUUB6IKKZYRIMAUM/action/storage_attestation","attest_author":"https://pith.science/pith/SQMQ725NBIAUUB6IKKZYRIMAUM/action/author_attestation","sign_citation":"https://pith.science/pith/SQMQ725NBIAUUB6IKKZYRIMAUM/action/citation_signature","submit_replication":"https://pith.science/pith/SQMQ725NBIAUUB6IKKZYRIMAUM/action/replication_record"}},"created_at":"2026-05-18T00:09:00.596832+00:00","updated_at":"2026-05-18T00:09:00.596832+00:00"}