{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3EDQZTFHDSQKKSCVXFQZYPVRXS","short_pith_number":"pith:3EDQZTFH","schema_version":"1.0","canonical_sha256":"d9070ccca71ca0a54855b9619c3eb1bc826c90aee375d0905eb4b040c94d668a","source":{"kind":"arxiv","id":"1706.00764","version":4},"attestation_state":"computed","paper":{"title":"Hyperparameter Optimization: A Spectral Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Adam Klivans, Elad Hazan, Yang Yuan","submitted_at":"2017-06-02T17:25:58Z","abstract_excerpt":"We give a simple, fast algorithm for hyperparameter optimization inspired by techniques from the analysis of Boolean functions. We focus on the high-dimensional regime where the canonical example is training a neural network with a large number of hyperparameters. The algorithm --- an iterative application of compressed sensing techniques for orthogonal polynomials --- requires only uniform sampling of the hyperparameters and is thus easily parallelizable.\n  Experiments for training deep neural networks on Cifar-10 show that compared to state-of-the-art tools (e.g., Hyperband and Spearmint), o"},"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":"1706.00764","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-02T17:25:58Z","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"title_canon_sha256":"41205ab309317a513aeb58a520337980f663745fa8ddd52f8c3c6de6c4449eac","abstract_canon_sha256":"8f2cfebf3290a4dcbba90aa188e010bb6689d3db23c121e4bb3beba7cbf9743a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:29.035928Z","signature_b64":"MEu+xplqa/mx+GdwpPw5uOQoLJoDb3rbs7xRtnNDxTGNxM3ADTTcb0ZfZ/00tluhGRw+EYRW59/SWfpx7H1BAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9070ccca71ca0a54855b9619c3eb1bc826c90aee375d0905eb4b040c94d668a","last_reissued_at":"2026-05-18T00:25:29.035162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:29.035162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hyperparameter Optimization: A Spectral Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Adam Klivans, Elad Hazan, Yang Yuan","submitted_at":"2017-06-02T17:25:58Z","abstract_excerpt":"We give a simple, fast algorithm for hyperparameter optimization inspired by techniques from the analysis of Boolean functions. We focus on the high-dimensional regime where the canonical example is training a neural network with a large number of hyperparameters. The algorithm --- an iterative application of compressed sensing techniques for orthogonal polynomials --- requires only uniform sampling of the hyperparameters and is thus easily parallelizable.\n  Experiments for training deep neural networks on Cifar-10 show that compared to state-of-the-art tools (e.g., Hyperband and Spearmint), o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00764","kind":"arxiv","version":4},"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":"1706.00764","created_at":"2026-05-18T00:25:29.035287+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.00764v4","created_at":"2026-05-18T00:25:29.035287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00764","created_at":"2026-05-18T00:25:29.035287+00:00"},{"alias_kind":"pith_short_12","alias_value":"3EDQZTFHDSQK","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3EDQZTFHDSQKKSCV","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3EDQZTFH","created_at":"2026-05-18T12:30:58.224056+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/3EDQZTFHDSQKKSCVXFQZYPVRXS","json":"https://pith.science/pith/3EDQZTFHDSQKKSCVXFQZYPVRXS.json","graph_json":"https://pith.science/api/pith-number/3EDQZTFHDSQKKSCVXFQZYPVRXS/graph.json","events_json":"https://pith.science/api/pith-number/3EDQZTFHDSQKKSCVXFQZYPVRXS/events.json","paper":"https://pith.science/paper/3EDQZTFH"},"agent_actions":{"view_html":"https://pith.science/pith/3EDQZTFHDSQKKSCVXFQZYPVRXS","download_json":"https://pith.science/pith/3EDQZTFHDSQKKSCVXFQZYPVRXS.json","view_paper":"https://pith.science/paper/3EDQZTFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.00764&json=true","fetch_graph":"https://pith.science/api/pith-number/3EDQZTFHDSQKKSCVXFQZYPVRXS/graph.json","fetch_events":"https://pith.science/api/pith-number/3EDQZTFHDSQKKSCVXFQZYPVRXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3EDQZTFHDSQKKSCVXFQZYPVRXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3EDQZTFHDSQKKSCVXFQZYPVRXS/action/storage_attestation","attest_author":"https://pith.science/pith/3EDQZTFHDSQKKSCVXFQZYPVRXS/action/author_attestation","sign_citation":"https://pith.science/pith/3EDQZTFHDSQKKSCVXFQZYPVRXS/action/citation_signature","submit_replication":"https://pith.science/pith/3EDQZTFHDSQKKSCVXFQZYPVRXS/action/replication_record"}},"created_at":"2026-05-18T00:25:29.035287+00:00","updated_at":"2026-05-18T00:25:29.035287+00:00"}