{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X7O24YLTZ27AKD2Z2WOIQ727OE","short_pith_number":"pith:X7O24YLT","schema_version":"1.0","canonical_sha256":"bfddae6173cebe050f59d59c887f5f7101c943d4e312a8cd5dfac05767707ec1","source":{"kind":"arxiv","id":"1905.12298","version":2},"attestation_state":"computed","paper":{"title":"Differential Privacy for Multi-armed Bandits: What Is It and What Is Its Cost?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aristide Tossou, Christos Dimitrakakis, Debabrota Basu","submitted_at":"2019-05-29T09:56:41Z","abstract_excerpt":"Based on differential privacy (DP) framework, we introduce and unify privacy definitions for the multi-armed bandit algorithms. We represent the framework with a unified graphical model and use it to connect privacy definitions. We derive and contrast lower bounds on the regret of bandit algorithms satisfying these definitions. We leverage a unified proving technique to achieve all the lower bounds. We show that for all of them, the learner's regret is increased by a multiplicative factor dependent on the privacy level $\\epsilon$. We observe that the dependency is weaker when we do not require"},"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":"1905.12298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T09:56:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"552d2aefc3ea49ad335d18775eb356f572157e836df99802e22f375e99b034c8","abstract_canon_sha256":"e3154eb6d690de8179a3df77b6b75eca2379f9734b0ed1dcd98c8c9dfa80fefe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:13:05.941715Z","signature_b64":"n+mmJabFgZTQgWRqg7ePTccggJh5RFp5NQR/H8IUv+tVmx7zsnDcACUL8Yabz3iirphdnN7J3+jl1hx3MOtnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfddae6173cebe050f59d59c887f5f7101c943d4e312a8cd5dfac05767707ec1","last_reissued_at":"2026-07-05T01:13:05.941206Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:13:05.941206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differential Privacy for Multi-armed Bandits: What Is It and What Is Its Cost?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aristide Tossou, Christos Dimitrakakis, Debabrota Basu","submitted_at":"2019-05-29T09:56:41Z","abstract_excerpt":"Based on differential privacy (DP) framework, we introduce and unify privacy definitions for the multi-armed bandit algorithms. We represent the framework with a unified graphical model and use it to connect privacy definitions. We derive and contrast lower bounds on the regret of bandit algorithms satisfying these definitions. We leverage a unified proving technique to achieve all the lower bounds. We show that for all of them, the learner's regret is increased by a multiplicative factor dependent on the privacy level $\\epsilon$. We observe that the dependency is weaker when we do not require"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12298","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.12298/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":"1905.12298","created_at":"2026-07-05T01:13:05.941263+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12298v2","created_at":"2026-07-05T01:13:05.941263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12298","created_at":"2026-07-05T01:13:05.941263+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7O24YLTZ27A","created_at":"2026-07-05T01:13:05.941263+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7O24YLTZ27AKD2Z","created_at":"2026-07-05T01:13:05.941263+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7O24YLT","created_at":"2026-07-05T01:13:05.941263+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23096","citing_title":"Minimax Quantile Lower Bounds for Interactive Statistical Decision Making with Privacy","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2406.06408","citing_title":"Differentially Private Best-Arm Identification","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00638","citing_title":"Unlearning Offline Stochastic Multi-Armed Bandits","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X7O24YLTZ27AKD2Z2WOIQ727OE","json":"https://pith.science/pith/X7O24YLTZ27AKD2Z2WOIQ727OE.json","graph_json":"https://pith.science/api/pith-number/X7O24YLTZ27AKD2Z2WOIQ727OE/graph.json","events_json":"https://pith.science/api/pith-number/X7O24YLTZ27AKD2Z2WOIQ727OE/events.json","paper":"https://pith.science/paper/X7O24YLT"},"agent_actions":{"view_html":"https://pith.science/pith/X7O24YLTZ27AKD2Z2WOIQ727OE","download_json":"https://pith.science/pith/X7O24YLTZ27AKD2Z2WOIQ727OE.json","view_paper":"https://pith.science/paper/X7O24YLT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12298&json=true","fetch_graph":"https://pith.science/api/pith-number/X7O24YLTZ27AKD2Z2WOIQ727OE/graph.json","fetch_events":"https://pith.science/api/pith-number/X7O24YLTZ27AKD2Z2WOIQ727OE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7O24YLTZ27AKD2Z2WOIQ727OE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7O24YLTZ27AKD2Z2WOIQ727OE/action/storage_attestation","attest_author":"https://pith.science/pith/X7O24YLTZ27AKD2Z2WOIQ727OE/action/author_attestation","sign_citation":"https://pith.science/pith/X7O24YLTZ27AKD2Z2WOIQ727OE/action/citation_signature","submit_replication":"https://pith.science/pith/X7O24YLTZ27AKD2Z2WOIQ727OE/action/replication_record"}},"created_at":"2026-07-05T01:13:05.941263+00:00","updated_at":"2026-07-05T01:13:05.941263+00:00"}