Pages that link to "Item:Q4910575"
From MaRDI portal
The following pages link to Agnostic Learning of Monomials by Halfspaces Is Hard (Q4910575):
Displaying 3 items.
- Tikhonov, Ivanov and Morozov regularization for support vector machine learning (Q285946) (← links)
- On the hardness of learning intersections of two halfspaces (Q619909) (← links)
- A moment-matching approach to testable learning and a new characterization of Rademacher complexity (Q6499330) (← links)
