{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6765QYGQQNV6ZWO4WD4QF2WMKO","short_pith_number":"pith:6765QYGQ","schema_version":"1.0","canonical_sha256":"f7fdd860d0836becd9dcb0f902eacc53bb29cd0ded33719b170d6837ce8c495d","source":{"kind":"arxiv","id":"2606.00956","version":1},"attestation_state":"computed","paper":{"title":"Optimal-Point Variance Reduction For Bayesian Optimization With Regret Guarantee","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Shion Takeno","submitted_at":"2026-05-31T02:16:21Z","abstract_excerpt":"This paper studies a one-step lookahead Bayesian optimization (BO) method and its theoretical guarantee. Although the empirical effectiveness of one-step lookahead BO methods, such as entropy search, has been studied extensively, they often rely on computationally intractable approximations, and their regret guarantees remain underdeveloped. Thus, this paper proposes a one-step lookahead BO method called optimal-point variance reduction (OVR), which requires only posterior sampling and Monte Carlo approximations. We obtain a uniform error bound over an input domain for the Monte Carlo estimati"},"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":"2606.00956","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-31T02:16:21Z","cross_cats_sorted":[],"title_canon_sha256":"f6f0c4cf3efe7dba22b280d09113bc59c1fd2e7f0cde308acda51d82f5ab1294","abstract_canon_sha256":"db1f90bf1dee69e81096230518a6bfd7b2f0f51b4cdfc390523b1b09cdb88153"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:10.402465Z","signature_b64":"H8zr/ac+BbGFOUUxvAsmZlU6lEhhpzbl7oDYHGnRdU6E/ZD1JJEXlRLszfqpfMmNc24Qmtt6l7It6Nc4iWOxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7fdd860d0836becd9dcb0f902eacc53bb29cd0ded33719b170d6837ce8c495d","last_reissued_at":"2026-06-02T01:04:10.402014Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:10.402014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal-Point Variance Reduction For Bayesian Optimization With Regret Guarantee","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Shion Takeno","submitted_at":"2026-05-31T02:16:21Z","abstract_excerpt":"This paper studies a one-step lookahead Bayesian optimization (BO) method and its theoretical guarantee. Although the empirical effectiveness of one-step lookahead BO methods, such as entropy search, has been studied extensively, they often rely on computationally intractable approximations, and their regret guarantees remain underdeveloped. Thus, this paper proposes a one-step lookahead BO method called optimal-point variance reduction (OVR), which requires only posterior sampling and Monte Carlo approximations. We obtain a uniform error bound over an input domain for the Monte Carlo estimati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00956","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.00956/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":"2606.00956","created_at":"2026-06-02T01:04:10.402082+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.00956v1","created_at":"2026-06-02T01:04:10.402082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00956","created_at":"2026-06-02T01:04:10.402082+00:00"},{"alias_kind":"pith_short_12","alias_value":"6765QYGQQNV6","created_at":"2026-06-02T01:04:10.402082+00:00"},{"alias_kind":"pith_short_16","alias_value":"6765QYGQQNV6ZWO4","created_at":"2026-06-02T01:04:10.402082+00:00"},{"alias_kind":"pith_short_8","alias_value":"6765QYGQ","created_at":"2026-06-02T01:04:10.402082+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6765QYGQQNV6ZWO4WD4QF2WMKO","json":"https://pith.science/pith/6765QYGQQNV6ZWO4WD4QF2WMKO.json","graph_json":"https://pith.science/api/pith-number/6765QYGQQNV6ZWO4WD4QF2WMKO/graph.json","events_json":"https://pith.science/api/pith-number/6765QYGQQNV6ZWO4WD4QF2WMKO/events.json","paper":"https://pith.science/paper/6765QYGQ"},"agent_actions":{"view_html":"https://pith.science/pith/6765QYGQQNV6ZWO4WD4QF2WMKO","download_json":"https://pith.science/pith/6765QYGQQNV6ZWO4WD4QF2WMKO.json","view_paper":"https://pith.science/paper/6765QYGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.00956&json=true","fetch_graph":"https://pith.science/api/pith-number/6765QYGQQNV6ZWO4WD4QF2WMKO/graph.json","fetch_events":"https://pith.science/api/pith-number/6765QYGQQNV6ZWO4WD4QF2WMKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6765QYGQQNV6ZWO4WD4QF2WMKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6765QYGQQNV6ZWO4WD4QF2WMKO/action/storage_attestation","attest_author":"https://pith.science/pith/6765QYGQQNV6ZWO4WD4QF2WMKO/action/author_attestation","sign_citation":"https://pith.science/pith/6765QYGQQNV6ZWO4WD4QF2WMKO/action/citation_signature","submit_replication":"https://pith.science/pith/6765QYGQQNV6ZWO4WD4QF2WMKO/action/replication_record"}},"created_at":"2026-06-02T01:04:10.402082+00:00","updated_at":"2026-06-02T01:04:10.402082+00:00"}