Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions

DOI10.1007/978-3-642-03685-9_44MaRDI QIDQ3638906zbMATH OpenOpenAlexFDO

Authors Adam R. Klivans, Philip M. Long, Alex K. Tang

Publication date 28 October 2009

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03685-9_44

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A random-sampling-based algorithm for learning intersections of halfspaces
• Learning an intersection of a constant number of halfspaces over a uniform distribution
• Learning Halfspaces with Malicious Noise
• Learning intersections and thresholds of halfspaces
• Halfspace learning, linear programming, and nonmalicious distributions

Cited in

(3)

• The hardest halfspace
• Learning Theory
• Improved hardness results for learning intersections of halfspaces

This page was built for publication: Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions

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