{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XGPCXG2N2O73KVHKG6ZKE254MA","short_pith_number":"pith:XGPCXG2N","schema_version":"1.0","canonical_sha256":"b99e2b9b4dd3bfb554ea37b2a26bbc60122426bba3870d8a943cc9cd12b213fa","source":{"kind":"arxiv","id":"1906.10431","version":1},"attestation_state":"computed","paper":{"title":"Non-Asymptotic Pure Exploration by Solving Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Pierre M\\'enard, R\\'emy Degenne, Wouter M. Koolen","submitted_at":"2019-06-25T10:09:07Z","abstract_excerpt":"Pure exploration (aka active testing) is the fundamental task of sequentially gathering information to answer a query about a stochastic environment. Good algorithms make few mistakes and take few samples. Lower bounds (for multi-armed bandit models with arms in an exponential family) reveal that the sample complexity is determined by the solution to an optimisation problem. The existing state of the art algorithms achieve asymptotic optimality by solving a plug-in estimate of that optimisation problem at each step. We interpret the optimisation problem as an unknown game, and propose sampling"},"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":"1906.10431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-25T10:09:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"093d5a36e0313479c2e1d48a15f94416fe56fe8080f6f1cdf5fd24fa0c596c0b","abstract_canon_sha256":"8c15414ecbf5a872548472fb0824cea36994a1705676c3f612550ecf005961c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:16.375614Z","signature_b64":"4EerWKbAysm01M4HIoy/XSZl9I4Kq2iKaZ641C1PV+KWZS+jk/B8PY6AH0UkYlyuAQ4LYr2sJLNizOk9uxLbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b99e2b9b4dd3bfb554ea37b2a26bbc60122426bba3870d8a943cc9cd12b213fa","last_reissued_at":"2026-05-17T23:42:16.375151Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:16.375151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Asymptotic Pure Exploration by Solving Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Pierre M\\'enard, R\\'emy Degenne, Wouter M. Koolen","submitted_at":"2019-06-25T10:09:07Z","abstract_excerpt":"Pure exploration (aka active testing) is the fundamental task of sequentially gathering information to answer a query about a stochastic environment. Good algorithms make few mistakes and take few samples. Lower bounds (for multi-armed bandit models with arms in an exponential family) reveal that the sample complexity is determined by the solution to an optimisation problem. The existing state of the art algorithms achieve asymptotic optimality by solving a plug-in estimate of that optimisation problem at each step. We interpret the optimisation problem as an unknown game, and propose sampling"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10431","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":"1906.10431","created_at":"2026-05-17T23:42:16.375225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10431v1","created_at":"2026-05-17T23:42:16.375225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10431","created_at":"2026-05-17T23:42:16.375225+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGPCXG2N2O73","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGPCXG2N2O73KVHK","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGPCXG2N","created_at":"2026-05-18T12:33:33.725879+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/XGPCXG2N2O73KVHKG6ZKE254MA","json":"https://pith.science/pith/XGPCXG2N2O73KVHKG6ZKE254MA.json","graph_json":"https://pith.science/api/pith-number/XGPCXG2N2O73KVHKG6ZKE254MA/graph.json","events_json":"https://pith.science/api/pith-number/XGPCXG2N2O73KVHKG6ZKE254MA/events.json","paper":"https://pith.science/paper/XGPCXG2N"},"agent_actions":{"view_html":"https://pith.science/pith/XGPCXG2N2O73KVHKG6ZKE254MA","download_json":"https://pith.science/pith/XGPCXG2N2O73KVHKG6ZKE254MA.json","view_paper":"https://pith.science/paper/XGPCXG2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10431&json=true","fetch_graph":"https://pith.science/api/pith-number/XGPCXG2N2O73KVHKG6ZKE254MA/graph.json","fetch_events":"https://pith.science/api/pith-number/XGPCXG2N2O73KVHKG6ZKE254MA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGPCXG2N2O73KVHKG6ZKE254MA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGPCXG2N2O73KVHKG6ZKE254MA/action/storage_attestation","attest_author":"https://pith.science/pith/XGPCXG2N2O73KVHKG6ZKE254MA/action/author_attestation","sign_citation":"https://pith.science/pith/XGPCXG2N2O73KVHKG6ZKE254MA/action/citation_signature","submit_replication":"https://pith.science/pith/XGPCXG2N2O73KVHKG6ZKE254MA/action/replication_record"}},"created_at":"2026-05-17T23:42:16.375225+00:00","updated_at":"2026-05-17T23:42:16.375225+00:00"}