{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4KMQ36D75CMZCUEYW7GWQVNEKJ","short_pith_number":"pith:4KMQ36D7","schema_version":"1.0","canonical_sha256":"e2990df87fe899915098b7cd6855a4524d9141c38186406902926c631d662013","source":{"kind":"arxiv","id":"1703.01973","version":2},"attestation_state":"computed","paper":{"title":"Batched High-dimensional Bayesian Optimization via Structural Kernel Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Chengtao Li, Pushmeet Kohli, Stefanie Jegelka, Zi Wang","submitted_at":"2017-03-06T17:01:19Z","abstract_excerpt":"Optimization of high-dimensional black-box functions is an extremely challenging problem. While Bayesian optimization has emerged as a popular approach for optimizing black-box functions, its applicability has been limited to low-dimensional problems due to its computational and statistical challenges arising from high-dimensional settings. In this paper, we propose to tackle these challenges by (1) assuming a latent additive structure in the function and inferring it properly for more efficient and effective BO, and (2) performing multiple evaluations in parallel to reduce the number of itera"},"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":"1703.01973","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-06T17:01:19Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"81ef2cd6bf54a696eb8a084b1c6caee0b1ae8a0890bc54fd5e3d1430c723417b","abstract_canon_sha256":"4396d53afea52af7dc7ea7ef78f8bc2d3415866d13682433d022f89cb9dc0a86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:00.717647Z","signature_b64":"u/iYqj10vdhujiHtJQOPhgOpWlo+u0T1jzxNNGDhl+V24XRcbJ8HlsBGAFeKtFjXO/hzK9DeP65ILMi4hH4DAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2990df87fe899915098b7cd6855a4524d9141c38186406902926c631d662013","last_reissued_at":"2026-05-18T00:09:00.716930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:00.716930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Batched High-dimensional Bayesian Optimization via Structural Kernel Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Chengtao Li, Pushmeet Kohli, Stefanie Jegelka, Zi Wang","submitted_at":"2017-03-06T17:01:19Z","abstract_excerpt":"Optimization of high-dimensional black-box functions is an extremely challenging problem. While Bayesian optimization has emerged as a popular approach for optimizing black-box functions, its applicability has been limited to low-dimensional problems due to its computational and statistical challenges arising from high-dimensional settings. In this paper, we propose to tackle these challenges by (1) assuming a latent additive structure in the function and inferring it properly for more efficient and effective BO, and (2) performing multiple evaluations in parallel to reduce the number of itera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01973","kind":"arxiv","version":2},"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":"1703.01973","created_at":"2026-05-18T00:09:00.717052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.01973v2","created_at":"2026-05-18T00:09:00.717052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01973","created_at":"2026-05-18T00:09:00.717052+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KMQ36D75CMZ","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KMQ36D75CMZCUEY","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KMQ36D7","created_at":"2026-05-18T12:31:00.734936+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.16554","citing_title":"High-Dimensional Bayesian Optimization via Random Projection of Manifold Subspaces","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4KMQ36D75CMZCUEYW7GWQVNEKJ","json":"https://pith.science/pith/4KMQ36D75CMZCUEYW7GWQVNEKJ.json","graph_json":"https://pith.science/api/pith-number/4KMQ36D75CMZCUEYW7GWQVNEKJ/graph.json","events_json":"https://pith.science/api/pith-number/4KMQ36D75CMZCUEYW7GWQVNEKJ/events.json","paper":"https://pith.science/paper/4KMQ36D7"},"agent_actions":{"view_html":"https://pith.science/pith/4KMQ36D75CMZCUEYW7GWQVNEKJ","download_json":"https://pith.science/pith/4KMQ36D75CMZCUEYW7GWQVNEKJ.json","view_paper":"https://pith.science/paper/4KMQ36D7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.01973&json=true","fetch_graph":"https://pith.science/api/pith-number/4KMQ36D75CMZCUEYW7GWQVNEKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/4KMQ36D75CMZCUEYW7GWQVNEKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KMQ36D75CMZCUEYW7GWQVNEKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KMQ36D75CMZCUEYW7GWQVNEKJ/action/storage_attestation","attest_author":"https://pith.science/pith/4KMQ36D75CMZCUEYW7GWQVNEKJ/action/author_attestation","sign_citation":"https://pith.science/pith/4KMQ36D75CMZCUEYW7GWQVNEKJ/action/citation_signature","submit_replication":"https://pith.science/pith/4KMQ36D75CMZCUEYW7GWQVNEKJ/action/replication_record"}},"created_at":"2026-05-18T00:09:00.717052+00:00","updated_at":"2026-05-18T00:09:00.717052+00:00"}