Learning Theory
From MaRDI portal
Publication:4680888
DOI10.1007/B98522zbMATH Open1078.68051OpenAlexW4206057230MaRDI QIDQ4680888FDOQ4680888
Authors: Adam R. Klivans, Rocco A. Servedio 
Publication date: 13 June 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98522
Recommendations
- Learning intersections of halfspaces with a margin
- Learning intersections and thresholds of halfspaces
- Learning an intersection of a constant number of halfspaces over a uniform distribution
- Improved Lower Bounds for Learning Intersections of Halfspaces
- scientific article; zbMATH DE number 774005
- A random-sampling-based algorithm for learning intersections of halfspaces
- Unconditional lower bounds for learning intersections of halfspaces
- On learning a union of half spaces
- On the hardness of learning intersections of two halfspaces
- PAC learning intersections of halfspaces with membership queries
Cited In (9)
- On the perceptron's compression
- An algorithmic theory of learning: robust concepts and random projection
- A random-sampling-based algorithm for learning intersections of halfspaces
- An algorithmic theory of learning: Robust concepts and random projection
- Learning kernel-based halfspaces with the 0-1 loss
- Randomized anisotropic transform for nonlinear dimensionality reduction
- Estimating the optimal margins of embeddings in Euclidean half spaces
- Unconditional lower bounds for learning intersections of halfspaces
- Learning intersections of halfspaces with a margin
This page was built for publication: Learning Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680888)
