{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G2DSTPLYYSHF5OAVDO5KAGJIEW","short_pith_number":"pith:G2DSTPLY","schema_version":"1.0","canonical_sha256":"368729bd78c48e5eb8151bbaa01928258e25c4a0d41ca3ec72d8f957ad599498","source":{"kind":"arxiv","id":"1610.02072","version":2},"attestation_state":"computed","paper":{"title":"An efficient high-probability algorithm for Linear Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"G\\'abor Braun, Sebastian Pokutta","submitted_at":"2016-10-06T21:14:16Z","abstract_excerpt":"For the linear bandit problem, we extend the analysis of algorithm CombEXP from [R. Combes, M. S. Talebi Mazraeh Shahi, A. Proutiere, and M. Lelarge. Combinatorial bandits revisited. In C. Cortes, N. D. Lawrence, D. D. Lee, M. Sugiyama, and R. Garnett, editors, Advances in Neural Information Processing Systems 28, pages 2116--2124. Curran Associates, Inc., 2015. URL http://papers.nips.cc/paper/5831-combinatorial-bandits-revisited.pdf] to the high-probability case against adaptive adversaries, allowing actions to come from an arbitrary polytope. We prove a high-probability regret of \\(O(T^{2/3}"},"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":"1610.02072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-06T21:14:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c8bc1a2a600d4ba5270865d2c83ab56dff2b7aab453eef060f971ca5d4806ac8","abstract_canon_sha256":"407388ea7b39ace80609f100b9382de074fb481b16551c73c4e622f3f22c1650"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:21.919707Z","signature_b64":"lm41z2Oxbfcr7VCaQzn+hnb3qTcBXWC+ai0yLn6JPMB62D5qK7Nsu4OfMPXvNRYtJ2/okauj1+DzzR4xYG0JBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"368729bd78c48e5eb8151bbaa01928258e25c4a0d41ca3ec72d8f957ad599498","last_reissued_at":"2026-05-18T01:02:21.918903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:21.918903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient high-probability algorithm for Linear Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"G\\'abor Braun, Sebastian Pokutta","submitted_at":"2016-10-06T21:14:16Z","abstract_excerpt":"For the linear bandit problem, we extend the analysis of algorithm CombEXP from [R. Combes, M. S. Talebi Mazraeh Shahi, A. Proutiere, and M. Lelarge. Combinatorial bandits revisited. In C. Cortes, N. D. Lawrence, D. D. Lee, M. Sugiyama, and R. Garnett, editors, Advances in Neural Information Processing Systems 28, pages 2116--2124. Curran Associates, Inc., 2015. URL http://papers.nips.cc/paper/5831-combinatorial-bandits-revisited.pdf] to the high-probability case against adaptive adversaries, allowing actions to come from an arbitrary polytope. We prove a high-probability regret of \\(O(T^{2/3}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02072","kind":"arxiv","version":2},"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":"1610.02072","created_at":"2026-05-18T01:02:21.919051+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02072v2","created_at":"2026-05-18T01:02:21.919051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02072","created_at":"2026-05-18T01:02:21.919051+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2DSTPLYYSHF","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2DSTPLYYSHF5OAV","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2DSTPLY","created_at":"2026-05-18T12:30:15.759754+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/G2DSTPLYYSHF5OAVDO5KAGJIEW","json":"https://pith.science/pith/G2DSTPLYYSHF5OAVDO5KAGJIEW.json","graph_json":"https://pith.science/api/pith-number/G2DSTPLYYSHF5OAVDO5KAGJIEW/graph.json","events_json":"https://pith.science/api/pith-number/G2DSTPLYYSHF5OAVDO5KAGJIEW/events.json","paper":"https://pith.science/paper/G2DSTPLY"},"agent_actions":{"view_html":"https://pith.science/pith/G2DSTPLYYSHF5OAVDO5KAGJIEW","download_json":"https://pith.science/pith/G2DSTPLYYSHF5OAVDO5KAGJIEW.json","view_paper":"https://pith.science/paper/G2DSTPLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02072&json=true","fetch_graph":"https://pith.science/api/pith-number/G2DSTPLYYSHF5OAVDO5KAGJIEW/graph.json","fetch_events":"https://pith.science/api/pith-number/G2DSTPLYYSHF5OAVDO5KAGJIEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2DSTPLYYSHF5OAVDO5KAGJIEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2DSTPLYYSHF5OAVDO5KAGJIEW/action/storage_attestation","attest_author":"https://pith.science/pith/G2DSTPLYYSHF5OAVDO5KAGJIEW/action/author_attestation","sign_citation":"https://pith.science/pith/G2DSTPLYYSHF5OAVDO5KAGJIEW/action/citation_signature","submit_replication":"https://pith.science/pith/G2DSTPLYYSHF5OAVDO5KAGJIEW/action/replication_record"}},"created_at":"2026-05-18T01:02:21.919051+00:00","updated_at":"2026-05-18T01:02:21.919051+00:00"}