Private PAC Learning May be Harder than Online Learning.
Mark BunAloni CohenRathin DesaiPublished in: ALT (2024)
Keyphrases
- pac learning
- online learning
- uniform distribution
- computational learning theory
- learning theory
- e learning
- sample size
- sample complexity
- learning problems
- np complete
- target concept
- membership queries
- np hard
- concept classes
- classification noise
- pac learnability
- boolean functions
- vc dimension
- active learning
- statistical queries
- data sets
- agnostic learning
- training samples
- compression algorithm