Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems.
Stefan TiegelPublished in: CoRR (2022)
Keyphrases
- worst case
- agnostic learning
- solving problems
- learning process
- learning algorithm
- supervised learning
- computational complexity
- reinforcement learning
- average case
- special case
- np hard
- online learning
- active learning
- upper bound
- learning systems
- error bounds
- binary classification problems
- noise tolerant
- machine learning