{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WF6YC6RXYG7PBZAKF375YVLNDU","short_pith_number":"pith:WF6YC6RX","schema_version":"1.0","canonical_sha256":"b17d817a37c1bef0e40a2effdc556d1d35cd76336d05b5a593cf2b26cc2596fe","source":{"kind":"arxiv","id":"1905.10041","version":3},"attestation_state":"computed","paper":{"title":"Efficient Batch Black-box Optimization with Deterministic Regret Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ivor W. Tsang, Yuan Yuan, Yueming Lyu","submitted_at":"2019-05-24T05:40:05Z","abstract_excerpt":"In this work, we investigate black-box optimization from the perspective of frequentist kernel methods. We propose a novel batch optimization algorithm, which jointly maximizes the acquisition function and select points from a whole batch in a holistic way. Theoretically, we derive regret bounds for both the noise-free and perturbation settings irrespective of the choice of kernel. Moreover, we analyze the property of the adversarial regret that is required by a robust initialization for Bayesian Optimization (BO). We prove that the adversarial regret bounds decrease with the decrease of cover"},"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":"1905.10041","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T05:40:05Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"576b9b06bd9390ffba66fc2e75350fc81a5235acfbfc784208fb4cf0c4334b46","abstract_canon_sha256":"f996d4e4b751db63c8c619c0f493f23e8ab382be8a077feaa7138ec1fda49598"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:50:52.159097Z","signature_b64":"WMGCHxHKD0cwEuEVk46w3Vnl0W2mjgajlpDJySUPbsOnEMcMN7SdYfeFz4jphnZSN1ci7/kbk7KgCOzsOAOaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b17d817a37c1bef0e40a2effdc556d1d35cd76336d05b5a593cf2b26cc2596fe","last_reissued_at":"2026-07-05T00:50:52.158692Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:50:52.158692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Batch Black-box Optimization with Deterministic Regret Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ivor W. Tsang, Yuan Yuan, Yueming Lyu","submitted_at":"2019-05-24T05:40:05Z","abstract_excerpt":"In this work, we investigate black-box optimization from the perspective of frequentist kernel methods. We propose a novel batch optimization algorithm, which jointly maximizes the acquisition function and select points from a whole batch in a holistic way. Theoretically, we derive regret bounds for both the noise-free and perturbation settings irrespective of the choice of kernel. Moreover, we analyze the property of the adversarial regret that is required by a robust initialization for Bayesian Optimization (BO). We prove that the adversarial regret bounds decrease with the decrease of cover"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10041","kind":"arxiv","version":3},"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/1905.10041/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":"1905.10041","created_at":"2026-07-05T00:50:52.158750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10041v3","created_at":"2026-07-05T00:50:52.158750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10041","created_at":"2026-07-05T00:50:52.158750+00:00"},{"alias_kind":"pith_short_12","alias_value":"WF6YC6RXYG7P","created_at":"2026-07-05T00:50:52.158750+00:00"},{"alias_kind":"pith_short_16","alias_value":"WF6YC6RXYG7PBZAK","created_at":"2026-07-05T00:50:52.158750+00:00"},{"alias_kind":"pith_short_8","alias_value":"WF6YC6RX","created_at":"2026-07-05T00:50:52.158750+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/WF6YC6RXYG7PBZAKF375YVLNDU","json":"https://pith.science/pith/WF6YC6RXYG7PBZAKF375YVLNDU.json","graph_json":"https://pith.science/api/pith-number/WF6YC6RXYG7PBZAKF375YVLNDU/graph.json","events_json":"https://pith.science/api/pith-number/WF6YC6RXYG7PBZAKF375YVLNDU/events.json","paper":"https://pith.science/paper/WF6YC6RX"},"agent_actions":{"view_html":"https://pith.science/pith/WF6YC6RXYG7PBZAKF375YVLNDU","download_json":"https://pith.science/pith/WF6YC6RXYG7PBZAKF375YVLNDU.json","view_paper":"https://pith.science/paper/WF6YC6RX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10041&json=true","fetch_graph":"https://pith.science/api/pith-number/WF6YC6RXYG7PBZAKF375YVLNDU/graph.json","fetch_events":"https://pith.science/api/pith-number/WF6YC6RXYG7PBZAKF375YVLNDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WF6YC6RXYG7PBZAKF375YVLNDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WF6YC6RXYG7PBZAKF375YVLNDU/action/storage_attestation","attest_author":"https://pith.science/pith/WF6YC6RXYG7PBZAKF375YVLNDU/action/author_attestation","sign_citation":"https://pith.science/pith/WF6YC6RXYG7PBZAKF375YVLNDU/action/citation_signature","submit_replication":"https://pith.science/pith/WF6YC6RXYG7PBZAKF375YVLNDU/action/replication_record"}},"created_at":"2026-07-05T00:50:52.158750+00:00","updated_at":"2026-07-05T00:50:52.158750+00:00"}