{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:INKQSBBMSOQOMKTNWUD6B23QPQ","short_pith_number":"pith:INKQSBBM","schema_version":"1.0","canonical_sha256":"435509042c93a0e62a6db507e0eb707c0b54b07ad5b0d88d7b90de9bb134b0bd","source":{"kind":"arxiv","id":"1506.03271","version":3},"attestation_state":"computed","paper":{"title":"Explore no more: Improved high-probability regret bounds for non-stochastic bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gergely Neu","submitted_at":"2015-06-10T12:19:21Z","abstract_excerpt":"This work addresses the problem of regret minimization in non-stochastic multi-armed bandit problems, focusing on performance guarantees that hold with high probability. Such results are rather scarce in the literature since proving them requires a large deal of technical effort and significant modifications to the standard, more intuitive algorithms that come only with guarantees that hold on expectation. One of these modifications is forcing the learner to sample arms from the uniform distribution at least $\\Omega(\\sqrt{T})$ times over $T$ rounds, which can adversely affect performance if ma"},"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":"1506.03271","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-10T12:19:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"eb7e7918805858081f9408b62273906258908e89ce87d4b197dd0757844c05bd","abstract_canon_sha256":"54b9dc4b586f5366c99a84562ec68f6a27d0302a2d5ee410095ccc59217e828d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:04.658741Z","signature_b64":"8udS+58vc1/OrEq5hwcbgjEZ8fqibBqTx/xoNMLAqzgfYkz28fpmXTifBIByQSS0SBCBz5/7MbpA3eM48mlMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"435509042c93a0e62a6db507e0eb707c0b54b07ad5b0d88d7b90de9bb134b0bd","last_reissued_at":"2026-05-18T01:28:04.658036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:04.658036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explore no more: Improved high-probability regret bounds for non-stochastic bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gergely Neu","submitted_at":"2015-06-10T12:19:21Z","abstract_excerpt":"This work addresses the problem of regret minimization in non-stochastic multi-armed bandit problems, focusing on performance guarantees that hold with high probability. Such results are rather scarce in the literature since proving them requires a large deal of technical effort and significant modifications to the standard, more intuitive algorithms that come only with guarantees that hold on expectation. One of these modifications is forcing the learner to sample arms from the uniform distribution at least $\\Omega(\\sqrt{T})$ times over $T$ rounds, which can adversely affect performance if ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03271","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":""},"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":"1506.03271","created_at":"2026-05-18T01:28:04.658148+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03271v3","created_at":"2026-05-18T01:28:04.658148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03271","created_at":"2026-05-18T01:28:04.658148+00:00"},{"alias_kind":"pith_short_12","alias_value":"INKQSBBMSOQO","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"INKQSBBMSOQOMKTN","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"INKQSBBM","created_at":"2026-05-18T12:29:25.134429+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/INKQSBBMSOQOMKTNWUD6B23QPQ","json":"https://pith.science/pith/INKQSBBMSOQOMKTNWUD6B23QPQ.json","graph_json":"https://pith.science/api/pith-number/INKQSBBMSOQOMKTNWUD6B23QPQ/graph.json","events_json":"https://pith.science/api/pith-number/INKQSBBMSOQOMKTNWUD6B23QPQ/events.json","paper":"https://pith.science/paper/INKQSBBM"},"agent_actions":{"view_html":"https://pith.science/pith/INKQSBBMSOQOMKTNWUD6B23QPQ","download_json":"https://pith.science/pith/INKQSBBMSOQOMKTNWUD6B23QPQ.json","view_paper":"https://pith.science/paper/INKQSBBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03271&json=true","fetch_graph":"https://pith.science/api/pith-number/INKQSBBMSOQOMKTNWUD6B23QPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/INKQSBBMSOQOMKTNWUD6B23QPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INKQSBBMSOQOMKTNWUD6B23QPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INKQSBBMSOQOMKTNWUD6B23QPQ/action/storage_attestation","attest_author":"https://pith.science/pith/INKQSBBMSOQOMKTNWUD6B23QPQ/action/author_attestation","sign_citation":"https://pith.science/pith/INKQSBBMSOQOMKTNWUD6B23QPQ/action/citation_signature","submit_replication":"https://pith.science/pith/INKQSBBMSOQOMKTNWUD6B23QPQ/action/replication_record"}},"created_at":"2026-05-18T01:28:04.658148+00:00","updated_at":"2026-05-18T01:28:04.658148+00:00"}