Login / Signup
Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals.
Ilias Diakonikolas
Daniel Kane
Lisheng Ren
Published in:
ICML (2023)
Keyphrases
</>
agnostic learning
learning process
learning algorithm
learning problems
exact learning
decision trees
cost sensitive
efficient learning
noise tolerant
locally weighted