The following pages link to On learning a union of half spaces (Q915490):
Displaying 15 items.
- An algorithmic theory of learning: robust concepts and random projection (Q851862) (← links)
- Learning convex bodies under uniform distribution (Q1198007) (← links)
- Noise-tolerant parallel learning of geometric concepts (Q1281499) (← links)
- Halfspace learning, linear programming, and nonmalicious distributions (Q1336756) (← links)
- Learning an intersection of a constant number of halfspaces over a uniform distribution (Q1356892) (← links)
- On the limits of efficient teachability (Q1603392) (← links)
- The learnability of unions of two rectangles in the two-dimensional discretized space (Q1807675) (← links)
- Learning fixed-dimension linear thresholds from fragmented data (Q1854473) (← links)
- Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
- Learning intersections of halfspaces with a margin (Q2462501) (← links)
- An algorithmic theory of learning: Robust concepts and random projection (Q2499543) (← links)
- Agnostically Learning Halfspaces (Q3549323) (← links)
- Learning Theory (Q4680888) (← links)
- (Q4808629) (← links)
- Agnostic Learning of Monomials by Halfspaces Is Hard (Q4910575) (← links)
