A random-sampling-based algorithm for learning intersections of halfspaces
From MaRDI portal
Recommendations
Cited in
(17)- Unconditional lower bounds for learning intersections of halfspaces
- PAC learning intersections of halfspaces with membership queries
- Learning an intersection of a constant number of halfspaces over a uniform distribution
- The hardest halfspace
- Learning intersections of halfspaces with a margin
- Learning kernel-based halfspaces with the 0-1 loss
- The average sensitivity of an intersection of half spaces
- On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle
- Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions
- Learning Theory
- scientific article; zbMATH DE number 774005 (Why is no real title available?)
- Fooling Polytopes
- The average sensitivity of an intersection of half spaces
- Improved Lower Bounds for Learning Intersections of Halfspaces
- Learning intersections and thresholds of halfspaces
- On the hardness of learning intersections of two halfspaces
- Attribute-efficient learning of halfspaces with malicious noise: near-optimal label complexity and noise tolerance
This page was built for publication: A random-sampling-based algorithm for learning intersections of halfspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999781)