{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PKIXKDRPABQLZFCHLPH6CYQ7DV","short_pith_number":"pith:PKIXKDRP","schema_version":"1.0","canonical_sha256":"7a91750e2f0060bc94475bcfe1621f1d63198b06d763cb8b7a2a5e36fc516999","source":{"kind":"arxiv","id":"1701.07953","version":2},"attestation_state":"computed","paper":{"title":"The Price of Differential Privacy For Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Karan Singh, Naman Agarwal","submitted_at":"2017-01-27T06:17:14Z","abstract_excerpt":"We design differentially private algorithms for the problem of online linear optimization in the full information and bandit settings with optimal $\\tilde{O}(\\sqrt{T})$ regret bounds. In the full-information setting, our results demonstrate that $\\epsilon$-differential privacy may be ensured for free -- in particular, the regret bounds scale as $O(\\sqrt{T})+\\tilde{O}\\left(\\frac{1}{\\epsilon}\\right)$. For bandit linear optimization, and as a special case, for non-stochastic multi-armed bandits, the proposed algorithm achieves a regret of $\\tilde{O}\\left(\\frac{1}{\\epsilon}\\sqrt{T}\\right)$, while "},"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":"1701.07953","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-01-27T06:17:14Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ee5ccf720163a44089c386c34db8d4bd6c9616efb39a67125b8c575032f8cd1e","abstract_canon_sha256":"cb50365e2647ab660f0163110c7b586068412f2f48f9d92156ea631d6c5c2688"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:23.548370Z","signature_b64":"zpOogMRKHuvrnJEXA+EhNdN2V/jJSqwPOyziczLEYbnd0cXNWtiGW1QmLWLnkcp+xYmIH+B8A6ahhV4rGPceDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a91750e2f0060bc94475bcfe1621f1d63198b06d763cb8b7a2a5e36fc516999","last_reissued_at":"2026-05-18T00:42:23.547942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:23.547942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Price of Differential Privacy For Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Karan Singh, Naman Agarwal","submitted_at":"2017-01-27T06:17:14Z","abstract_excerpt":"We design differentially private algorithms for the problem of online linear optimization in the full information and bandit settings with optimal $\\tilde{O}(\\sqrt{T})$ regret bounds. In the full-information setting, our results demonstrate that $\\epsilon$-differential privacy may be ensured for free -- in particular, the regret bounds scale as $O(\\sqrt{T})+\\tilde{O}\\left(\\frac{1}{\\epsilon}\\right)$. For bandit linear optimization, and as a special case, for non-stochastic multi-armed bandits, the proposed algorithm achieves a regret of $\\tilde{O}\\left(\\frac{1}{\\epsilon}\\sqrt{T}\\right)$, while "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07953","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":"1701.07953","created_at":"2026-05-18T00:42:23.548008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07953v2","created_at":"2026-05-18T00:42:23.548008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07953","created_at":"2026-05-18T00:42:23.548008+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKIXKDRPABQL","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKIXKDRPABQLZFCH","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKIXKDRP","created_at":"2026-05-18T12:31:37.085036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.23887","citing_title":"CHRONOS: Temporally-Aware Multi-Agent Coordination for Evolving Data Marketplaces","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PKIXKDRPABQLZFCHLPH6CYQ7DV","json":"https://pith.science/pith/PKIXKDRPABQLZFCHLPH6CYQ7DV.json","graph_json":"https://pith.science/api/pith-number/PKIXKDRPABQLZFCHLPH6CYQ7DV/graph.json","events_json":"https://pith.science/api/pith-number/PKIXKDRPABQLZFCHLPH6CYQ7DV/events.json","paper":"https://pith.science/paper/PKIXKDRP"},"agent_actions":{"view_html":"https://pith.science/pith/PKIXKDRPABQLZFCHLPH6CYQ7DV","download_json":"https://pith.science/pith/PKIXKDRPABQLZFCHLPH6CYQ7DV.json","view_paper":"https://pith.science/paper/PKIXKDRP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07953&json=true","fetch_graph":"https://pith.science/api/pith-number/PKIXKDRPABQLZFCHLPH6CYQ7DV/graph.json","fetch_events":"https://pith.science/api/pith-number/PKIXKDRPABQLZFCHLPH6CYQ7DV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKIXKDRPABQLZFCHLPH6CYQ7DV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKIXKDRPABQLZFCHLPH6CYQ7DV/action/storage_attestation","attest_author":"https://pith.science/pith/PKIXKDRPABQLZFCHLPH6CYQ7DV/action/author_attestation","sign_citation":"https://pith.science/pith/PKIXKDRPABQLZFCHLPH6CYQ7DV/action/citation_signature","submit_replication":"https://pith.science/pith/PKIXKDRPABQLZFCHLPH6CYQ7DV/action/replication_record"}},"created_at":"2026-05-18T00:42:23.548008+00:00","updated_at":"2026-05-18T00:42:23.548008+00:00"}