701 search results - page 39 / 141 » Self Bounding Learning Algorithms |
STACS
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
COLT
2004
Springer
14 years 1 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...
NIPS
2004
13 years 11 months ago
2004
We establish a mistake bound for an ensemble method for classification based on maximizing the entropy of voting weights subject to margin constraints. The bound is the same as a ...
GECCO
2005
Springer
14 years 3 months ago
2005
Springer
This article describes a mathematical framework for characterizing cooperativity in complex systems subject to evolutionary pressures. This framework uses three foundational compo...
JMLR
2002
13 years 9 months ago
2002
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...