Login / Signup
Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems.
Stefan Tiegel
Published in:
COLT (2023)
Keyphrases
</>
worst case
agnostic learning
learning algorithm
solving problems
online learning
learning process
reinforcement learning
np complete
learning problems
error bounds
background knowledge
learning tasks
inductive inference
positive examples
active learning
np hardness
exact learning
computational complexity