Differentially Private Learning of Geometric Concepts
From MaRDI portal
Publication:5092508
DOI10.1137/21M1406428zbMath1499.68310arXiv1902.05017OpenAlexW2949290494WikidataQ114074075 ScholiaQ114074075MaRDI QIDQ5092508
Yishay Mansour, Uri Stemmer, Haim Kaplan, Yossi Matias
Publication date: 22 July 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.05017
Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Privacy of data (68P27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The VC dimension of \(k\)-fold union
- Order-Revealing Encryption and the Hardness of Private Learning
- Simultaneous Private Learning of Multiple Concepts
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Characterizing the sample complexity of private learners
- What Can We Learn Privately?
- Efficient noise-tolerant learning from statistical queries
- The Algorithmic Foundations of Differential Privacy
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Sample Complexity Bounds on Differentially Private Learning via Communication Complexity
- Learnability and the Vapnik-Chervonenkis dimension
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- A theory of the learnable
- The Complexity of Differential Privacy
- Differential privacy and robust statistics
- Private PAC learning implies finite Littlestone dimension
- Learning Privately with Labeled and Unlabeled Examples
- Theory of Cryptography
- Sample-efficient proper PAC learning with approximate differential privacy
This page was built for publication: Differentially Private Learning of Geometric Concepts