Pages that link to "Item:Q1271191"
From MaRDI portal
The following pages link to PAC learning intersections of halfspaces with membership queries (Q1271191):
Displaying 16 items.
- Learning unions of high-dimensional boxes over the reals (Q294744) (← links)
- Learning intersections and thresholds of halfspaces (Q598257) (← links)
- On learning a union of half spaces (Q915490) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- Characterizing PAC-learnability of semilinear sets (Q1346716) (← 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 hardest halfspace (Q1983325) (← links)
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
- A characterization of 2-threshold functions via pairs of prime segments (Q2136278) (← links)
- Learning intersections of halfspaces with a margin (Q2462501) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Learning Theory (Q4680888) (← links)
- Learning Theory (Q4680893) (← links)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)