{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OC4VIXVZKIO4EJPWZELF7PN34V","short_pith_number":"pith:OC4VIXVZ","schema_version":"1.0","canonical_sha256":"70b9545eb9521dc225f6c9165fbdbbe57277f730f52da54d68eec57f6bd2616c","source":{"kind":"arxiv","id":"2402.02229","version":5},"attestation_state":"computed","paper":{"title":"Vanilla Bayesian Optimization Performs Great in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Carl Hvarfner, Erik Orm Hellsten, Luigi Nardi","submitted_at":"2024-02-03T18:19:46Z","abstract_excerpt":"High-dimensional problems have long been considered the Achilles' heel of Bayesian optimization algorithms. Spurred by the curse of dimensionality, a large collection of algorithms aim to make it more performant in this setting, commonly by imposing various simplifying assumptions on the objective. In this paper, we identify the degeneracies that make vanilla Bayesian optimization poorly suited to high-dimensional tasks, and further show how existing algorithms address these degeneracies through the lens of lowering the model complexity. Moreover, we propose an enhancement to the prior assumpt"},"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":"2402.02229","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-03T18:19:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"895f4437a6ac56ba7877ae464aca2939dd9365a2077311201d2222fc71f487f8","abstract_canon_sha256":"bca9543ccff3c703714215df8c5ef0a5bcc09813fe6d7e982f67644a023bad5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:48:12.343427Z","signature_b64":"2v14wQU9gEwkDx8ZVe+M8ginhcna2zeYBpuxcw83QtfFsnCsslTqkQfeloJ7HRCPIbqbd1A36iZq5ytgxRw4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70b9545eb9521dc225f6c9165fbdbbe57277f730f52da54d68eec57f6bd2616c","last_reissued_at":"2026-07-05T09:48:12.342993Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:48:12.342993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vanilla Bayesian Optimization Performs Great in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Carl Hvarfner, Erik Orm Hellsten, Luigi Nardi","submitted_at":"2024-02-03T18:19:46Z","abstract_excerpt":"High-dimensional problems have long been considered the Achilles' heel of Bayesian optimization algorithms. Spurred by the curse of dimensionality, a large collection of algorithms aim to make it more performant in this setting, commonly by imposing various simplifying assumptions on the objective. In this paper, we identify the degeneracies that make vanilla Bayesian optimization poorly suited to high-dimensional tasks, and further show how existing algorithms address these degeneracies through the lens of lowering the model complexity. Moreover, we propose an enhancement to the prior assumpt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.02229","kind":"arxiv","version":5},"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/2402.02229/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":"2402.02229","created_at":"2026-07-05T09:48:12.343047+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.02229v5","created_at":"2026-07-05T09:48:12.343047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.02229","created_at":"2026-07-05T09:48:12.343047+00:00"},{"alias_kind":"pith_short_12","alias_value":"OC4VIXVZKIO4","created_at":"2026-07-05T09:48:12.343047+00:00"},{"alias_kind":"pith_short_16","alias_value":"OC4VIXVZKIO4EJPW","created_at":"2026-07-05T09:48:12.343047+00:00"},{"alias_kind":"pith_short_8","alias_value":"OC4VIXVZ","created_at":"2026-07-05T09:48:12.343047+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08438","citing_title":"Improving Bayesian Optimization via Training-Aware Conditional Diffusion Models","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00691","citing_title":"Generative Refinement for Low-Budget Black-Box Optimization","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00865","citing_title":"Constrained Bayesian Optimisation with Multiple Information Sources","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2602.17679","citing_title":"Joint Parameter and State-Space Bayesian Optimization: Using Process Expertise to Accelerate Manufacturing Optimization","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10654","citing_title":"Active Learning for Gaussian Process Regression Under Self-Induced Boltzmann Weights","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OC4VIXVZKIO4EJPWZELF7PN34V","json":"https://pith.science/pith/OC4VIXVZKIO4EJPWZELF7PN34V.json","graph_json":"https://pith.science/api/pith-number/OC4VIXVZKIO4EJPWZELF7PN34V/graph.json","events_json":"https://pith.science/api/pith-number/OC4VIXVZKIO4EJPWZELF7PN34V/events.json","paper":"https://pith.science/paper/OC4VIXVZ"},"agent_actions":{"view_html":"https://pith.science/pith/OC4VIXVZKIO4EJPWZELF7PN34V","download_json":"https://pith.science/pith/OC4VIXVZKIO4EJPWZELF7PN34V.json","view_paper":"https://pith.science/paper/OC4VIXVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.02229&json=true","fetch_graph":"https://pith.science/api/pith-number/OC4VIXVZKIO4EJPWZELF7PN34V/graph.json","fetch_events":"https://pith.science/api/pith-number/OC4VIXVZKIO4EJPWZELF7PN34V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OC4VIXVZKIO4EJPWZELF7PN34V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OC4VIXVZKIO4EJPWZELF7PN34V/action/storage_attestation","attest_author":"https://pith.science/pith/OC4VIXVZKIO4EJPWZELF7PN34V/action/author_attestation","sign_citation":"https://pith.science/pith/OC4VIXVZKIO4EJPWZELF7PN34V/action/citation_signature","submit_replication":"https://pith.science/pith/OC4VIXVZKIO4EJPWZELF7PN34V/action/replication_record"}},"created_at":"2026-07-05T09:48:12.343047+00:00","updated_at":"2026-07-05T09:48:12.343047+00:00"}