scientific article; zbMATH DE number 7164694
From MaRDI portal
Publication:5214179
zbMath1434.68398MaRDI QIDQ5214179
Mark Bun, Kobbi Nissim, Uri Stemmer
Publication date: 7 February 2020
Full work available at URL: http://jmlr.csail.mit.edu/papers/v20/18-549.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Privacy of data (68P27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A result of Vapnik with applications
- Bounds on the sample complexity for private learning and private data release
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- Characterizing the sample complexity of private learners
- What Can We Learn Privately?
- Learnability and the Vapnik-Chervonenkis dimension
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- A theory of the learnable
- Collusion-secure fingerprinting for digital data
- Neural Network Learning
- Differentially Private Learning of Geometric Concepts
- Private coresets
- Differential privacy and robust statistics
- Private PAC learning implies finite Littlestone dimension
- Fingerprinting codes and the price of approximate differential privacy
- Analyze gauss
- Learning Privately with Labeled and Unlabeled Examples
- A learning theory approach to noninteractive database privacy
- Theory of Cryptography
- Optimal probabilistic fingerprint codes
This page was built for publication:
