{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2UAAD6YGDBWWDYRJDJKZ7DXAIU","short_pith_number":"pith:2UAAD6YG","schema_version":"1.0","canonical_sha256":"d50001fb06186d61e2291a559f8ee04520639a4465fa2cd0a35bfd8c78422f6e","source":{"kind":"arxiv","id":"1902.03229","version":2},"attestation_state":"computed","paper":{"title":"Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andreas Krause, Johannes Kirschner, Mojm\\'ir Mutn\\'y, Nicole Hiller, Rasmus Ischebeck","submitted_at":"2019-02-08T18:41:24Z","abstract_excerpt":"Bayesian optimization is known to be difficult to scale to high dimensions, because the acquisition step requires solving a non-convex optimization problem in the same search space. In order to scale the method and keep its benefits, we propose an algorithm (LineBO) that restricts the problem to a sequence of iteratively chosen one-dimensional sub-problems that can be solved efficiently. We show that our algorithm converges globally and obtains a fast local rate when the function is strongly convex. Further, if the objective has an invariant subspace, our method automatically adapts to the eff"},"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":"1902.03229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-08T18:41:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1ca3d1e573a1ab38c8fecda514848d37a11de6a9ab7bad1d9d1b4a2d0a639158","abstract_canon_sha256":"82d8beee8bdfb0ea6d7df0cfd0fac4d87ba4d61a0a90b795d4bbc798a5e7ded6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:55.405728Z","signature_b64":"5XwisX3BCUXm3hIQ/pPq63hoMmSP5njEo2kXX+pk6p4zImFGeoabGpKeEWfgRY3g90iU/Gh8V6FwHk6SL1bbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d50001fb06186d61e2291a559f8ee04520639a4465fa2cd0a35bfd8c78422f6e","last_reissued_at":"2026-05-17T23:44:55.405303Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:55.405303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andreas Krause, Johannes Kirschner, Mojm\\'ir Mutn\\'y, Nicole Hiller, Rasmus Ischebeck","submitted_at":"2019-02-08T18:41:24Z","abstract_excerpt":"Bayesian optimization is known to be difficult to scale to high dimensions, because the acquisition step requires solving a non-convex optimization problem in the same search space. In order to scale the method and keep its benefits, we propose an algorithm (LineBO) that restricts the problem to a sequence of iteratively chosen one-dimensional sub-problems that can be solved efficiently. We show that our algorithm converges globally and obtains a fast local rate when the function is strongly convex. Further, if the objective has an invariant subspace, our method automatically adapts to the eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03229","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":"1902.03229","created_at":"2026-05-17T23:44:55.405374+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03229v2","created_at":"2026-05-17T23:44:55.405374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03229","created_at":"2026-05-17T23:44:55.405374+00:00"},{"alias_kind":"pith_short_12","alias_value":"2UAAD6YGDBWW","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2UAAD6YGDBWWDYRJ","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2UAAD6YG","created_at":"2026-05-18T12:33:07.085635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2009.02539","citing_title":"Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2UAAD6YGDBWWDYRJDJKZ7DXAIU","json":"https://pith.science/pith/2UAAD6YGDBWWDYRJDJKZ7DXAIU.json","graph_json":"https://pith.science/api/pith-number/2UAAD6YGDBWWDYRJDJKZ7DXAIU/graph.json","events_json":"https://pith.science/api/pith-number/2UAAD6YGDBWWDYRJDJKZ7DXAIU/events.json","paper":"https://pith.science/paper/2UAAD6YG"},"agent_actions":{"view_html":"https://pith.science/pith/2UAAD6YGDBWWDYRJDJKZ7DXAIU","download_json":"https://pith.science/pith/2UAAD6YGDBWWDYRJDJKZ7DXAIU.json","view_paper":"https://pith.science/paper/2UAAD6YG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03229&json=true","fetch_graph":"https://pith.science/api/pith-number/2UAAD6YGDBWWDYRJDJKZ7DXAIU/graph.json","fetch_events":"https://pith.science/api/pith-number/2UAAD6YGDBWWDYRJDJKZ7DXAIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2UAAD6YGDBWWDYRJDJKZ7DXAIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2UAAD6YGDBWWDYRJDJKZ7DXAIU/action/storage_attestation","attest_author":"https://pith.science/pith/2UAAD6YGDBWWDYRJDJKZ7DXAIU/action/author_attestation","sign_citation":"https://pith.science/pith/2UAAD6YGDBWWDYRJDJKZ7DXAIU/action/citation_signature","submit_replication":"https://pith.science/pith/2UAAD6YGDBWWDYRJDJKZ7DXAIU/action/replication_record"}},"created_at":"2026-05-17T23:44:55.405374+00:00","updated_at":"2026-05-17T23:44:55.405374+00:00"}