Cryptographic Hardness of Learning Halfspaces with Massart Noise
–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
Mar-18-2025, 21:18:26 GMT
- Country:
- North America > United States > California (0.28)
- Genre:
- Research Report > New Finding (0.46)
- Technology: