paper-with-me

홈 › Papers

Differentially Private Learning of Geometric Concepts

2019-02-13 · Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer

We present differentially private efficient algorithms for learning union of polygons in the plane (which are not necessarily convex). Our algorithms achieve $(\alpha,\beta)$-PAC learning and $(\epsilon,\delta)$-differential privacy using a sample of size $\tilde{O}\left(\frac{1}{\alpha\epsilon}k\log d\right)$, where the domain is $[d]\times[d]$ and $k$ is the number of edges in the union of polygons.

📄 PDF Abstract BibTeX arXiv:1902.05017

Code (0)

등록된 구현이 없습니다.

Tasks

PAC learning

Similar Papers 제목 키워드 기반

A note on differentially private clustering with large additive error

2020-09-28 · Huy L. Nguyen

In this note, we describe a simple approach to obtain a differentially private algorithm for k-clustering with nearly the same multiplicative factor as any non-private counterpart at the cost of a large polynomial additi…

Clustering

Differentially Private Chi-squared Test by Unit Circle Mechanism

2017-08-01 · ICML 2017 8 · Kazuya Kakizaki, Kazuto Fukuchi, Jun Sakuma

This paper develops differentially private mechanisms for $\chi^2$ test of independence. While existing works put their effort into properly controlling the type-I error, in addition to that, we investigate the type…

Vocal Bursts Type Prediction

Sample Complexity Bounds on Differentially Private Learning via Communication Complexity

2014-02-25 · Vitaly Feldman, David Xiao

In this work we analyze the sample complexity of classification by differentially private algorithms. Differential privacy is a strong and well-studied notion of privacy introduced by Dwork et al. (2006) that ensures tha…

PAC learning

Simultaneous Private Learning of Multiple Concepts

2015-11-27 · Mark Bun, Kobbi Nissim, Uri Stemmer

We investigate the direct-sum problem in the context of differentially private PAC learning: What is the sample complexity of solving $k$ learning tasks simultaneously under differential privacy, and how does this cost c…

PAC learning

On Mitigating the Utility-Loss in Differentially Private Learning: A new Perspective by a Geometrically Inspired Kernel Approach

2023-04-03 · Mohit Kumar, Bernhard A. Moser, Lukas Fischer

Privacy-utility tradeoff remains as one of the fundamental issues of differentially private machine learning. This paper introduces a geometrically inspired kernel-based approach to mitigate the accuracy-loss issue in cl…

Federated LearningPrivacy PreservingRepresentation Learning