93 search results - page 4 / 19 » Intrinsic Complexity of Uniform Learning |
138
click to vote
JMLR
2012
13 years 5 months ago
2012
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
125
Voted
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
We state and analyze the first active learning algorithm which works in the presence of arbitrary forms of noise. The algorithm, A2 (for Agnostic Active), relies only upon the ass...
146
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
149
Voted
SODA
2000
ACM
15 years 4 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
114
Voted
ALT
2001
Springer
16 years 8 days ago
2001
Springer
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...