{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3K35PKG42MRHAEJEOUOLNBO4DN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ae93704de1fec4e72a57865c31011a01416f2f64b67c14894eccda282917c1af","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-07-11T03:15:21Z","title_canon_sha256":"a017cc9482d47248a5c20833d2315de782d14a98dc9fef61f495dc6635089841"},"schema_version":"1.0","source":{"id":"2007.05670","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.05670","created_at":"2026-07-05T01:59:56Z"},{"alias_kind":"arxiv_version","alias_value":"2007.05670v2","created_at":"2026-07-05T01:59:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.05670","created_at":"2026-07-05T01:59:56Z"},{"alias_kind":"pith_short_12","alias_value":"3K35PKG42MRH","created_at":"2026-07-05T01:59:56Z"},{"alias_kind":"pith_short_16","alias_value":"3K35PKG42MRHAEJE","created_at":"2026-07-05T01:59:56Z"},{"alias_kind":"pith_short_8","alias_value":"3K35PKG4","created_at":"2026-07-05T01:59:56Z"}],"graph_snapshots":[{"event_id":"sha256:42dbf5ec6bdd9e4df5f47e7b8c560e541a194471117b1f6c0a0046be6dcf9c73","target":"graph","created_at":"2026-07-05T01:59:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.05670/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The evaluation of hyperparameters, neural architectures, or data augmentation policies becomes a critical model selection problem in advanced deep learning with a large hyperparameter search space. In this paper, we propose an efficient and robust bandit-based algorithm called Sub-Sampling (SS) in the scenario of hyperparameter search evaluation. It evaluates the potential of hyperparameters by the sub-samples of observations and is theoretically proved to be optimal under the criterion of cumulative regret. We further combine SS with Bayesian Optimization and develop a novel hyperparameter op","authors_text":"Hanrong Ye, Yimin Huang, Yujun Li, Zhenguo Li, Zhihua Zhang","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-07-11T03:15:21Z","title":"An Asymptotically Optimal Multi-Armed Bandit Algorithm and Hyperparameter Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.05670","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2601efde7b2a2a34b282094629c7e840ca6ee58cacd7a229190e201c1d7d9af4","target":"record","created_at":"2026-07-05T01:59:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ae93704de1fec4e72a57865c31011a01416f2f64b67c14894eccda282917c1af","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-07-11T03:15:21Z","title_canon_sha256":"a017cc9482d47248a5c20833d2315de782d14a98dc9fef61f495dc6635089841"},"schema_version":"1.0","source":{"id":"2007.05670","kind":"arxiv","version":2}},"canonical_sha256":"dab7d7a8dcd322701124751cb685dc1b4bc1e57598af2cd640517c7072d82c20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dab7d7a8dcd322701124751cb685dc1b4bc1e57598af2cd640517c7072d82c20","first_computed_at":"2026-07-05T01:59:56.614127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:59:56.614127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KHNXi/E1/iEnZUCAsJIoijJQXLJ/nrzW4XyA5EeKtt75RpKp6YMuHb15OQQpFyosrxkoMQnuaDtBN4RRN6eaCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:59:56.614580Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.05670","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2601efde7b2a2a34b282094629c7e840ca6ee58cacd7a229190e201c1d7d9af4","sha256:42dbf5ec6bdd9e4df5f47e7b8c560e541a194471117b1f6c0a0046be6dcf9c73"],"state_sha256":"62231cca9e6267ee82775f8347f1482011b7744d363b83ac43ff5165d1cfb276"}