{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OYLGIBOFUTGZM5VTWVDPESN7GQ","short_pith_number":"pith:OYLGIBOF","schema_version":"1.0","canonical_sha256":"76166405c5a4cd9676b3b546f249bf342fb84062ea05bd65766afe13cf15724e","source":{"kind":"arxiv","id":"1110.3347","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Batch Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ali Jalali, Javad Azimi, Xiaoli Fern","submitted_at":"2011-10-14T21:47:12Z","abstract_excerpt":"Bayesian optimization (BO) algorithms try to optimize an unknown function that is expensive to evaluate using minimum number of evaluations/experiments. Most of the proposed algorithms in BO are sequential, where only one experiment is selected at each iteration. This method can be time inefficient when each experiment takes a long time and more than one experiment can be ran concurrently. On the other hand, requesting a fix-sized batch of experiments at each iteration causes performance inefficiency in BO compared to the sequential policies. In this paper, we present an algorithm that asks a "},"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":"1110.3347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-10-14T21:47:12Z","cross_cats_sorted":[],"title_canon_sha256":"3584f1b1ad41b30e48f5537466e048b6ac86bb7d442790610cf174c678b99ec8","abstract_canon_sha256":"8dc5642d05ff42b9a4750b962e1950102c7e9e7f7174fb646dcfcdc61262ff9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:56.100361Z","signature_b64":"Bg6IU550tqoe4GyFdiLP8MwmzyVGtKS9p4Rc8y3F1FdbcBs4Ux7OFSA3RB03DYZ3e2VY6mcyfwigShWwLjkUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76166405c5a4cd9676b3b546f249bf342fb84062ea05bd65766afe13cf15724e","last_reissued_at":"2026-05-18T04:10:56.099786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:56.099786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Batch Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ali Jalali, Javad Azimi, Xiaoli Fern","submitted_at":"2011-10-14T21:47:12Z","abstract_excerpt":"Bayesian optimization (BO) algorithms try to optimize an unknown function that is expensive to evaluate using minimum number of evaluations/experiments. Most of the proposed algorithms in BO are sequential, where only one experiment is selected at each iteration. This method can be time inefficient when each experiment takes a long time and more than one experiment can be ran concurrently. On the other hand, requesting a fix-sized batch of experiments at each iteration causes performance inefficiency in BO compared to the sequential policies. In this paper, we present an algorithm that asks a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3347","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":"1110.3347","created_at":"2026-05-18T04:10:56.099876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.3347v1","created_at":"2026-05-18T04:10:56.099876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3347","created_at":"2026-05-18T04:10:56.099876+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYLGIBOFUTGZ","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYLGIBOFUTGZM5VT","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYLGIBOF","created_at":"2026-05-18T12:26:37.096874+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/OYLGIBOFUTGZM5VTWVDPESN7GQ","json":"https://pith.science/pith/OYLGIBOFUTGZM5VTWVDPESN7GQ.json","graph_json":"https://pith.science/api/pith-number/OYLGIBOFUTGZM5VTWVDPESN7GQ/graph.json","events_json":"https://pith.science/api/pith-number/OYLGIBOFUTGZM5VTWVDPESN7GQ/events.json","paper":"https://pith.science/paper/OYLGIBOF"},"agent_actions":{"view_html":"https://pith.science/pith/OYLGIBOFUTGZM5VTWVDPESN7GQ","download_json":"https://pith.science/pith/OYLGIBOFUTGZM5VTWVDPESN7GQ.json","view_paper":"https://pith.science/paper/OYLGIBOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.3347&json=true","fetch_graph":"https://pith.science/api/pith-number/OYLGIBOFUTGZM5VTWVDPESN7GQ/graph.json","fetch_events":"https://pith.science/api/pith-number/OYLGIBOFUTGZM5VTWVDPESN7GQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYLGIBOFUTGZM5VTWVDPESN7GQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYLGIBOFUTGZM5VTWVDPESN7GQ/action/storage_attestation","attest_author":"https://pith.science/pith/OYLGIBOFUTGZM5VTWVDPESN7GQ/action/author_attestation","sign_citation":"https://pith.science/pith/OYLGIBOFUTGZM5VTWVDPESN7GQ/action/citation_signature","submit_replication":"https://pith.science/pith/OYLGIBOFUTGZM5VTWVDPESN7GQ/action/replication_record"}},"created_at":"2026-05-18T04:10:56.099876+00:00","updated_at":"2026-05-18T04:10:56.099876+00:00"}