Pages that link to "Item:Q619909"
From MaRDI portal
The following pages link to On the hardness of learning intersections of two halfspaces (Q619909):
Displaying 12 items.
- Improved approximation of linear threshold functions (Q371200) (← links)
- Learning intersections and thresholds of halfspaces (Q598257) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- PAC learning intersections of halfspaces with membership queries (Q1271191) (← links)
- The hardest halfspace (Q1983325) (← links)
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
- Learning intersections of halfspaces with a margin (Q2462501) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Learning Theory (Q4680888) (← links)
- Agnostic Learning of Monomials by Halfspaces Is Hard (Q4910575) (← links)
- Fooling Polytopes (Q5066946) (← links)
- (Q5091179) (← links)