{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KPM7ESDGUMXAKBNOLE5STVGOFY","short_pith_number":"pith:KPM7ESDG","schema_version":"1.0","canonical_sha256":"53d9f24866a32e0505ae593b29d4ce2e2eb2ce9f0f324a12f8bff9f003fb3378","source":{"kind":"arxiv","id":"1801.03265","version":3},"attestation_state":"computed","paper":{"title":"More Adaptive Algorithms for Adversarial Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chen-Yu Wei, Haipeng Luo","submitted_at":"2018-01-10T08:28:00Z","abstract_excerpt":"We develop a novel and generic algorithm for the adversarial multi-armed bandit problem (or more generally the combinatorial semi-bandit problem). When instantiated differently, our algorithm achieves various new data-dependent regret bounds improving previous work. Examples include: 1) a regret bound depending on the variance of only the best arm; 2) a regret bound depending on the first-order path-length of only the best arm; 3) a regret bound depending on the sum of first-order path-lengths of all arms as well as an important negative term, which together lead to faster convergence rates fo"},"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":"1801.03265","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-10T08:28:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a2c58ae463567e882f70bab137a07ba1ff8ed6a2b77479cc454efd06b7a76fcd","abstract_canon_sha256":"7fcd06e8e78a2ab25e202a6cc99f78b80726e48f97afaa99f3516715aee14728"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:00.466771Z","signature_b64":"MoVM3Ot3vUODtq+1Dq+CMvxuW4GswpydhM0FsrDTzbhpcoZSEFp4h12HXbAVcTdz4kQbRGtLYxJ1xUc4gUlFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53d9f24866a32e0505ae593b29d4ce2e2eb2ce9f0f324a12f8bff9f003fb3378","last_reissued_at":"2026-05-18T00:14:00.466086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:00.466086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"More Adaptive Algorithms for Adversarial Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chen-Yu Wei, Haipeng Luo","submitted_at":"2018-01-10T08:28:00Z","abstract_excerpt":"We develop a novel and generic algorithm for the adversarial multi-armed bandit problem (or more generally the combinatorial semi-bandit problem). When instantiated differently, our algorithm achieves various new data-dependent regret bounds improving previous work. Examples include: 1) a regret bound depending on the variance of only the best arm; 2) a regret bound depending on the first-order path-length of only the best arm; 3) a regret bound depending on the sum of first-order path-lengths of all arms as well as an important negative term, which together lead to faster convergence rates fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03265","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":"1801.03265","created_at":"2026-05-18T00:14:00.466187+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03265v3","created_at":"2026-05-18T00:14:00.466187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03265","created_at":"2026-05-18T00:14:00.466187+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPM7ESDGUMXA","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPM7ESDGUMXAKBNO","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPM7ESDG","created_at":"2026-05-18T12:32:33.847187+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/KPM7ESDGUMXAKBNOLE5STVGOFY","json":"https://pith.science/pith/KPM7ESDGUMXAKBNOLE5STVGOFY.json","graph_json":"https://pith.science/api/pith-number/KPM7ESDGUMXAKBNOLE5STVGOFY/graph.json","events_json":"https://pith.science/api/pith-number/KPM7ESDGUMXAKBNOLE5STVGOFY/events.json","paper":"https://pith.science/paper/KPM7ESDG"},"agent_actions":{"view_html":"https://pith.science/pith/KPM7ESDGUMXAKBNOLE5STVGOFY","download_json":"https://pith.science/pith/KPM7ESDGUMXAKBNOLE5STVGOFY.json","view_paper":"https://pith.science/paper/KPM7ESDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03265&json=true","fetch_graph":"https://pith.science/api/pith-number/KPM7ESDGUMXAKBNOLE5STVGOFY/graph.json","fetch_events":"https://pith.science/api/pith-number/KPM7ESDGUMXAKBNOLE5STVGOFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPM7ESDGUMXAKBNOLE5STVGOFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPM7ESDGUMXAKBNOLE5STVGOFY/action/storage_attestation","attest_author":"https://pith.science/pith/KPM7ESDGUMXAKBNOLE5STVGOFY/action/author_attestation","sign_citation":"https://pith.science/pith/KPM7ESDGUMXAKBNOLE5STVGOFY/action/citation_signature","submit_replication":"https://pith.science/pith/KPM7ESDGUMXAKBNOLE5STVGOFY/action/replication_record"}},"created_at":"2026-05-18T00:14:00.466187+00:00","updated_at":"2026-05-18T00:14:00.466187+00:00"}