{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PCU62FAUOB4OIZ73CBFK2LXYW6","short_pith_number":"pith:PCU62FAU","schema_version":"1.0","canonical_sha256":"78a9ed14147078e467fb104aad2ef8b7bac114b8bbfa7a415f8b7da4b42ed74a","source":{"kind":"arxiv","id":"2304.11468","version":1},"attestation_state":"computed","paper":{"title":"Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Leonard Papenmeier, Luigi Nardi, Matthias Poloczek","submitted_at":"2023-04-22T19:20:39Z","abstract_excerpt":"Recent advances have extended the scope of Bayesian optimization (BO) to expensive-to-evaluate black-box functions with dozens of dimensions, aspiring to unlock impactful applications, for example, in the life sciences, neural architecture search, and robotics. However, a closer examination reveals that the state-of-the-art methods for high-dimensional Bayesian optimization (HDBO) suffer from degrading performance as the number of dimensions increases or even risk failure if certain unverifiable assumptions are not met. This paper proposes BAxUS that leverages a novel family of nested random s"},"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":"2304.11468","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-22T19:20:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b0029edea0f7710a7c7b19d96dcaa3dc0d851b6be3368e2bddac3b3168521392","abstract_canon_sha256":"c8dcde57d92117189d349d0768282ef842fb62a2b2e6a788d45696b34652159f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:01.878636Z","signature_b64":"L2nE0ndETkVANVxa3A/q4D/CopLM9SVMyDZPVWGbf17bnp+k+cGfgiVN0fHlvMlO1g0eNT0AtyLky8h9/7esDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78a9ed14147078e467fb104aad2ef8b7bac114b8bbfa7a415f8b7da4b42ed74a","last_reissued_at":"2026-05-17T23:39:01.877941Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:01.877941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Leonard Papenmeier, Luigi Nardi, Matthias Poloczek","submitted_at":"2023-04-22T19:20:39Z","abstract_excerpt":"Recent advances have extended the scope of Bayesian optimization (BO) to expensive-to-evaluate black-box functions with dozens of dimensions, aspiring to unlock impactful applications, for example, in the life sciences, neural architecture search, and robotics. However, a closer examination reveals that the state-of-the-art methods for high-dimensional Bayesian optimization (HDBO) suffer from degrading performance as the number of dimensions increases or even risk failure if certain unverifiable assumptions are not met. This paper proposes BAxUS that leverages a novel family of nested random s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.11468","kind":"arxiv","version":1},"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":"2304.11468","created_at":"2026-05-17T23:39:01.878070+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.11468v1","created_at":"2026-05-17T23:39:01.878070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.11468","created_at":"2026-05-17T23:39:01.878070+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCU62FAUOB4O","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCU62FAUOB4OIZ73","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCU62FAU","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16520","citing_title":"Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing","ref_index":171,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PCU62FAUOB4OIZ73CBFK2LXYW6","json":"https://pith.science/pith/PCU62FAUOB4OIZ73CBFK2LXYW6.json","graph_json":"https://pith.science/api/pith-number/PCU62FAUOB4OIZ73CBFK2LXYW6/graph.json","events_json":"https://pith.science/api/pith-number/PCU62FAUOB4OIZ73CBFK2LXYW6/events.json","paper":"https://pith.science/paper/PCU62FAU"},"agent_actions":{"view_html":"https://pith.science/pith/PCU62FAUOB4OIZ73CBFK2LXYW6","download_json":"https://pith.science/pith/PCU62FAUOB4OIZ73CBFK2LXYW6.json","view_paper":"https://pith.science/paper/PCU62FAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.11468&json=true","fetch_graph":"https://pith.science/api/pith-number/PCU62FAUOB4OIZ73CBFK2LXYW6/graph.json","fetch_events":"https://pith.science/api/pith-number/PCU62FAUOB4OIZ73CBFK2LXYW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCU62FAUOB4OIZ73CBFK2LXYW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCU62FAUOB4OIZ73CBFK2LXYW6/action/storage_attestation","attest_author":"https://pith.science/pith/PCU62FAUOB4OIZ73CBFK2LXYW6/action/author_attestation","sign_citation":"https://pith.science/pith/PCU62FAUOB4OIZ73CBFK2LXYW6/action/citation_signature","submit_replication":"https://pith.science/pith/PCU62FAUOB4OIZ73CBFK2LXYW6/action/replication_record"}},"created_at":"2026-05-17T23:39:01.878070+00:00","updated_at":"2026-05-17T23:39:01.878070+00:00"}