Abstract
We study exact learning of halfspaces from equivalence queries. The algorithm uses an oracle RCH that returns a random consistent hypothesis to the counterexamples received from the equivalence query oracle. We use the RCH oracle to give a new polynomial time algorithm for exact learning halfspaces from majority of halfspaces and show that its query complexity is less (by some constant factor) than the best known algorithm that learns halfspaces from halfspaces. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Bshouty, N. H., & Wattad, E. (2006). On exact learning halfspaces with random consistent hypothesis oracle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4264 LNAI, pp. 48–62). Springer Verlag. https://doi.org/10.1007/11894841_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
