{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:63PEVFRXNJEK3F2UZH7CKQ6RLW","short_pith_number":"pith:63PEVFRX","schema_version":"1.0","canonical_sha256":"f6de4a96376a48ad9754c9fe2543d15da419bfe5d2f33d958819dc523cbf8c60","source":{"kind":"arxiv","id":"2003.10870","version":1},"attestation_state":"computed","paper":{"title":"Cost-aware Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cedric Archambeau, Eric Hans Lee, Matthias Seeger, Valerio Perrone","submitted_at":"2020-03-22T14:51:04Z","abstract_excerpt":"Bayesian optimization (BO) is a class of global optimization algorithms, suitable for minimizing an expensive objective function in as few function evaluations as possible. While BO budgets are typically given in iterations, this implicitly measures convergence in terms of iteration count and assumes each evaluation has identical cost. In practice, evaluation costs may vary in different regions of the search space. For example, the cost of neural network training increases quadratically with layer size, which is a typical hyperparameter. Cost-aware BO measures convergence with alternative cost"},"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":"2003.10870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-22T14:51:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0d814fc5ff5eac2e09b826f5ef67e2607f63d7c8614a2110be5c91d85eae2617","abstract_canon_sha256":"590fe2249c6b409543ec0d9b960f6877370c90bad919b7919b394778619162d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:50:21.596962Z","signature_b64":"1Gao7YGC4MP7euEVf1GTPBSD2I9uS2yXVyhY++XFI5YYzhUfPiKUr7utTOPnE7GgZO451oyLGnzfjkqATnUEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6de4a96376a48ad9754c9fe2543d15da419bfe5d2f33d958819dc523cbf8c60","last_reissued_at":"2026-07-05T00:50:21.596476Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:50:21.596476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cost-aware Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cedric Archambeau, Eric Hans Lee, Matthias Seeger, Valerio Perrone","submitted_at":"2020-03-22T14:51:04Z","abstract_excerpt":"Bayesian optimization (BO) is a class of global optimization algorithms, suitable for minimizing an expensive objective function in as few function evaluations as possible. While BO budgets are typically given in iterations, this implicitly measures convergence in terms of iteration count and assumes each evaluation has identical cost. In practice, evaluation costs may vary in different regions of the search space. For example, the cost of neural network training increases quadratically with layer size, which is a typical hyperparameter. Cost-aware BO measures convergence with alternative cost"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.10870","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.10870/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":"2003.10870","created_at":"2026-07-05T00:50:21.596536+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.10870v1","created_at":"2026-07-05T00:50:21.596536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.10870","created_at":"2026-07-05T00:50:21.596536+00:00"},{"alias_kind":"pith_short_12","alias_value":"63PEVFRXNJEK","created_at":"2026-07-05T00:50:21.596536+00:00"},{"alias_kind":"pith_short_16","alias_value":"63PEVFRXNJEK3F2U","created_at":"2026-07-05T00:50:21.596536+00:00"},{"alias_kind":"pith_short_8","alias_value":"63PEVFRX","created_at":"2026-07-05T00:50:21.596536+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20498","citing_title":"CLUSTER: Derivative-free optimization of smooth functions with parameter-change costs","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21458","citing_title":"Mind the Sim-to-Real Gap & Think Like a Scientist","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12898","citing_title":"BEAM: Bi-level Memory-adaptive Algorithmic Evolution for LLM-Powered Heuristic Design","ref_index":52,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/63PEVFRXNJEK3F2UZH7CKQ6RLW","json":"https://pith.science/pith/63PEVFRXNJEK3F2UZH7CKQ6RLW.json","graph_json":"https://pith.science/api/pith-number/63PEVFRXNJEK3F2UZH7CKQ6RLW/graph.json","events_json":"https://pith.science/api/pith-number/63PEVFRXNJEK3F2UZH7CKQ6RLW/events.json","paper":"https://pith.science/paper/63PEVFRX"},"agent_actions":{"view_html":"https://pith.science/pith/63PEVFRXNJEK3F2UZH7CKQ6RLW","download_json":"https://pith.science/pith/63PEVFRXNJEK3F2UZH7CKQ6RLW.json","view_paper":"https://pith.science/paper/63PEVFRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.10870&json=true","fetch_graph":"https://pith.science/api/pith-number/63PEVFRXNJEK3F2UZH7CKQ6RLW/graph.json","fetch_events":"https://pith.science/api/pith-number/63PEVFRXNJEK3F2UZH7CKQ6RLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63PEVFRXNJEK3F2UZH7CKQ6RLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63PEVFRXNJEK3F2UZH7CKQ6RLW/action/storage_attestation","attest_author":"https://pith.science/pith/63PEVFRXNJEK3F2UZH7CKQ6RLW/action/author_attestation","sign_citation":"https://pith.science/pith/63PEVFRXNJEK3F2UZH7CKQ6RLW/action/citation_signature","submit_replication":"https://pith.science/pith/63PEVFRXNJEK3F2UZH7CKQ6RLW/action/replication_record"}},"created_at":"2026-07-05T00:50:21.596536+00:00","updated_at":"2026-07-05T00:50:21.596536+00:00"}