{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:L3UHSUOA2H33P4MTXACOJHUHZ6","short_pith_number":"pith:L3UHSUOA","schema_version":"1.0","canonical_sha256":"5ee87951c0d1f7b7f193b804e49e87cf8a62f320e67e562df22f662a48dcfcc1","source":{"kind":"arxiv","id":"1406.3896","version":1},"attestation_state":"computed","paper":{"title":"Freeze-Thaw Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jasper Snoek, Kevin Swersky, Ryan Prescott Adams","submitted_at":"2014-06-16T03:43:20Z","abstract_excerpt":"In this paper we develop a dynamic form of Bayesian optimization for machine learning models with the goal of rapidly finding good hyperparameter settings. Our method uses the partial information gained during the training of a machine learning model in order to decide whether to pause training and start a new model, or resume the training of a previously-considered model. We specifically tailor our method to machine learning problems by developing a novel positive-definite covariance kernel to capture a variety of training curves. Furthermore, we develop a Gaussian process prior that scales g"},"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":"1406.3896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-16T03:43:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5e0689f34963fa0e288a768ea8f722452bc76e08998fec021a0b7d9ff65fb606","abstract_canon_sha256":"8e36417d4a19ca82de0148fdd160d246233ce38fe4d559e0bee6816cff196e11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:39.540814Z","signature_b64":"s2heERbLO9AB3ib04GsctUVGMRsIRjaegYX3GKFoNbopWFFfjz/tTgpiijgl9IjO+GnleHoKsHM/OOdPDu+HAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ee87951c0d1f7b7f193b804e49e87cf8a62f320e67e562df22f662a48dcfcc1","last_reissued_at":"2026-05-18T02:49:39.540491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:39.540491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Freeze-Thaw Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jasper Snoek, Kevin Swersky, Ryan Prescott Adams","submitted_at":"2014-06-16T03:43:20Z","abstract_excerpt":"In this paper we develop a dynamic form of Bayesian optimization for machine learning models with the goal of rapidly finding good hyperparameter settings. Our method uses the partial information gained during the training of a machine learning model in order to decide whether to pause training and start a new model, or resume the training of a previously-considered model. We specifically tailor our method to machine learning problems by developing a novel positive-definite covariance kernel to capture a variety of training curves. Furthermore, we develop a Gaussian process prior that scales g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3896","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":"1406.3896","created_at":"2026-05-18T02:49:39.540540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3896v1","created_at":"2026-05-18T02:49:39.540540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3896","created_at":"2026-05-18T02:49:39.540540+00:00"},{"alias_kind":"pith_short_12","alias_value":"L3UHSUOA2H33","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"L3UHSUOA2H33P4MT","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"L3UHSUOA","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.00678","citing_title":"Two-stage Optimization for Machine Learning Workflow","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2402.13228","citing_title":"Smaug: Fixing Failure Modes of Preference Optimisation with DPO-Positive","ref_index":299,"is_internal_anchor":true},{"citing_arxiv_id":"1807.02811","citing_title":"A Tutorial on Bayesian Optimization","ref_index":89,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20938","citing_title":"HARBOR: Automated Harness Optimization","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08891","citing_title":"Adaptive Candidate Point Thompson Sampling for High-Dimensional Bayesian Optimization","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07572","citing_title":"Open-Ended Task Discovery via Bayesian Optimization","ref_index":65,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L3UHSUOA2H33P4MTXACOJHUHZ6","json":"https://pith.science/pith/L3UHSUOA2H33P4MTXACOJHUHZ6.json","graph_json":"https://pith.science/api/pith-number/L3UHSUOA2H33P4MTXACOJHUHZ6/graph.json","events_json":"https://pith.science/api/pith-number/L3UHSUOA2H33P4MTXACOJHUHZ6/events.json","paper":"https://pith.science/paper/L3UHSUOA"},"agent_actions":{"view_html":"https://pith.science/pith/L3UHSUOA2H33P4MTXACOJHUHZ6","download_json":"https://pith.science/pith/L3UHSUOA2H33P4MTXACOJHUHZ6.json","view_paper":"https://pith.science/paper/L3UHSUOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3896&json=true","fetch_graph":"https://pith.science/api/pith-number/L3UHSUOA2H33P4MTXACOJHUHZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/L3UHSUOA2H33P4MTXACOJHUHZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L3UHSUOA2H33P4MTXACOJHUHZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L3UHSUOA2H33P4MTXACOJHUHZ6/action/storage_attestation","attest_author":"https://pith.science/pith/L3UHSUOA2H33P4MTXACOJHUHZ6/action/author_attestation","sign_citation":"https://pith.science/pith/L3UHSUOA2H33P4MTXACOJHUHZ6/action/citation_signature","submit_replication":"https://pith.science/pith/L3UHSUOA2H33P4MTXACOJHUHZ6/action/replication_record"}},"created_at":"2026-05-18T02:49:39.540540+00:00","updated_at":"2026-05-18T02:49:39.540540+00:00"}