1414 search results - page 151 / 283 » Randomness and Universal Machines |
144
Voted
COLT
2001
Springer
15 years 5 months ago
2001
Springer
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...
102
click to vote
ICML
2000
IEEE
15 years 5 months ago
2000
IEEE
This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with assoc...
95
Voted
COLT
2000
Springer
15 years 5 months ago
2000
Springer
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
136
click to vote
COLT
1998
Springer
15 years 5 months ago
1998
Springer
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...
111
Voted
COLT
2004
Springer
15 years 4 months ago
2004
Springer
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...