Pages that link to "Item:Q1356892"
From MaRDI portal
The following pages link to Learning an intersection of a constant number of halfspaces over a uniform distribution (Q1356892):
Displaying 15 items.
- Learning intersections and thresholds of halfspaces (Q598257) (← links)
- On the hardness of learning intersections of two halfspaces (Q619909) (← links)
- On learning a union of half spaces (Q915490) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- PAC learning intersections of halfspaces with membership queries (Q1271191) (← links)
- Halfspace learning, linear programming, and nonmalicious distributions (Q1336756) (← links)
- On the limits of efficient teachability (Q1603392) (← links)
- The learnability of unions of two rectangles in the two-dimensional discretized space (Q1807675) (← 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)
- Learning Theory (Q4680888) (← links)
- (Q4808629) (← links)
- Fooling Polytopes (Q5066946) (← links)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)