Sciweavers

2 search results - page 1 / 1
» Baum's Algorithm Learns Intersections of Halfspaces with Res...
Sort
View
APPROX
2009
Springer
129views Algorithms» more  APPROX 2009»
13 years 10 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
COLT
1995
Springer
13 years 7 months ago
Learning with Unreliable Boundary Queries
We introduce a new model for learning with membership queries in which queries near the boundary of a target concept may receive incorrect or “don’t care” responses. In part...
Avrim Blum, Prasad Chalasani, Sally A. Goldman, Do...