{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LECQJMCIRYO5E7LUQCER6V2MLW","short_pith_number":"pith:LECQJMCI","schema_version":"1.0","canonical_sha256":"590504b0488e1dd27d7480891f574c5d88791fd34ced0d5f94f5ec3234bce6c7","source":{"kind":"arxiv","id":"1502.07943","version":1},"attestation_state":"computed","paper":{"title":"Non-stochastic Best Arm Identification and Hyperparameter Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ameet Talwalkar, Kevin Jamieson","submitted_at":"2015-02-27T15:58:45Z","abstract_excerpt":"Motivated by the task of hyperparameter optimization, we introduce the non-stochastic best-arm identification problem. Within the multi-armed bandit literature, the cumulative regret objective enjoys algorithms and analyses for both the non-stochastic and stochastic settings while to the best of our knowledge, the best-arm identification framework has only been considered in the stochastic setting. We introduce the non-stochastic setting under this framework, identify a known algorithm that is well-suited for this setting, and analyze its behavior. Next, by leveraging the iterative nature of s"},"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":"1502.07943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-27T15:58:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5ddfd20a12378e9ef1bc571f5f9d6a7e8aad1f50ab2a3f946d03997de43430ee","abstract_canon_sha256":"2eda1c8ccc57cc1fc4301565e5d0f705087a6266c2aca9447ed469dda81d3d00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:01.769880Z","signature_b64":"An0mcxGDv8htmIivZRSl9VKQRWnKFmr4y7g5+zY7yFLwAGM+wtcn+z/K+nfQ+N4nMqe+d3x309YrruaHDArJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"590504b0488e1dd27d7480891f574c5d88791fd34ced0d5f94f5ec3234bce6c7","last_reissued_at":"2026-05-18T02:26:01.769396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:01.769396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-stochastic Best Arm Identification and Hyperparameter Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ameet Talwalkar, Kevin Jamieson","submitted_at":"2015-02-27T15:58:45Z","abstract_excerpt":"Motivated by the task of hyperparameter optimization, we introduce the non-stochastic best-arm identification problem. Within the multi-armed bandit literature, the cumulative regret objective enjoys algorithms and analyses for both the non-stochastic and stochastic settings while to the best of our knowledge, the best-arm identification framework has only been considered in the stochastic setting. We introduce the non-stochastic setting under this framework, identify a known algorithm that is well-suited for this setting, and analyze its behavior. Next, by leveraging the iterative nature of s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07943","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":""},"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":"1502.07943","created_at":"2026-05-18T02:26:01.769469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.07943v1","created_at":"2026-05-18T02:26:01.769469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07943","created_at":"2026-05-18T02:26:01.769469+00:00"},{"alias_kind":"pith_short_12","alias_value":"LECQJMCIRYO5","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LECQJMCIRYO5E7LU","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LECQJMCI","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16615","citing_title":"Learning What Evaluators Value: A Reliable Approach to Modeling Evaluator Preferences","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LECQJMCIRYO5E7LUQCER6V2MLW","json":"https://pith.science/pith/LECQJMCIRYO5E7LUQCER6V2MLW.json","graph_json":"https://pith.science/api/pith-number/LECQJMCIRYO5E7LUQCER6V2MLW/graph.json","events_json":"https://pith.science/api/pith-number/LECQJMCIRYO5E7LUQCER6V2MLW/events.json","paper":"https://pith.science/paper/LECQJMCI"},"agent_actions":{"view_html":"https://pith.science/pith/LECQJMCIRYO5E7LUQCER6V2MLW","download_json":"https://pith.science/pith/LECQJMCIRYO5E7LUQCER6V2MLW.json","view_paper":"https://pith.science/paper/LECQJMCI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.07943&json=true","fetch_graph":"https://pith.science/api/pith-number/LECQJMCIRYO5E7LUQCER6V2MLW/graph.json","fetch_events":"https://pith.science/api/pith-number/LECQJMCIRYO5E7LUQCER6V2MLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LECQJMCIRYO5E7LUQCER6V2MLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LECQJMCIRYO5E7LUQCER6V2MLW/action/storage_attestation","attest_author":"https://pith.science/pith/LECQJMCIRYO5E7LUQCER6V2MLW/action/author_attestation","sign_citation":"https://pith.science/pith/LECQJMCIRYO5E7LUQCER6V2MLW/action/citation_signature","submit_replication":"https://pith.science/pith/LECQJMCIRYO5E7LUQCER6V2MLW/action/replication_record"}},"created_at":"2026-05-18T02:26:01.769469+00:00","updated_at":"2026-05-18T02:26:01.769469+00:00"}