{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SYPLMRZKAVKY54H4SVBWHVXDP7","short_pith_number":"pith:SYPLMRZK","schema_version":"1.0","canonical_sha256":"961eb6472a05558ef0fc954363d6e37fe9d9ad61f42954a945ae68fd9c852fc9","source":{"kind":"arxiv","id":"1802.04085","version":3},"attestation_state":"computed","paper":{"title":"Empirical Risk Minimization in Non-interactive Local Differential Privacy: Efficiency and High Dimensional Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Di Wang, Jinhui Xu, Marco Gaboardi","submitted_at":"2018-02-12T14:52:24Z","abstract_excerpt":"In this paper, we study the Empirical Risk Minimization problem in the non-interactive local model of differential privacy. In the case of constant or low dimensionality ($p\\ll n$), we first show that if the ERM loss function is $(\\infty, T)$-smooth, then we can avoid a dependence of the sample complexity, to achieve error $\\alpha$, on the exponential of the dimensionality $p$ with base $1/\\alpha$ (i.e., $\\alpha^{-p}$), which answers a question in [smith 2017 interaction]. Our approach is based on polynomial approximation. Then, we propose player-efficient algorithms with $1$-bit communication"},"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":"1802.04085","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T14:52:24Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"0778466b4daca07249b55d3b2561f3ab9578c3c6695820af4fa524ad38a23706","abstract_canon_sha256":"e6f50b077b73ebcf26344d551c1014eb8fccfa582d913b35a2a911e84ed7ecb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:46.593055Z","signature_b64":"dayZF+Z788/ugIWHxVne6DKNfrzq6HjeUrrN/BNE9lN0ZCIZUOgbgD3n/kPYHhnNnSa0rNruHgZIdjXbgITKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"961eb6472a05558ef0fc954363d6e37fe9d9ad61f42954a945ae68fd9c852fc9","last_reissued_at":"2026-05-18T00:15:46.592528Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:46.592528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Empirical Risk Minimization in Non-interactive Local Differential Privacy: Efficiency and High Dimensional Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Di Wang, Jinhui Xu, Marco Gaboardi","submitted_at":"2018-02-12T14:52:24Z","abstract_excerpt":"In this paper, we study the Empirical Risk Minimization problem in the non-interactive local model of differential privacy. In the case of constant or low dimensionality ($p\\ll n$), we first show that if the ERM loss function is $(\\infty, T)$-smooth, then we can avoid a dependence of the sample complexity, to achieve error $\\alpha$, on the exponential of the dimensionality $p$ with base $1/\\alpha$ (i.e., $\\alpha^{-p}$), which answers a question in [smith 2017 interaction]. Our approach is based on polynomial approximation. Then, we propose player-efficient algorithms with $1$-bit communication"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04085","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":"1802.04085","created_at":"2026-05-18T00:15:46.592627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.04085v3","created_at":"2026-05-18T00:15:46.592627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04085","created_at":"2026-05-18T00:15:46.592627+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYPLMRZKAVKY","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYPLMRZKAVKY54H4","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYPLMRZK","created_at":"2026-05-18T12:32:53.628368+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/SYPLMRZKAVKY54H4SVBWHVXDP7","json":"https://pith.science/pith/SYPLMRZKAVKY54H4SVBWHVXDP7.json","graph_json":"https://pith.science/api/pith-number/SYPLMRZKAVKY54H4SVBWHVXDP7/graph.json","events_json":"https://pith.science/api/pith-number/SYPLMRZKAVKY54H4SVBWHVXDP7/events.json","paper":"https://pith.science/paper/SYPLMRZK"},"agent_actions":{"view_html":"https://pith.science/pith/SYPLMRZKAVKY54H4SVBWHVXDP7","download_json":"https://pith.science/pith/SYPLMRZKAVKY54H4SVBWHVXDP7.json","view_paper":"https://pith.science/paper/SYPLMRZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.04085&json=true","fetch_graph":"https://pith.science/api/pith-number/SYPLMRZKAVKY54H4SVBWHVXDP7/graph.json","fetch_events":"https://pith.science/api/pith-number/SYPLMRZKAVKY54H4SVBWHVXDP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYPLMRZKAVKY54H4SVBWHVXDP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYPLMRZKAVKY54H4SVBWHVXDP7/action/storage_attestation","attest_author":"https://pith.science/pith/SYPLMRZKAVKY54H4SVBWHVXDP7/action/author_attestation","sign_citation":"https://pith.science/pith/SYPLMRZKAVKY54H4SVBWHVXDP7/action/citation_signature","submit_replication":"https://pith.science/pith/SYPLMRZKAVKY54H4SVBWHVXDP7/action/replication_record"}},"created_at":"2026-05-18T00:15:46.592627+00:00","updated_at":"2026-05-18T00:15:46.592627+00:00"}