Cryptographic Hardness of Learning Halfspaces with Massart Noise Ilias Diakonikolas Daniel M. Kane Pasin Manurangsi Lisheng Ren UW Madison UC San-Diego Google Research UW Madison
–Neural Information Processing Systems
We study the complexity of PAC learning halfspaces in the presence of Massart noise. In this problem, we are given i.i.d.
Neural Information Processing Systems
Jan-23-2025, 12:52:25 GMT
- Country:
- North America > United States > California > San Diego County > San Diego (0.40)
- Genre:
- Research Report > New Finding (0.46)
- Technology: