{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HQ3GRIQUJTJGO6EX7QJOIJZEZF","short_pith_number":"pith:HQ3GRIQU","schema_version":"1.0","canonical_sha256":"3c3668a2144cd2677897fc12e42724c972ee2350425e8d88101de02a50f5bbd4","source":{"kind":"arxiv","id":"1502.03475","version":3},"attestation_state":"computed","paper":{"title":"Combinatorial Bandits Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandre Proutiere, Marc Lelarge, M. Sadegh Talebi, Richard Combes","submitted_at":"2015-02-11T22:35:50Z","abstract_excerpt":"This paper investigates stochastic and adversarial combinatorial multi-armed bandit problems. In the stochastic setting under semi-bandit feedback, we derive a problem-specific regret lower bound, and discuss its scaling with the dimension of the decision space. We propose ESCB, an algorithm that efficiently exploits the structure of the problem and provide a finite-time analysis of its regret. ESCB has better performance guarantees than existing algorithms, and significantly outperforms these algorithms in practice. In the adversarial setting under bandit feedback, we propose \\textsc{CombEXP}"},"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":"1502.03475","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-11T22:35:50Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"60931c6dcff174dc93e27f2fa01628023aabd537464afc3291b74876daadc782","abstract_canon_sha256":"295d7d27eeea929b745c60a0969195aab4885888e37b88f63b98ac548fe9139b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:39.398214Z","signature_b64":"KZlVzoZnAxW5t384zlZMQ1+XLgNhy9ahVslKI3kwQnHBrcWpm5PjaxSBurG0HsqyA4lKHj6sAumvlHrsr/naDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c3668a2144cd2677897fc12e42724c972ee2350425e8d88101de02a50f5bbd4","last_reissued_at":"2026-05-18T01:27:39.397678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:39.397678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Bandits Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandre Proutiere, Marc Lelarge, M. Sadegh Talebi, Richard Combes","submitted_at":"2015-02-11T22:35:50Z","abstract_excerpt":"This paper investigates stochastic and adversarial combinatorial multi-armed bandit problems. In the stochastic setting under semi-bandit feedback, we derive a problem-specific regret lower bound, and discuss its scaling with the dimension of the decision space. We propose ESCB, an algorithm that efficiently exploits the structure of the problem and provide a finite-time analysis of its regret. ESCB has better performance guarantees than existing algorithms, and significantly outperforms these algorithms in practice. In the adversarial setting under bandit feedback, we propose \\textsc{CombEXP}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03475","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":"1502.03475","created_at":"2026-05-18T01:27:39.397746+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03475v3","created_at":"2026-05-18T01:27:39.397746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03475","created_at":"2026-05-18T01:27:39.397746+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQ3GRIQUJTJG","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQ3GRIQUJTJGO6EX","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQ3GRIQU","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.14908","citing_title":"Multi-User mmWave Beam and Rate Adaptation via Combinatorial Satisficing Bandits","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HQ3GRIQUJTJGO6EX7QJOIJZEZF","json":"https://pith.science/pith/HQ3GRIQUJTJGO6EX7QJOIJZEZF.json","graph_json":"https://pith.science/api/pith-number/HQ3GRIQUJTJGO6EX7QJOIJZEZF/graph.json","events_json":"https://pith.science/api/pith-number/HQ3GRIQUJTJGO6EX7QJOIJZEZF/events.json","paper":"https://pith.science/paper/HQ3GRIQU"},"agent_actions":{"view_html":"https://pith.science/pith/HQ3GRIQUJTJGO6EX7QJOIJZEZF","download_json":"https://pith.science/pith/HQ3GRIQUJTJGO6EX7QJOIJZEZF.json","view_paper":"https://pith.science/paper/HQ3GRIQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03475&json=true","fetch_graph":"https://pith.science/api/pith-number/HQ3GRIQUJTJGO6EX7QJOIJZEZF/graph.json","fetch_events":"https://pith.science/api/pith-number/HQ3GRIQUJTJGO6EX7QJOIJZEZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQ3GRIQUJTJGO6EX7QJOIJZEZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQ3GRIQUJTJGO6EX7QJOIJZEZF/action/storage_attestation","attest_author":"https://pith.science/pith/HQ3GRIQUJTJGO6EX7QJOIJZEZF/action/author_attestation","sign_citation":"https://pith.science/pith/HQ3GRIQUJTJGO6EX7QJOIJZEZF/action/citation_signature","submit_replication":"https://pith.science/pith/HQ3GRIQUJTJGO6EX7QJOIJZEZF/action/replication_record"}},"created_at":"2026-05-18T01:27:39.397746+00:00","updated_at":"2026-05-18T01:27:39.397746+00:00"}