{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6C3CFPHX7SOGPVB3LYXGZOWCRV","short_pith_number":"pith:6C3CFPHX","schema_version":"1.0","canonical_sha256":"f0b622bcf7fc9c67d43b5e2e6cbac28d46fcadde24d886ab64573fa16b5a2ea2","source":{"kind":"arxiv","id":"1503.01673","version":3},"attestation_state":"computed","paper":{"title":"High Dimensional Bayesian Optimisation and Bandits via Additive Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Barnabas Poczos, Jeff Schneider, Kirthevasan Kandasamy","submitted_at":"2015-03-05T15:56:08Z","abstract_excerpt":"Bayesian Optimisation (BO) is a technique used in optimising a $D$-dimensional function which is typically expensive to evaluate. While there have been many successes for BO in low dimensions, scaling it to high dimensions has been notoriously difficult. Existing literature on the topic are under very restrictive settings. In this paper, we identify two key challenges in this endeavour. We tackle these challenges by assuming an additive structure for the function. This setting is substantially more expressive and contains a richer class of functions than previous work. We prove that, for addit"},"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":"1503.01673","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-05T15:56:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"685366a241c3a76df2a423e1f6cc88bad5b5e5dcb99566720c80e8e8d62e485f","abstract_canon_sha256":"b383e0871d9b59fc7ada7df19e4765e605da2f4b62db22132e679a8032e281a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:58.982601Z","signature_b64":"KUTlHkMz/ljnSAV7jp2fyRfcEgxQ+7yBuduZtqZkJ+2mXfaTrky5mVmMC/RPzyPPk4QvfZR1tCDvGm38N1YGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0b622bcf7fc9c67d43b5e2e6cbac28d46fcadde24d886ab64573fa16b5a2ea2","last_reissued_at":"2026-05-18T01:14:58.981966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:58.981966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High Dimensional Bayesian Optimisation and Bandits via Additive Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Barnabas Poczos, Jeff Schneider, Kirthevasan Kandasamy","submitted_at":"2015-03-05T15:56:08Z","abstract_excerpt":"Bayesian Optimisation (BO) is a technique used in optimising a $D$-dimensional function which is typically expensive to evaluate. While there have been many successes for BO in low dimensions, scaling it to high dimensions has been notoriously difficult. Existing literature on the topic are under very restrictive settings. In this paper, we identify two key challenges in this endeavour. We tackle these challenges by assuming an additive structure for the function. This setting is substantially more expressive and contains a richer class of functions than previous work. We prove that, for addit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01673","kind":"arxiv","version":3},"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":"1503.01673","created_at":"2026-05-18T01:14:58.982052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01673v3","created_at":"2026-05-18T01:14:58.982052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01673","created_at":"2026-05-18T01:14:58.982052+00:00"},{"alias_kind":"pith_short_12","alias_value":"6C3CFPHX7SOG","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6C3CFPHX7SOGPVB3","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6C3CFPHX","created_at":"2026-05-18T12:29:07.941421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.15679","citing_title":"High-Dimensional Bayesian Optimisation with Large-Scale Constraints via Latent Space Gaussian Processes","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6C3CFPHX7SOGPVB3LYXGZOWCRV","json":"https://pith.science/pith/6C3CFPHX7SOGPVB3LYXGZOWCRV.json","graph_json":"https://pith.science/api/pith-number/6C3CFPHX7SOGPVB3LYXGZOWCRV/graph.json","events_json":"https://pith.science/api/pith-number/6C3CFPHX7SOGPVB3LYXGZOWCRV/events.json","paper":"https://pith.science/paper/6C3CFPHX"},"agent_actions":{"view_html":"https://pith.science/pith/6C3CFPHX7SOGPVB3LYXGZOWCRV","download_json":"https://pith.science/pith/6C3CFPHX7SOGPVB3LYXGZOWCRV.json","view_paper":"https://pith.science/paper/6C3CFPHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01673&json=true","fetch_graph":"https://pith.science/api/pith-number/6C3CFPHX7SOGPVB3LYXGZOWCRV/graph.json","fetch_events":"https://pith.science/api/pith-number/6C3CFPHX7SOGPVB3LYXGZOWCRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6C3CFPHX7SOGPVB3LYXGZOWCRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6C3CFPHX7SOGPVB3LYXGZOWCRV/action/storage_attestation","attest_author":"https://pith.science/pith/6C3CFPHX7SOGPVB3LYXGZOWCRV/action/author_attestation","sign_citation":"https://pith.science/pith/6C3CFPHX7SOGPVB3LYXGZOWCRV/action/citation_signature","submit_replication":"https://pith.science/pith/6C3CFPHX7SOGPVB3LYXGZOWCRV/action/replication_record"}},"created_at":"2026-05-18T01:14:58.982052+00:00","updated_at":"2026-05-18T01:14:58.982052+00:00"}