{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LYOOAADJHAEMXDGUUEQUYUP2AF","short_pith_number":"pith:LYOOAADJ","schema_version":"1.0","canonical_sha256":"5e1ce000693808cb8cd4a1214c51fa01741b8c20a7981bab260441ef1bb9553c","source":{"kind":"arxiv","id":"2103.00349","version":2},"attestation_state":"computed","paper":{"title":"High-Dimensional Bayesian Optimization with Sparse Axis-Aligned Subspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"David Eriksson, Martin Jankowiak","submitted_at":"2021-02-27T23:06:24Z","abstract_excerpt":"Bayesian optimization (BO) is a powerful paradigm for efficient optimization of black-box objective functions. High-dimensional BO presents a particular challenge, in part because the curse of dimensionality makes it difficult to define -- as well as do inference over -- a suitable class of surrogate models. We argue that Gaussian process surrogate models defined on sparse axis-aligned subspaces offer an attractive compromise between flexibility and parsimony. We demonstrate that our approach, which relies on Hamiltonian Monte Carlo for inference, can rapidly identify sparse subspaces relevant"},"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":"2103.00349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-27T23:06:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ffff69b2e2f97704d5aad7e8e539b9f2c9877980b0bcc3afb0027b754c545567","abstract_canon_sha256":"9b2a38dce5a716207ecc86fadaf8420d3d022f4cb955defd36dc9a38f5bd9f8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:47:59.298495Z","signature_b64":"U7lhnXsWSz5s3pAADdW3JlusnzFYUvVZcYZTZksyLszZI0YVZWu3S/ppavSZWJyfE09DApmAB6K48Qh9Pc2PCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e1ce000693808cb8cd4a1214c51fa01741b8c20a7981bab260441ef1bb9553c","last_reissued_at":"2026-07-05T02:47:59.298009Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:47:59.298009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Dimensional Bayesian Optimization with Sparse Axis-Aligned Subspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"David Eriksson, Martin Jankowiak","submitted_at":"2021-02-27T23:06:24Z","abstract_excerpt":"Bayesian optimization (BO) is a powerful paradigm for efficient optimization of black-box objective functions. High-dimensional BO presents a particular challenge, in part because the curse of dimensionality makes it difficult to define -- as well as do inference over -- a suitable class of surrogate models. We argue that Gaussian process surrogate models defined on sparse axis-aligned subspaces offer an attractive compromise between flexibility and parsimony. We demonstrate that our approach, which relies on Hamiltonian Monte Carlo for inference, can rapidly identify sparse subspaces relevant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.00349","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.00349/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2103.00349","created_at":"2026-07-05T02:47:59.298066+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.00349v2","created_at":"2026-07-05T02:47:59.298066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.00349","created_at":"2026-07-05T02:47:59.298066+00:00"},{"alias_kind":"pith_short_12","alias_value":"LYOOAADJHAEM","created_at":"2026-07-05T02:47:59.298066+00:00"},{"alias_kind":"pith_short_16","alias_value":"LYOOAADJHAEMXDGU","created_at":"2026-07-05T02:47:59.298066+00:00"},{"alias_kind":"pith_short_8","alias_value":"LYOOAADJ","created_at":"2026-07-05T02:47:59.298066+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00865","citing_title":"Constrained Bayesian Optimisation with Multiple Information Sources","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2512.19469","citing_title":"GLUE: Coordinating Pre-Trained Generative Models for System-Level Design","ref_index":73,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02690","citing_title":"Caliper-in-the-Loop: Black-Box Optimization for Hyperledger Fabric Performance Tuning","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LYOOAADJHAEMXDGUUEQUYUP2AF","json":"https://pith.science/pith/LYOOAADJHAEMXDGUUEQUYUP2AF.json","graph_json":"https://pith.science/api/pith-number/LYOOAADJHAEMXDGUUEQUYUP2AF/graph.json","events_json":"https://pith.science/api/pith-number/LYOOAADJHAEMXDGUUEQUYUP2AF/events.json","paper":"https://pith.science/paper/LYOOAADJ"},"agent_actions":{"view_html":"https://pith.science/pith/LYOOAADJHAEMXDGUUEQUYUP2AF","download_json":"https://pith.science/pith/LYOOAADJHAEMXDGUUEQUYUP2AF.json","view_paper":"https://pith.science/paper/LYOOAADJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.00349&json=true","fetch_graph":"https://pith.science/api/pith-number/LYOOAADJHAEMXDGUUEQUYUP2AF/graph.json","fetch_events":"https://pith.science/api/pith-number/LYOOAADJHAEMXDGUUEQUYUP2AF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LYOOAADJHAEMXDGUUEQUYUP2AF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LYOOAADJHAEMXDGUUEQUYUP2AF/action/storage_attestation","attest_author":"https://pith.science/pith/LYOOAADJHAEMXDGUUEQUYUP2AF/action/author_attestation","sign_citation":"https://pith.science/pith/LYOOAADJHAEMXDGUUEQUYUP2AF/action/citation_signature","submit_replication":"https://pith.science/pith/LYOOAADJHAEMXDGUUEQUYUP2AF/action/replication_record"}},"created_at":"2026-07-05T02:47:59.298066+00:00","updated_at":"2026-07-05T02:47:59.298066+00:00"}