On learning a union of half spaces

DOI10.1016/0885-064X(90)90012-3zbMATH Open0702.68089MaRDI QIDQ915490FDOQ915490

Authors: Eric B. Baum 

Publication date: 1990

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

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

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)

Cites Work

• A new polynomial-time algorithm for linear programming
• Convergence of stochastic processes
• Title not available (Why is that?)
• Learnability and the Vapnik-Chervonenkis dimension
• Title not available (Why is that?)
• On the complexity of polyhedral separability
• Title not available (Why is that?)
• A theory of the learnable
• Title not available (Why is that?)
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Title not available (Why is that?)
• On the complexity of loading shallow neural networks

Cited In (16)

• Learning fixed-dimension linear thresholds from fragmented data
• Title not available (Why is that?)
• Learning convex bodies under uniform distribution
• 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
• Title not available (Why is that?)
• 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
• Complexity of network training for classes of Neural Networks
• Halfspace learning, linear programming, and nonmalicious distributions
• 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)