{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QZDPGLLYH7UVASHWMHONWT6W3Y","short_pith_number":"pith:QZDPGLLY","schema_version":"1.0","canonical_sha256":"8646f32d783fe95048f661dcdb4fd6de20eaef047640ddb973f2c56fb3020310","source":{"kind":"arxiv","id":"1604.01348","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Optimization with Exponential Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Kenji Kawaguchi, Leslie Pack Kaelbling, Tom\\'as Lozano-P\\'erez","submitted_at":"2016-04-05T17:53:59Z","abstract_excerpt":"This paper presents a Bayesian optimization method with exponential convergence without the need of auxiliary optimization and without the delta-cover sampling. Most Bayesian optimization methods require auxiliary optimization: an additional non-convex global optimization problem, which can be time-consuming and hard to implement in practice. Also, the existing Bayesian optimization method with exponential convergence requires access to the delta-cover sampling, which was considered to be impractical. Our approach eliminates both requirements and achieves an exponential convergence rate."},"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":"1604.01348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-05T17:53:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2a2670bfc71298bb95fa6f68723753b2f7b4ecfe4784fdf987f0455c88617269","abstract_canon_sha256":"fbd6f811bb7662a6e4cc0d4d38fca93e98468c62cb596aa045ba2225a081ef35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:38.456211Z","signature_b64":"pD9gGx4jlrSwj83zKHU/av88a1MSIJLh+TCxKucpyrUQQ7xBNmDCQh3YvzcJhfOqNKEWjROIW+xXwAdQQc4mCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8646f32d783fe95048f661dcdb4fd6de20eaef047640ddb973f2c56fb3020310","last_reissued_at":"2026-05-18T01:17:38.455640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:38.455640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Optimization with Exponential Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Kenji Kawaguchi, Leslie Pack Kaelbling, Tom\\'as Lozano-P\\'erez","submitted_at":"2016-04-05T17:53:59Z","abstract_excerpt":"This paper presents a Bayesian optimization method with exponential convergence without the need of auxiliary optimization and without the delta-cover sampling. Most Bayesian optimization methods require auxiliary optimization: an additional non-convex global optimization problem, which can be time-consuming and hard to implement in practice. Also, the existing Bayesian optimization method with exponential convergence requires access to the delta-cover sampling, which was considered to be impractical. Our approach eliminates both requirements and achieves an exponential convergence rate."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01348","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":"1604.01348","created_at":"2026-05-18T01:17:38.455746+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.01348v1","created_at":"2026-05-18T01:17:38.455746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01348","created_at":"2026-05-18T01:17:38.455746+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZDPGLLYH7UV","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZDPGLLYH7UVASHW","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZDPGLLY","created_at":"2026-05-18T12:30:41.710351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2105.04332","citing_title":"Bayesian Optimistic Optimisation with Exponentially Decaying Regret","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QZDPGLLYH7UVASHWMHONWT6W3Y","json":"https://pith.science/pith/QZDPGLLYH7UVASHWMHONWT6W3Y.json","graph_json":"https://pith.science/api/pith-number/QZDPGLLYH7UVASHWMHONWT6W3Y/graph.json","events_json":"https://pith.science/api/pith-number/QZDPGLLYH7UVASHWMHONWT6W3Y/events.json","paper":"https://pith.science/paper/QZDPGLLY"},"agent_actions":{"view_html":"https://pith.science/pith/QZDPGLLYH7UVASHWMHONWT6W3Y","download_json":"https://pith.science/pith/QZDPGLLYH7UVASHWMHONWT6W3Y.json","view_paper":"https://pith.science/paper/QZDPGLLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.01348&json=true","fetch_graph":"https://pith.science/api/pith-number/QZDPGLLYH7UVASHWMHONWT6W3Y/graph.json","fetch_events":"https://pith.science/api/pith-number/QZDPGLLYH7UVASHWMHONWT6W3Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZDPGLLYH7UVASHWMHONWT6W3Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZDPGLLYH7UVASHWMHONWT6W3Y/action/storage_attestation","attest_author":"https://pith.science/pith/QZDPGLLYH7UVASHWMHONWT6W3Y/action/author_attestation","sign_citation":"https://pith.science/pith/QZDPGLLYH7UVASHWMHONWT6W3Y/action/citation_signature","submit_replication":"https://pith.science/pith/QZDPGLLYH7UVASHWMHONWT6W3Y/action/replication_record"}},"created_at":"2026-05-18T01:17:38.455746+00:00","updated_at":"2026-05-18T01:17:38.455746+00:00"}