Learning privately with labeled and unlabeled examples

DOI10.1007/S00453-020-00753-ZMaRDI QIDQ2223696zbMATH OpenOpenAlexFDO

Authors Amos Beimel, Kobbi Nissim, Uri Stemmer

Publication date 1 February 2021

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1407.2662

zbMATH Keywords

active learningdifferential privacyPAC learningsemi-supervised learning

Mathematics Subject Classification ID

Privacy of data (68P27) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning Privately with Labeled and Unlabeled Examples
• Characterizing the sample complexity of private learners
• Bounds on the sample complexity for private learning and private data release
• scientific article; zbMATH DE number 7164746
• Bounds on the sample complexity for private learning and private data release

Cites work

• A general lower bound on the number of examples needed for learning
• A learning theory approach to noninteractive database privacy
• A theory of the learnable
• Algorithmic stability for adaptive data analysis
• Bounds on the sample complexity for private learning and private data release
• Characterizing the sample complexity of private learners
• Differentially private empirical risk minimization
• Efficient noise-tolerant learning from statistical queries
• Fingerprinting codes and the price of approximate differential privacy
• scientific article; zbMATH DE number 5485440 (Why is no real title available?)
• scientific article; zbMATH DE number 3446442 (Why is no real title available?)
• Learnability and the Vapnik-Chervonenkis dimension
• Learning with a probabilistic teacher
• On the density of families of sets
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• Preserving statistical validity in adaptive data analysis (extended abstract)
• Private learning and sanitization: pure vs. approximate differential privacy
• Private PAC learning implies finite Littlestone dimension
• Private stochastic convex optimization: optimal rates in linear time
• Probability of error of some adaptive pattern-recognition machines
• Sample complexity bounds on differentially private learning via communication complexity
• Simultaneous private learning of multiple concepts
• Theory of Cryptography
• What can we learn privately?

Cited in

(3)

• Semi-supervised learning with summary statistics
• Learning Privately with Labeled and Unlabeled Examples
• Realizable learning is all you need

Describes a project that uses

Uses Software

• SuLQ

This page was built for publication: Learning privately with labeled and unlabeled examples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2223696)