all InfoSec news
Optimal Algorithms for Mean Estimation under Local Differential Privacy. (arXiv:2205.02466v1 [cs.LG])
May 6, 2022, 1:20 a.m. | Hilal Asi, Vitaly Feldman, Kunal Talwar
cs.CR updates on arXiv.org arxiv.org
We study the problem of mean estimation of $\ell_2$-bounded vectors under the
constraint of local differential privacy. While the literature has a variety of
algorithms that achieve the asymptotically optimal rates for this problem, the
performance of these algorithms in practice can vary significantly due to
varying (and often large) hidden constants. In this work, we investigate the
question of designing the protocol with the smallest variance. We show that
PrivUnit (Bhowmick et al. 2018) with optimized parameters achieves the …
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
Cybersecurity Skills Challenge -- Sponsored by DoD
@ Correlation One | United States
Security Operations Center (SOC) Analyst
@ GK Cybersecurity Group | Remote
Azure Security Architect
@ First Quality | Remote US - Eastern or Central Timezone
Staff Security Researcher (Network Protocols)
@ Palo Alto Networks | Santa Clara, CA, United States
Senior Product Manager - Endpoint Security
@ Ivanti | Bengaluru, India
Penetration Tester
@ Lostar | İstanbul, Türkiye