Sciweavers

341 search results - page 31 / 69
» Learning to satisfy
Sort
View
MCS
2005
Springer
14 years 1 months ago
Ensemble Confidence Estimates Posterior Probability
We have previously introduced the Learn++ algorithm that provides surprisingly promising performance for incremental learning as well as data fusion applications. In this contribut...
Michael Muhlbaier, Apostolos Topalis, Robi Polikar
COLT
2006
Springer
13 years 11 months ago
Optimal Oracle Inequality for Aggregation of Classifiers Under Low Noise Condition
We consider the problem of optimality, in a minimax sense, and adaptivity to the margin and to regularity in binary classification. We prove an oracle inequality, under the margin ...
Guillaume Lecué
ALT
2010
Springer
13 years 9 months ago
Consistency of Feature Markov Processes
We are studying long term sequence prediction (forecasting). We approach this by investigating criteria for choosing a compact useful state representation. The state is supposed t...
Peter Sunehag, Marcus Hutter
EOR
2008
140views more  EOR 2008»
13 years 7 months ago
Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization
The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. In this paper, we describe an Ant Colony Optimization (ACO) algor...
Christine Solnon
STOC
2003
ACM
154views Algorithms» more  STOC 2003»
14 years 7 months ago
Boosting in the presence of noise
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
Adam Kalai, Rocco A. Servedio