Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Projects
Activities
Datasets
Research Labs / Equipment
Search by expertise, name or affiliation
Characterizing the sample complexity of pure private learners
Amos Beimel
, Kobbi Nissim
, Uri Stemmer
Research output
:
Contribution to journal
›
Article
›
peer-review
24
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Characterizing the sample complexity of pure private learners'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Sample Complexity
100%
Concept Classes
80%
Private Learning
80%
Differential Privacy
60%
Learning Algorithm
40%
Probabilistic Representation
40%
Optimization Problem
20%
Large Classes
20%
Complexity Measures
20%
Database Size
20%
Combinatorial Characterization
20%
VC-dimension
20%
PAC Learning
20%
Private Data Release
20%
Learning Privacy
20%
Computer Science
Differential Privacy
100%
Learning Algorithm
66%
Optimization Problem
33%
Complexity Measure
33%
Mathematics
Probabilistic Representation
100%
VC Dimension
50%
Class C
50%