Sciweavers

APPROX
2009
Springer
129views Algorithms» more  APPROX 2009»
14 years 6 months ago
Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions
In 1990, E. Baum gave an elegant polynomial-time algorithm for learning the intersection of two origin-centered halfspaces with respect to any symmetric distribution (i.e., any D s...
Adam R. Klivans, Philip M. Long, Alex K. Tang