资源分类
》 资源 》论文》Lower Bound of Locally Differentially Private Sparse Covariance Matrix Estimation?

Lower Bound of Locally Differentially Private Sparse Covariance Matrix Estimation?

2019-10-10 | |  113 |   49 |   0
Abstract In this paper, we study the sparse covariance matrix estimation problem in the local differential privacy model, and give a non-trivial lower bound on the non-interactive private minimax risk in the metric of squared spectral norm. We show that the lower bound is actually tight, as it matches a previous upper bound. Our main technique for achieving this lower bound is a general framework, called General Private Assouad Lemma, which is a considerable generalization of the previous private Assouad lemma and can be used as a general method for bounding the private minimax risk of matrix-related estimation problems

上一篇：Learning towards Abstractive Timeline Summarization

下一篇：Metadata-driven Task Relation Discovery for Multi-task Learning

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...