Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals.
Daniel HsuClayton SanfordRocco A. ServedioEmmanouil-Vasileios Vlatakis-GkaragkounisPublished in: CoRR (2022)
Keyphrases
- statistical queries
- lower bound
- noise tolerant
- agnostic learning
- concept class
- learning process
- supervised learning
- uniform distribution
- machine learning
- active learning
- vc dimension
- learning algorithm
- concept classes
- positive examples
- inductive learning
- learning tasks
- background knowledge
- upper bound
- domain knowledge
- prior knowledge
- reinforcement learning
- concept learning
- noisy data
- inductive inference
- learning problems
- membership queries
- exact learning
- pac model
- positive and unlabeled examples