scientific article; zbMATH DE number 7164746
From MaRDI portal
Publication:5214238
zbMath1434.68395arXiv1402.2224MaRDI QIDQ5214238
Amos Beimel, Kobbi Nissim, Uri Stemmer
Publication date: 7 February 2020
Full work available at URL: https://arxiv.org/abs/1402.2224
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Inequalities; stochastic orderings (60E15) Learning and adaptive systems in artificial intelligence (68T05) Missing data (62D10) Privacy of data (68P27)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Private vs. common random bits in communication complexity
- On data structures and asymmetric communication complexity
- A decision-theoretic generalization of on-line learning and an application to boosting
- A general lower bound on the number of examples needed for learning
- Bounds on the sample complexity for private learning and private data release
- The Complexity of Computing the Optimal Composition of Differential Privacy
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- What Can We Learn Privately?
- The Algorithmic Foundations of Differential Privacy
- Sample Complexity Bounds on Differentially Private Learning via Communication Complexity
- Learnability and the Vapnik-Chervonenkis dimension
- Private Approximation of Search Problems
- A theory of the learnable
- Private PAC learning implies finite Littlestone dimension
- Probability Inequalities for Sums of Bounded Random Variables
- Learning Privately with Labeled and Unlabeled Examples
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Theory of Cryptography
This page was built for publication:
