Characterizing the sample complexity of private learners
Open Access
- 9 January 2013
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 97-110
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- A firm foundation for private data analysisCommunications of the ACM, 2011
- Private Approximation of Search ProblemsSIAM Journal on Computing, 2009
- Calibrating Noise to Sensitivity in Private Data Analysis2006
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- A general lower bound on the number of examples needed for learningInformation and Computation, 1989
- A theory of the learnableCommunications of the ACM, 1984
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability & Its Applications, 1971
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952