{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MUGZWCZ6XA3ZZVFKNZYCODSM3L","short_pith_number":"pith:MUGZWCZ6","schema_version":"1.0","canonical_sha256":"650d9b0b3eb8379cd4aa6e70270e4cdacb5071e22edca4a36d1c88cda971a1fe","source":{"kind":"arxiv","id":"2206.06847","version":3},"attestation_state":"computed","paper":{"title":"On the Finite-Time Performance of the Knowledge Gradient Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Siyang Gao, Yanwen Li","submitted_at":"2022-06-14T13:42:05Z","abstract_excerpt":"The knowledge gradient (KG) algorithm is a popular and effective algorithm for the best arm identification (BAI) problem. Due to the complex calculation of KG, theoretical analysis of this algorithm is difficult, and existing results are mostly about the asymptotic performance of it, e.g., consistency, asymptotic sample allocation, etc. In this research, we present new theoretical results about the finite-time performance of the KG algorithm. Under independent and normally distributed rewards, we derive bounds for the sample allocation of the algorithm. With these bounds, existing asymptotic r"},"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":"2206.06847","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-06-14T13:42:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"438c03020598364f07c9f0cf303d72e311c7b1d95108cac2d285d41056a05cc9","abstract_canon_sha256":"0c8c025e6a7d4152a381e8b1f8b79d0f1db583b33b0023f2fc706fc4962d1bf0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:18:04.437063Z","signature_b64":"X+aTha7QbdTSDrER1akRNSLPrWU6Oh9Lw6KEZ0kJVqmqfqjMAlUDN2ywRJDf5ZGQzB/wGokfyjQCH0LWx4D2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"650d9b0b3eb8379cd4aa6e70270e4cdacb5071e22edca4a36d1c88cda971a1fe","last_reissued_at":"2026-07-05T05:18:04.436650Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:18:04.436650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Finite-Time Performance of the Knowledge Gradient Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Siyang Gao, Yanwen Li","submitted_at":"2022-06-14T13:42:05Z","abstract_excerpt":"The knowledge gradient (KG) algorithm is a popular and effective algorithm for the best arm identification (BAI) problem. Due to the complex calculation of KG, theoretical analysis of this algorithm is difficult, and existing results are mostly about the asymptotic performance of it, e.g., consistency, asymptotic sample allocation, etc. In this research, we present new theoretical results about the finite-time performance of the KG algorithm. Under independent and normally distributed rewards, we derive bounds for the sample allocation of the algorithm. With these bounds, existing asymptotic r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.06847","kind":"arxiv","version":3},"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/2206.06847/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":"2206.06847","created_at":"2026-07-05T05:18:04.436706+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.06847v3","created_at":"2026-07-05T05:18:04.436706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.06847","created_at":"2026-07-05T05:18:04.436706+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUGZWCZ6XA3Z","created_at":"2026-07-05T05:18:04.436706+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUGZWCZ6XA3ZZVFK","created_at":"2026-07-05T05:18:04.436706+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUGZWCZ6","created_at":"2026-07-05T05:18:04.436706+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/MUGZWCZ6XA3ZZVFKNZYCODSM3L","json":"https://pith.science/pith/MUGZWCZ6XA3ZZVFKNZYCODSM3L.json","graph_json":"https://pith.science/api/pith-number/MUGZWCZ6XA3ZZVFKNZYCODSM3L/graph.json","events_json":"https://pith.science/api/pith-number/MUGZWCZ6XA3ZZVFKNZYCODSM3L/events.json","paper":"https://pith.science/paper/MUGZWCZ6"},"agent_actions":{"view_html":"https://pith.science/pith/MUGZWCZ6XA3ZZVFKNZYCODSM3L","download_json":"https://pith.science/pith/MUGZWCZ6XA3ZZVFKNZYCODSM3L.json","view_paper":"https://pith.science/paper/MUGZWCZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.06847&json=true","fetch_graph":"https://pith.science/api/pith-number/MUGZWCZ6XA3ZZVFKNZYCODSM3L/graph.json","fetch_events":"https://pith.science/api/pith-number/MUGZWCZ6XA3ZZVFKNZYCODSM3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUGZWCZ6XA3ZZVFKNZYCODSM3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUGZWCZ6XA3ZZVFKNZYCODSM3L/action/storage_attestation","attest_author":"https://pith.science/pith/MUGZWCZ6XA3ZZVFKNZYCODSM3L/action/author_attestation","sign_citation":"https://pith.science/pith/MUGZWCZ6XA3ZZVFKNZYCODSM3L/action/citation_signature","submit_replication":"https://pith.science/pith/MUGZWCZ6XA3ZZVFKNZYCODSM3L/action/replication_record"}},"created_at":"2026-07-05T05:18:04.436706+00:00","updated_at":"2026-07-05T05:18:04.436706+00:00"}