no code implementations • 16 Oct 2018 • Min Ye, Alexander Barg
In this paper, we sharpen this result by showing asymptotic optimality of the proposed scheme under the $\ell_p^p$ loss for all $1\le p\le 2.$ More precisely, we show that for any $p\in[1, 2]$ and any $k$ and $\epsilon,$ the ratio between the worst-case $\ell_p^p$ estimation loss of our scheme and the optimal value approaches $1$ as the number of samples tends to infinity.
no code implementations • 31 Jul 2017 • Min Ye, Alexander Barg
In other words, for a large number of samples the worst-case estimation loss of our scheme was shown to differ from the optimal value by at most a constant factor.
no code implementations • 2 Feb 2017 • Min Ye, Alexander Barg
For a given $\epsilon,$ we consider the problem of constructing optimal privatization schemes with $\epsilon$-privacy level, i. e., schemes that minimize the expected estimation loss for the worst-case distribution.