On learning a union of half spaces

DOI10.1016/0885-064X(90)90012-3MaRDI QIDQ915490zbMATH OpenFDO

Authors Eric B. Baum

Publication date 1990

Published in Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

polynomial timelearning from exampleslearnabilitycredit assignment problemlower bounds on the number of examples

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 67634
• Learning intersections and thresholds of halfspaces
• PAC learning intersections of halfspaces with membership queries
• Learning an intersection of a constant number of halfspaces over a uniform distribution
• Halfspace learning, linear programming, and nonmalicious distributions

Cites work

• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 3436645 (Why is no real title available?)
• scientific article; zbMATH DE number 3231758 (Why is no real title available?)
• scientific article; zbMATH DE number 3271295 (Why is no real title available?)
• scientific article; zbMATH DE number 3314813 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• A theory of the learnable
• Convergence of stochastic processes
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Learnability and the Vapnik-Chervonenkis dimension
• On the complexity of loading shallow neural networks
• On the complexity of polyhedral separability

Cited in

(16)

• Learning fixed-dimension linear thresholds from fragmented data
• Learning convex bodies under uniform distribution
• scientific article; zbMATH DE number 774005 (Why is no real title available?)
• Learning Theory
• The learnability of unions of two rectangles in the two-dimensional discretized space
• An algorithmic theory of learning: robust concepts and random projection
• Noise-tolerant parallel learning of geometric concepts
• scientific article; zbMATH DE number 2089966 (Why is no real title available?)
• An algorithmic theory of learning: Robust concepts and random projection
• Agnostically Learning Halfspaces
• Almost optimal set covers in finite VC-dimension
• Learning an intersection of a constant number of halfspaces over a uniform distribution
• Halfspace learning, linear programming, and nonmalicious distributions
• Complexity of network training for classes of Neural Networks
• On the limits of efficient teachability
• Learning intersections of halfspaces with a margin

This page was built for publication: On learning a union of half spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915490)