Sciweavers

2 search results - page 1 / 1
» Minimizing the Average Query Complexity of Learning Monotone...
Sort
View
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
13 years 9 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio