{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2Q32YCYGFJAJC2E74CPI7TISE3","short_pith_number":"pith:2Q32YCYG","schema_version":"1.0","canonical_sha256":"d437ac0b062a4091689fe09e8fcd1226c51162f9356689956bf7e91436bfdb79","source":{"kind":"arxiv","id":"2004.01628","version":1},"attestation_state":"computed","paper":{"title":"Weighted Random Search for Hyperparameter Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Adrian-Catalin Florea, Razvan Andonie","submitted_at":"2020-04-03T15:41:22Z","abstract_excerpt":"We introduce an improved version of Random Search (RS), used here for hyperparameter optimization of machine learning algorithms. Unlike the standard RS, which generates for each trial new values for all hyperparameters, we generate new values for each hyperparameter with a probability of change. The intuition behind our approach is that a value that already triggered a good result is a good candidate for the next step, and should be tested in new combinations of hyperparameter values. Within the same computational budget, our method yields better results than the standard RS. Our theoretical "},"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":"2004.01628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-04-03T15:41:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3c8c8c588383be4bc6c2f129cace3f30fa469ebd348d1bf51680150f64451c86","abstract_canon_sha256":"064cdc0ee4e5045d5c664547c63b20a51fa32fc4601e8895b497545ee7c348da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:52:34.586137Z","signature_b64":"1HE71WKsac06H+8vLDfvRBoOuXddPnxXQH+mc3oHrSmGtsnsENQ22JcvRvsmyFT5+6Uoa27KFZ8QKXxZnp7tBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d437ac0b062a4091689fe09e8fcd1226c51162f9356689956bf7e91436bfdb79","last_reissued_at":"2026-07-05T00:52:34.585712Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:52:34.585712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted Random Search for Hyperparameter Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Adrian-Catalin Florea, Razvan Andonie","submitted_at":"2020-04-03T15:41:22Z","abstract_excerpt":"We introduce an improved version of Random Search (RS), used here for hyperparameter optimization of machine learning algorithms. Unlike the standard RS, which generates for each trial new values for all hyperparameters, we generate new values for each hyperparameter with a probability of change. The intuition behind our approach is that a value that already triggered a good result is a good candidate for the next step, and should be tested in new combinations of hyperparameter values. Within the same computational budget, our method yields better results than the standard RS. Our theoretical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.01628","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/2004.01628/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":"2004.01628","created_at":"2026-07-05T00:52:34.585769+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.01628v1","created_at":"2026-07-05T00:52:34.585769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.01628","created_at":"2026-07-05T00:52:34.585769+00:00"},{"alias_kind":"pith_short_12","alias_value":"2Q32YCYGFJAJ","created_at":"2026-07-05T00:52:34.585769+00:00"},{"alias_kind":"pith_short_16","alias_value":"2Q32YCYGFJAJC2E7","created_at":"2026-07-05T00:52:34.585769+00:00"},{"alias_kind":"pith_short_8","alias_value":"2Q32YCYG","created_at":"2026-07-05T00:52:34.585769+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.02905","citing_title":"Preference-Optimal Multi-Metric Weighting for Parallel Coordinate Plots","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2Q32YCYGFJAJC2E74CPI7TISE3","json":"https://pith.science/pith/2Q32YCYGFJAJC2E74CPI7TISE3.json","graph_json":"https://pith.science/api/pith-number/2Q32YCYGFJAJC2E74CPI7TISE3/graph.json","events_json":"https://pith.science/api/pith-number/2Q32YCYGFJAJC2E74CPI7TISE3/events.json","paper":"https://pith.science/paper/2Q32YCYG"},"agent_actions":{"view_html":"https://pith.science/pith/2Q32YCYGFJAJC2E74CPI7TISE3","download_json":"https://pith.science/pith/2Q32YCYGFJAJC2E74CPI7TISE3.json","view_paper":"https://pith.science/paper/2Q32YCYG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.01628&json=true","fetch_graph":"https://pith.science/api/pith-number/2Q32YCYGFJAJC2E74CPI7TISE3/graph.json","fetch_events":"https://pith.science/api/pith-number/2Q32YCYGFJAJC2E74CPI7TISE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2Q32YCYGFJAJC2E74CPI7TISE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2Q32YCYGFJAJC2E74CPI7TISE3/action/storage_attestation","attest_author":"https://pith.science/pith/2Q32YCYGFJAJC2E74CPI7TISE3/action/author_attestation","sign_citation":"https://pith.science/pith/2Q32YCYGFJAJC2E74CPI7TISE3/action/citation_signature","submit_replication":"https://pith.science/pith/2Q32YCYGFJAJC2E74CPI7TISE3/action/replication_record"}},"created_at":"2026-07-05T00:52:34.585769+00:00","updated_at":"2026-07-05T00:52:34.585769+00:00"}