{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:M7XBXT3XNFDTQOZJZTPSEBWI3S","short_pith_number":"pith:M7XBXT3X","schema_version":"1.0","canonical_sha256":"67ee1bcf776947383b29ccdf2206c8dcbd49c68984a119dc4df2ce4da1f7fc1e","source":{"kind":"arxiv","id":"2103.05907","version":1},"attestation_state":"computed","paper":{"title":"Linear Bandits on Uniformly Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Alexandre d'Aspremont, Christophe Roux, Sebastian Pokutta, Thomas Kerdreux","submitted_at":"2021-03-10T07:33:03Z","abstract_excerpt":"Linear bandit algorithms yield $\\tilde{\\mathcal{O}}(n\\sqrt{T})$ pseudo-regret bounds on compact convex action sets $\\mathcal{K}\\subset\\mathbb{R}^n$ and two types of structural assumptions lead to better pseudo-regret bounds. When $\\mathcal{K}$ is the simplex or an $\\ell_p$ ball with $p\\in]1,2]$, there exist bandits algorithms with $\\tilde{\\mathcal{O}}(\\sqrt{nT})$ pseudo-regret bounds. Here, we derive bandit algorithms for some strongly convex sets beyond $\\ell_p$ balls that enjoy pseudo-regret bounds of $\\tilde{\\mathcal{O}}(\\sqrt{nT})$, which answers an open question from [BCB12, \\S 5.5.]. Int"},"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":"2103.05907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-10T07:33:03Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"027663d68b625fe09e1ac501e5239a3bb185ad488b7f100c8ef58005720ef4fc","abstract_canon_sha256":"9e02b134af582e0cf663e6365a1f408bd9a45b7ecf0c52da189700702f5cf3f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:21:59.436693Z","signature_b64":"znCaMo9QdquldLyqrMAQQKCOzRN5aghUnMCYBmkM55ypMgkqO6O75iURDtiP6rVH+ENx6p2eoOGNuuImRc0/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67ee1bcf776947383b29ccdf2206c8dcbd49c68984a119dc4df2ce4da1f7fc1e","last_reissued_at":"2026-07-05T02:21:59.436174Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:21:59.436174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Bandits on Uniformly Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Alexandre d'Aspremont, Christophe Roux, Sebastian Pokutta, Thomas Kerdreux","submitted_at":"2021-03-10T07:33:03Z","abstract_excerpt":"Linear bandit algorithms yield $\\tilde{\\mathcal{O}}(n\\sqrt{T})$ pseudo-regret bounds on compact convex action sets $\\mathcal{K}\\subset\\mathbb{R}^n$ and two types of structural assumptions lead to better pseudo-regret bounds. When $\\mathcal{K}$ is the simplex or an $\\ell_p$ ball with $p\\in]1,2]$, there exist bandits algorithms with $\\tilde{\\mathcal{O}}(\\sqrt{nT})$ pseudo-regret bounds. Here, we derive bandit algorithms for some strongly convex sets beyond $\\ell_p$ balls that enjoy pseudo-regret bounds of $\\tilde{\\mathcal{O}}(\\sqrt{nT})$, which answers an open question from [BCB12, \\S 5.5.]. Int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.05907","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.05907/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":"2103.05907","created_at":"2026-07-05T02:21:59.436230+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.05907v1","created_at":"2026-07-05T02:21:59.436230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.05907","created_at":"2026-07-05T02:21:59.436230+00:00"},{"alias_kind":"pith_short_12","alias_value":"M7XBXT3XNFDT","created_at":"2026-07-05T02:21:59.436230+00:00"},{"alias_kind":"pith_short_16","alias_value":"M7XBXT3XNFDTQOZJ","created_at":"2026-07-05T02:21:59.436230+00:00"},{"alias_kind":"pith_short_8","alias_value":"M7XBXT3X","created_at":"2026-07-05T02:21:59.436230+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/M7XBXT3XNFDTQOZJZTPSEBWI3S","json":"https://pith.science/pith/M7XBXT3XNFDTQOZJZTPSEBWI3S.json","graph_json":"https://pith.science/api/pith-number/M7XBXT3XNFDTQOZJZTPSEBWI3S/graph.json","events_json":"https://pith.science/api/pith-number/M7XBXT3XNFDTQOZJZTPSEBWI3S/events.json","paper":"https://pith.science/paper/M7XBXT3X"},"agent_actions":{"view_html":"https://pith.science/pith/M7XBXT3XNFDTQOZJZTPSEBWI3S","download_json":"https://pith.science/pith/M7XBXT3XNFDTQOZJZTPSEBWI3S.json","view_paper":"https://pith.science/paper/M7XBXT3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.05907&json=true","fetch_graph":"https://pith.science/api/pith-number/M7XBXT3XNFDTQOZJZTPSEBWI3S/graph.json","fetch_events":"https://pith.science/api/pith-number/M7XBXT3XNFDTQOZJZTPSEBWI3S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M7XBXT3XNFDTQOZJZTPSEBWI3S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M7XBXT3XNFDTQOZJZTPSEBWI3S/action/storage_attestation","attest_author":"https://pith.science/pith/M7XBXT3XNFDTQOZJZTPSEBWI3S/action/author_attestation","sign_citation":"https://pith.science/pith/M7XBXT3XNFDTQOZJZTPSEBWI3S/action/citation_signature","submit_replication":"https://pith.science/pith/M7XBXT3XNFDTQOZJZTPSEBWI3S/action/replication_record"}},"created_at":"2026-07-05T02:21:59.436230+00:00","updated_at":"2026-07-05T02:21:59.436230+00:00"}