{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DT3DPHQ5I6UKVGM3CEUF7KML62","short_pith_number":"pith:DT3DPHQ5","schema_version":"1.0","canonical_sha256":"1cf6379e1d47a8aa999b11285fa98bf6a72a6a063f23ef94cf75ce878f0c1d44","source":{"kind":"arxiv","id":"1910.04522","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Rollouts for Learning Curve Extrapolation Across Hyperparameter Settings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Klein, Frank Hutter, Matilde Gargiani, Stefan Falkner","submitted_at":"2019-10-10T12:49:22Z","abstract_excerpt":"We propose probabilistic models that can extrapolate learning curves of iterative machine learning algorithms, such as stochastic gradient descent for training deep networks, based on training data with variable-length learning curves. We study instantiations of this framework based on random forests and Bayesian recurrent neural networks. Our experiments show that these models yield better predictions than state-of-the-art models from the hyperparameter optimization literature when extrapolating the performance of neural networks trained with different hyperparameter settings."},"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":"1910.04522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-10T12:49:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"fae021240e0e16504ffe966b9ffe01aaa62f04bfc635062394a9eafc0134d193","abstract_canon_sha256":"c2e042dc53c9dd0b3f3298b25b3f18e6ce639d38e80e0c78cad64dfce915f694"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:11:09.127511Z","signature_b64":"8eS32X9G926B2H0lXgQnnmWxIOQAV9pacZnUdR2Sz3TINqV/R+N1KochjarpSlnKcOUAV0t4UaSNdn8VzY4fAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf6379e1d47a8aa999b11285fa98bf6a72a6a063f23ef94cf75ce878f0c1d44","last_reissued_at":"2026-07-05T00:11:09.127095Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:11:09.127095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Rollouts for Learning Curve Extrapolation Across Hyperparameter Settings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Klein, Frank Hutter, Matilde Gargiani, Stefan Falkner","submitted_at":"2019-10-10T12:49:22Z","abstract_excerpt":"We propose probabilistic models that can extrapolate learning curves of iterative machine learning algorithms, such as stochastic gradient descent for training deep networks, based on training data with variable-length learning curves. We study instantiations of this framework based on random forests and Bayesian recurrent neural networks. Our experiments show that these models yield better predictions than state-of-the-art models from the hyperparameter optimization literature when extrapolating the performance of neural networks trained with different hyperparameter settings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.04522","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/1910.04522/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":"1910.04522","created_at":"2026-07-05T00:11:09.127150+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.04522v1","created_at":"2026-07-05T00:11:09.127150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.04522","created_at":"2026-07-05T00:11:09.127150+00:00"},{"alias_kind":"pith_short_12","alias_value":"DT3DPHQ5I6UK","created_at":"2026-07-05T00:11:09.127150+00:00"},{"alias_kind":"pith_short_16","alias_value":"DT3DPHQ5I6UKVGM3","created_at":"2026-07-05T00:11:09.127150+00:00"},{"alias_kind":"pith_short_8","alias_value":"DT3DPHQ5","created_at":"2026-07-05T00:11:09.127150+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2402.13228","citing_title":"Smaug: Fixing Failure Modes of Preference Optimisation with DPO-Positive","ref_index":270,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DT3DPHQ5I6UKVGM3CEUF7KML62","json":"https://pith.science/pith/DT3DPHQ5I6UKVGM3CEUF7KML62.json","graph_json":"https://pith.science/api/pith-number/DT3DPHQ5I6UKVGM3CEUF7KML62/graph.json","events_json":"https://pith.science/api/pith-number/DT3DPHQ5I6UKVGM3CEUF7KML62/events.json","paper":"https://pith.science/paper/DT3DPHQ5"},"agent_actions":{"view_html":"https://pith.science/pith/DT3DPHQ5I6UKVGM3CEUF7KML62","download_json":"https://pith.science/pith/DT3DPHQ5I6UKVGM3CEUF7KML62.json","view_paper":"https://pith.science/paper/DT3DPHQ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.04522&json=true","fetch_graph":"https://pith.science/api/pith-number/DT3DPHQ5I6UKVGM3CEUF7KML62/graph.json","fetch_events":"https://pith.science/api/pith-number/DT3DPHQ5I6UKVGM3CEUF7KML62/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DT3DPHQ5I6UKVGM3CEUF7KML62/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DT3DPHQ5I6UKVGM3CEUF7KML62/action/storage_attestation","attest_author":"https://pith.science/pith/DT3DPHQ5I6UKVGM3CEUF7KML62/action/author_attestation","sign_citation":"https://pith.science/pith/DT3DPHQ5I6UKVGM3CEUF7KML62/action/citation_signature","submit_replication":"https://pith.science/pith/DT3DPHQ5I6UKVGM3CEUF7KML62/action/replication_record"}},"created_at":"2026-07-05T00:11:09.127150+00:00","updated_at":"2026-07-05T00:11:09.127150+00:00"}