{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KESRXSFOX5ZZUEASOQBZW4RCIW","short_pith_number":"pith:KESRXSFO","schema_version":"1.0","canonical_sha256":"51251bc8aebf739a101274039b7222459e71d70500446f9a5697bf101ccda7d8","source":{"kind":"arxiv","id":"1903.04703","version":1},"attestation_state":"computed","paper":{"title":"Practical Multi-fidelity Bayesian Optimization for Hyperparameter Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Gordon Wilson, Jian Wu, Peter I. Frazier, Saul Toscano-Palmerin","submitted_at":"2019-03-12T02:14:04Z","abstract_excerpt":"Bayesian optimization is popular for optimizing time-consuming black-box objectives. Nonetheless, for hyperparameter tuning in deep neural networks, the time required to evaluate the validation error for even a few hyperparameter settings remains a bottleneck. Multi-fidelity optimization promises relief using cheaper proxies to such objectives --- for example, validation error for a network trained using a subset of the training points or fewer iterations than required for convergence. We propose a highly flexible and practical approach to multi-fidelity Bayesian optimization, focused on effic"},"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":"1903.04703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-12T02:14:04Z","cross_cats_sorted":["math.OC","stat.ME","stat.ML"],"title_canon_sha256":"950315b165f2966abe49d3c9c382bbdc3ed8d972f54ce6808dceea43c09bec46","abstract_canon_sha256":"117196b45fc1bafe1dc9d6135c0f5d230b3bb634fb66979270fc81fea3396380"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:28.903386Z","signature_b64":"j6DRlC1e+0yOb5by+eVDGKGLzGgWXxhJkwTnVR1G/RjrzF59wQPitRlIfzIZ/7i3xXI7DBgZKFommsZQtmcXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51251bc8aebf739a101274039b7222459e71d70500446f9a5697bf101ccda7d8","last_reissued_at":"2026-05-17T23:51:28.902723Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:28.902723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Multi-fidelity Bayesian Optimization for Hyperparameter Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Gordon Wilson, Jian Wu, Peter I. Frazier, Saul Toscano-Palmerin","submitted_at":"2019-03-12T02:14:04Z","abstract_excerpt":"Bayesian optimization is popular for optimizing time-consuming black-box objectives. Nonetheless, for hyperparameter tuning in deep neural networks, the time required to evaluate the validation error for even a few hyperparameter settings remains a bottleneck. Multi-fidelity optimization promises relief using cheaper proxies to such objectives --- for example, validation error for a network trained using a subset of the training points or fewer iterations than required for convergence. We propose a highly flexible and practical approach to multi-fidelity Bayesian optimization, focused on effic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04703","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":"1903.04703","created_at":"2026-05-17T23:51:28.902816+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.04703v1","created_at":"2026-05-17T23:51:28.902816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04703","created_at":"2026-05-17T23:51:28.902816+00:00"},{"alias_kind":"pith_short_12","alias_value":"KESRXSFOX5ZZ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KESRXSFOX5ZZUEAS","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KESRXSFO","created_at":"2026-05-18T12:33:21.387695+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/KESRXSFOX5ZZUEASOQBZW4RCIW","json":"https://pith.science/pith/KESRXSFOX5ZZUEASOQBZW4RCIW.json","graph_json":"https://pith.science/api/pith-number/KESRXSFOX5ZZUEASOQBZW4RCIW/graph.json","events_json":"https://pith.science/api/pith-number/KESRXSFOX5ZZUEASOQBZW4RCIW/events.json","paper":"https://pith.science/paper/KESRXSFO"},"agent_actions":{"view_html":"https://pith.science/pith/KESRXSFOX5ZZUEASOQBZW4RCIW","download_json":"https://pith.science/pith/KESRXSFOX5ZZUEASOQBZW4RCIW.json","view_paper":"https://pith.science/paper/KESRXSFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.04703&json=true","fetch_graph":"https://pith.science/api/pith-number/KESRXSFOX5ZZUEASOQBZW4RCIW/graph.json","fetch_events":"https://pith.science/api/pith-number/KESRXSFOX5ZZUEASOQBZW4RCIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KESRXSFOX5ZZUEASOQBZW4RCIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KESRXSFOX5ZZUEASOQBZW4RCIW/action/storage_attestation","attest_author":"https://pith.science/pith/KESRXSFOX5ZZUEASOQBZW4RCIW/action/author_attestation","sign_citation":"https://pith.science/pith/KESRXSFOX5ZZUEASOQBZW4RCIW/action/citation_signature","submit_replication":"https://pith.science/pith/KESRXSFOX5ZZUEASOQBZW4RCIW/action/replication_record"}},"created_at":"2026-05-17T23:51:28.902816+00:00","updated_at":"2026-05-17T23:51:28.902816+00:00"}