{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XMXWQLFGWGDBBA7YI4HQESUB5G","short_pith_number":"pith:XMXWQLFG","schema_version":"1.0","canonical_sha256":"bb2f682ca6b1861083f8470f024a81e9959f1175c193d3e6d14780cf31a36401","source":{"kind":"arxiv","id":"1711.01037","version":1},"attestation_state":"computed","paper":{"title":"Sparsity, variance and curvature in multi-armed bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Michael B. Cohen, S\\'ebastien Bubeck, Yuanzhi Li","submitted_at":"2017-11-03T06:46:45Z","abstract_excerpt":"In (online) learning theory the concepts of sparsity, variance and curvature are well-understood and are routinely used to obtain refined regret and generalization bounds. In this paper we further our understanding of these concepts in the more challenging limited feedback scenario. We consider the adversarial multi-armed bandit and linear bandit settings and solve several open problems pertaining to the existence of algorithms with favorable regret bounds under the following assumptions: (i) sparsity of the individual losses, (ii) small variation of the loss sequence, and (iii) curvature of t"},"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":"1711.01037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-03T06:46:45Z","cross_cats_sorted":[],"title_canon_sha256":"6fe17ab4459e3ab5f5fc365531d6f4cebdffb01746d405acd50d6cda176dc2d7","abstract_canon_sha256":"fc83d6f8394eb17d06d76a73d98ad6b6f877b540793eb19d142b4e959ff3d2b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:24.227031Z","signature_b64":"Yc4Ds0nbeMPzrDuguW6APfhINPoanfglPwIn9APh4DbSgNANIyi9qLscI7Hae12TfEE7RFRh4oIum1GUoL1nAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb2f682ca6b1861083f8470f024a81e9959f1175c193d3e6d14780cf31a36401","last_reissued_at":"2026-05-18T00:31:24.226419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:24.226419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparsity, variance and curvature in multi-armed bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Michael B. Cohen, S\\'ebastien Bubeck, Yuanzhi Li","submitted_at":"2017-11-03T06:46:45Z","abstract_excerpt":"In (online) learning theory the concepts of sparsity, variance and curvature are well-understood and are routinely used to obtain refined regret and generalization bounds. In this paper we further our understanding of these concepts in the more challenging limited feedback scenario. We consider the adversarial multi-armed bandit and linear bandit settings and solve several open problems pertaining to the existence of algorithms with favorable regret bounds under the following assumptions: (i) sparsity of the individual losses, (ii) small variation of the loss sequence, and (iii) curvature of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01037","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":"1711.01037","created_at":"2026-05-18T00:31:24.226514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01037v1","created_at":"2026-05-18T00:31:24.226514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01037","created_at":"2026-05-18T00:31:24.226514+00:00"},{"alias_kind":"pith_short_12","alias_value":"XMXWQLFGWGDB","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XMXWQLFGWGDBBA7Y","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XMXWQLFG","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.13738","citing_title":"Covariance-adapting algorithm for semi-bandits with application to sparse rewards","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XMXWQLFGWGDBBA7YI4HQESUB5G","json":"https://pith.science/pith/XMXWQLFGWGDBBA7YI4HQESUB5G.json","graph_json":"https://pith.science/api/pith-number/XMXWQLFGWGDBBA7YI4HQESUB5G/graph.json","events_json":"https://pith.science/api/pith-number/XMXWQLFGWGDBBA7YI4HQESUB5G/events.json","paper":"https://pith.science/paper/XMXWQLFG"},"agent_actions":{"view_html":"https://pith.science/pith/XMXWQLFGWGDBBA7YI4HQESUB5G","download_json":"https://pith.science/pith/XMXWQLFGWGDBBA7YI4HQESUB5G.json","view_paper":"https://pith.science/paper/XMXWQLFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01037&json=true","fetch_graph":"https://pith.science/api/pith-number/XMXWQLFGWGDBBA7YI4HQESUB5G/graph.json","fetch_events":"https://pith.science/api/pith-number/XMXWQLFGWGDBBA7YI4HQESUB5G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XMXWQLFGWGDBBA7YI4HQESUB5G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XMXWQLFGWGDBBA7YI4HQESUB5G/action/storage_attestation","attest_author":"https://pith.science/pith/XMXWQLFGWGDBBA7YI4HQESUB5G/action/author_attestation","sign_citation":"https://pith.science/pith/XMXWQLFGWGDBBA7YI4HQESUB5G/action/citation_signature","submit_replication":"https://pith.science/pith/XMXWQLFGWGDBBA7YI4HQESUB5G/action/replication_record"}},"created_at":"2026-05-18T00:31:24.226514+00:00","updated_at":"2026-05-18T00:31:24.226514+00:00"}