{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KC2GTPXXAWCS624OWPKG5TMZK2","short_pith_number":"pith:KC2GTPXX","schema_version":"1.0","canonical_sha256":"50b469bef705852f6b8eb3d46ecd9956a9c9ec562066c1ad666ae50010deaef2","source":{"kind":"arxiv","id":"1204.0047","version":2},"attestation_state":"computed","paper":{"title":"A Lipschitz Exploration-Exploitation Scheme for Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ali Jalali, Javad Azimi, Ruofei Zhang, Xiaoli Fern","submitted_at":"2012-03-30T23:39:29Z","abstract_excerpt":"The problem of optimizing unknown costly-to-evaluate functions has been studied for a long time in the context of Bayesian Optimization. Algorithms in this field aim to find the optimizer of the function by asking only a few function evaluations at locations carefully selected based on a posterior model. In this paper, we assume the unknown function is Lipschitz continuous. Leveraging the Lipschitz property, we propose an algorithm with a distinct exploration phase followed by an exploitation phase. The exploration phase aims to select samples that shrink the search space as much as possible. "},"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":"1204.0047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-30T23:39:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"89fe99162270054eae778d8998bbc43a092261ce9c41f651dbe64a5e2b6f559a","abstract_canon_sha256":"d946cb473f27f6751ad7d0e25a800c1c87484a566217693ba9f0cc1c1d3fdf38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:26.818447Z","signature_b64":"SIDOBVdaDx+/EplRGnLIqMI8YUnNCYp0PSBrvoiTjeom69OdxJFSGXDks3f5m6bZ3a+ltlGb0HjdFlSUzv/sBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50b469bef705852f6b8eb3d46ecd9956a9c9ec562066c1ad666ae50010deaef2","last_reissued_at":"2026-05-18T03:18:26.817938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:26.817938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lipschitz Exploration-Exploitation Scheme for Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ali Jalali, Javad Azimi, Ruofei Zhang, Xiaoli Fern","submitted_at":"2012-03-30T23:39:29Z","abstract_excerpt":"The problem of optimizing unknown costly-to-evaluate functions has been studied for a long time in the context of Bayesian Optimization. Algorithms in this field aim to find the optimizer of the function by asking only a few function evaluations at locations carefully selected based on a posterior model. In this paper, we assume the unknown function is Lipschitz continuous. Leveraging the Lipschitz property, we propose an algorithm with a distinct exploration phase followed by an exploitation phase. The exploration phase aims to select samples that shrink the search space as much as possible. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0047","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":"1204.0047","created_at":"2026-05-18T03:18:26.818019+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.0047v2","created_at":"2026-05-18T03:18:26.818019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0047","created_at":"2026-05-18T03:18:26.818019+00:00"},{"alias_kind":"pith_short_12","alias_value":"KC2GTPXXAWCS","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KC2GTPXXAWCS624O","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KC2GTPXX","created_at":"2026-05-18T12:27:11.947152+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/KC2GTPXXAWCS624OWPKG5TMZK2","json":"https://pith.science/pith/KC2GTPXXAWCS624OWPKG5TMZK2.json","graph_json":"https://pith.science/api/pith-number/KC2GTPXXAWCS624OWPKG5TMZK2/graph.json","events_json":"https://pith.science/api/pith-number/KC2GTPXXAWCS624OWPKG5TMZK2/events.json","paper":"https://pith.science/paper/KC2GTPXX"},"agent_actions":{"view_html":"https://pith.science/pith/KC2GTPXXAWCS624OWPKG5TMZK2","download_json":"https://pith.science/pith/KC2GTPXXAWCS624OWPKG5TMZK2.json","view_paper":"https://pith.science/paper/KC2GTPXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.0047&json=true","fetch_graph":"https://pith.science/api/pith-number/KC2GTPXXAWCS624OWPKG5TMZK2/graph.json","fetch_events":"https://pith.science/api/pith-number/KC2GTPXXAWCS624OWPKG5TMZK2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KC2GTPXXAWCS624OWPKG5TMZK2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KC2GTPXXAWCS624OWPKG5TMZK2/action/storage_attestation","attest_author":"https://pith.science/pith/KC2GTPXXAWCS624OWPKG5TMZK2/action/author_attestation","sign_citation":"https://pith.science/pith/KC2GTPXXAWCS624OWPKG5TMZK2/action/citation_signature","submit_replication":"https://pith.science/pith/KC2GTPXXAWCS624OWPKG5TMZK2/action/replication_record"}},"created_at":"2026-05-18T03:18:26.818019+00:00","updated_at":"2026-05-18T03:18:26.818019+00:00"}