{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BBHKOZCJENUZD63Z7MUG4OS52P","short_pith_number":"pith:BBHKOZCJ","schema_version":"1.0","canonical_sha256":"084ea76449236991fb79fb286e3a5dd3eb32e29c28e64917f7d7397c04428c56","source":{"kind":"arxiv","id":"1810.05934","version":5},"attestation_state":"computed","paper":{"title":"A System for Massively Parallel Hyperparameter Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Afshin Rostamizadeh, Ameet Talwalkar, Benjamin Recht, Ekaterina Gonina, Kevin Jamieson, Liam Li, Moritz Hardt","submitted_at":"2018-10-13T22:02:52Z","abstract_excerpt":"Modern learning models are characterized by large hyperparameter spaces and long training times. These properties, coupled with the rise of parallel computing and the growing demand to productionize machine learning workloads, motivate the need to develop mature hyperparameter optimization functionality in distributed computing settings. We address this challenge by first introducing a simple and robust hyperparameter optimization algorithm called ASHA, which exploits parallelism and aggressive early-stopping to tackle large-scale hyperparameter optimization problems. Our extensive empirical r"},"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":"1810.05934","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-13T22:02:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7a7ae1cb8fa2f537e79b69f41d6e7633b4fc2b430a9d071658e755660c92ab93","abstract_canon_sha256":"adbd7c2ce801c2334245fc25357041e691ae16e2f86321f758a8c3b23045a81a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:47:55.423302Z","signature_b64":"hyhrbZX0KjK9W1K8RnF4naut5mkPtB253rMJplJZCiPXxir5Iy3QelUVMX8eTqtcD1O5yNxN0jqIfRxIhz61Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"084ea76449236991fb79fb286e3a5dd3eb32e29c28e64917f7d7397c04428c56","last_reissued_at":"2026-07-05T00:47:55.422740Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:47:55.422740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A System for Massively Parallel Hyperparameter Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Afshin Rostamizadeh, Ameet Talwalkar, Benjamin Recht, Ekaterina Gonina, Kevin Jamieson, Liam Li, Moritz Hardt","submitted_at":"2018-10-13T22:02:52Z","abstract_excerpt":"Modern learning models are characterized by large hyperparameter spaces and long training times. These properties, coupled with the rise of parallel computing and the growing demand to productionize machine learning workloads, motivate the need to develop mature hyperparameter optimization functionality in distributed computing settings. We address this challenge by first introducing a simple and robust hyperparameter optimization algorithm called ASHA, which exploits parallelism and aggressive early-stopping to tackle large-scale hyperparameter optimization problems. Our extensive empirical r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05934","kind":"arxiv","version":5},"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/1810.05934/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":"1810.05934","created_at":"2026-07-05T00:47:55.422816+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05934v5","created_at":"2026-07-05T00:47:55.422816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05934","created_at":"2026-07-05T00:47:55.422816+00:00"},{"alias_kind":"pith_short_12","alias_value":"BBHKOZCJENUZ","created_at":"2026-07-05T00:47:55.422816+00:00"},{"alias_kind":"pith_short_16","alias_value":"BBHKOZCJENUZD63Z","created_at":"2026-07-05T00:47:55.422816+00:00"},{"alias_kind":"pith_short_8","alias_value":"BBHKOZCJ","created_at":"2026-07-05T00:47:55.422816+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05186","citing_title":"Staged Factorial Screening for Budget-Constrained Micro-Pretraining","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29698","citing_title":"A Systematic Evaluation of Molecular Mixture Behavior Prediction","ref_index":68,"is_internal_anchor":false},{"citing_arxiv_id":"1910.09700","citing_title":"Quantifying the Carbon Emissions of Machine Learning","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12503","citing_title":"Unveiling Hidden Lyman Alpha Emitters in the DESI DR1 Data","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17842","citing_title":"QuickScope: Certifying Hard Questions in Dynamic LLM Benchmarks","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BBHKOZCJENUZD63Z7MUG4OS52P","json":"https://pith.science/pith/BBHKOZCJENUZD63Z7MUG4OS52P.json","graph_json":"https://pith.science/api/pith-number/BBHKOZCJENUZD63Z7MUG4OS52P/graph.json","events_json":"https://pith.science/api/pith-number/BBHKOZCJENUZD63Z7MUG4OS52P/events.json","paper":"https://pith.science/paper/BBHKOZCJ"},"agent_actions":{"view_html":"https://pith.science/pith/BBHKOZCJENUZD63Z7MUG4OS52P","download_json":"https://pith.science/pith/BBHKOZCJENUZD63Z7MUG4OS52P.json","view_paper":"https://pith.science/paper/BBHKOZCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05934&json=true","fetch_graph":"https://pith.science/api/pith-number/BBHKOZCJENUZD63Z7MUG4OS52P/graph.json","fetch_events":"https://pith.science/api/pith-number/BBHKOZCJENUZD63Z7MUG4OS52P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BBHKOZCJENUZD63Z7MUG4OS52P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BBHKOZCJENUZD63Z7MUG4OS52P/action/storage_attestation","attest_author":"https://pith.science/pith/BBHKOZCJENUZD63Z7MUG4OS52P/action/author_attestation","sign_citation":"https://pith.science/pith/BBHKOZCJENUZD63Z7MUG4OS52P/action/citation_signature","submit_replication":"https://pith.science/pith/BBHKOZCJENUZD63Z7MUG4OS52P/action/replication_record"}},"created_at":"2026-07-05T00:47:55.422816+00:00","updated_at":"2026-07-05T00:47:55.422816+00:00"}