11 search results - page 2 / 3 » A Lower Bound for Agnostically Learning Disjunctions |
COCOON
2005
Springer
13 years 11 months ago
2005
Springer
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
JCO
2010
13 years 3 months ago
2010
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
FOCS
2008
IEEE
13 years 12 months ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
NIPS
2001
13 years 6 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
JMLR
2012
11 years 8 months ago
2012
Contextual bandit learning is a reinforcement learning problem where the learner repeatedly receives a set of features (context), takes an action and receives a reward based on th...