{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AHNZDJ7HHPPEUHM2X4ZQCGEBMP","short_pith_number":"pith:AHNZDJ7H","schema_version":"1.0","canonical_sha256":"01db91a7e73bde4a1d9abf3301188163f698daa06bc286bfd2e2a4c7b9dda9cd","source":{"kind":"arxiv","id":"1911.12809","version":2},"attestation_state":"computed","paper":{"title":"Greed is Good: Exploration and Exploitation Trade-offs in Bayesian Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alma A. M. Rahat, George De Ath, Jonathan E. Fieldsend, Richard M. Everson","submitted_at":"2019-11-28T17:52:06Z","abstract_excerpt":"The performance of acquisition functions for Bayesian optimisation to locate the global optimum of continuous functions is investigated in terms of the Pareto front between exploration and exploitation. We show that Expected Improvement (EI) and the Upper Confidence Bound (UCB) always select solutions to be expensively evaluated on the Pareto front, but Probability of Improvement is not guaranteed to do so and Weighted Expected Improvement does so only for a restricted range of weights.\n  We introduce two novel $\\epsilon$-greedy acquisition functions. Extensive empirical evaluation of these to"},"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":"1911.12809","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-28T17:52:06Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"c7110c63e494ca82771978dfbecaf1418e891d460ee9871e0c92a2551ab628bf","abstract_canon_sha256":"81e398ca9704fd1c5c674ded7c1ff4709d7881dfc7fd1d08e9ab4ec77d5fba3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:35:49.350977Z","signature_b64":"Z1oBJJQbEIV2F2wN3VK3MxGUcgf9Crud7rQBGpVBOLjRHHrnuGfOVGNH2J5sMamqLWSK31x6z7kWuu0rep8cCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01db91a7e73bde4a1d9abf3301188163f698daa06bc286bfd2e2a4c7b9dda9cd","last_reissued_at":"2026-07-05T02:35:49.350472Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:35:49.350472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greed is Good: Exploration and Exploitation Trade-offs in Bayesian Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alma A. M. Rahat, George De Ath, Jonathan E. Fieldsend, Richard M. Everson","submitted_at":"2019-11-28T17:52:06Z","abstract_excerpt":"The performance of acquisition functions for Bayesian optimisation to locate the global optimum of continuous functions is investigated in terms of the Pareto front between exploration and exploitation. We show that Expected Improvement (EI) and the Upper Confidence Bound (UCB) always select solutions to be expensively evaluated on the Pareto front, but Probability of Improvement is not guaranteed to do so and Weighted Expected Improvement does so only for a restricted range of weights.\n  We introduce two novel $\\epsilon$-greedy acquisition functions. Extensive empirical evaluation of these to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.12809","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.12809/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":"1911.12809","created_at":"2026-07-05T02:35:49.350533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.12809v2","created_at":"2026-07-05T02:35:49.350533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.12809","created_at":"2026-07-05T02:35:49.350533+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHNZDJ7HHPPE","created_at":"2026-07-05T02:35:49.350533+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHNZDJ7HHPPEUHM2","created_at":"2026-07-05T02:35:49.350533+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHNZDJ7H","created_at":"2026-07-05T02:35:49.350533+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07416","citing_title":"Bayesian Optimization for Mixed-Variable Problems in the Natural Sciences","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AHNZDJ7HHPPEUHM2X4ZQCGEBMP","json":"https://pith.science/pith/AHNZDJ7HHPPEUHM2X4ZQCGEBMP.json","graph_json":"https://pith.science/api/pith-number/AHNZDJ7HHPPEUHM2X4ZQCGEBMP/graph.json","events_json":"https://pith.science/api/pith-number/AHNZDJ7HHPPEUHM2X4ZQCGEBMP/events.json","paper":"https://pith.science/paper/AHNZDJ7H"},"agent_actions":{"view_html":"https://pith.science/pith/AHNZDJ7HHPPEUHM2X4ZQCGEBMP","download_json":"https://pith.science/pith/AHNZDJ7HHPPEUHM2X4ZQCGEBMP.json","view_paper":"https://pith.science/paper/AHNZDJ7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.12809&json=true","fetch_graph":"https://pith.science/api/pith-number/AHNZDJ7HHPPEUHM2X4ZQCGEBMP/graph.json","fetch_events":"https://pith.science/api/pith-number/AHNZDJ7HHPPEUHM2X4ZQCGEBMP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHNZDJ7HHPPEUHM2X4ZQCGEBMP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHNZDJ7HHPPEUHM2X4ZQCGEBMP/action/storage_attestation","attest_author":"https://pith.science/pith/AHNZDJ7HHPPEUHM2X4ZQCGEBMP/action/author_attestation","sign_citation":"https://pith.science/pith/AHNZDJ7HHPPEUHM2X4ZQCGEBMP/action/citation_signature","submit_replication":"https://pith.science/pith/AHNZDJ7HHPPEUHM2X4ZQCGEBMP/action/replication_record"}},"created_at":"2026-07-05T02:35:49.350533+00:00","updated_at":"2026-07-05T02:35:49.350533+00:00"}