Sciweavers

230 search results - page 11 / 46
» XCS with computed prediction for the learning of Boolean fun...
Sort
View
FOCS
2002
IEEE
14 years 1 months ago
Learning Intersections and Thresholds of Halfspaces
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
14 years 13 days 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
EMMCVPR
2011
Springer
12 years 8 months ago
Optimization of Robust Loss Functions for Weakly-Labeled Image Taxonomies: An ImageNet Case Study
The recently proposed ImageNet dataset consists of several million images, each annotated with a single object category. However, these annotations may be imperfect, in the sense t...
Julian John McAuley, Arnau Ramisa, Tibério ...
NN
2006
Springer
120views Neural Networks» more  NN 2006»
13 years 8 months ago
Computational intelligence in earth sciences and environmental applications: Issues and challenges
This paper introduces a generic theoretical framework for predictive learning, and relates it to data-driven and learning applications in earth and environmental sciences. The iss...
Vladimir Cherkassky, Vladimir M. Krasnopolsky, Dim...
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
14 years 1 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler