Pages that link to "Item:Q2462501"
From MaRDI portal
The following pages link to Learning intersections of halfspaces with a margin (Q2462501):
Displaying 6 items.
- On the hardness of learning intersections of two halfspaces (Q619909) (← links)
- The hardest halfspace (Q1983325) (← links)
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- On the proliferation of support vectors in high dimensions* (Q5055426) (← links)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)
