Sciweavers

3381 search results - page 478 / 677
» LEO - DB2's LEarning Optimizer
Sort
View
COLT
2003
Springer
15 years 11 months ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis
GECCO
2003
Springer
117views Optimization» more  GECCO 2003»
15 years 11 months ago
A Method for Handling Numerical Attributes in GA-Based Inductive Concept Learners
This paper proposes a method for dealing with numerical attributes in inductive concept learning systems based on genetic algorithms. The method uses constraints for restricting th...
Federico Divina, Maarten Keijzer, Elena Marchiori
ALT
2009
Springer
15 years 10 months ago
The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses
In this paper the sequential prediction problem with expert advice is considered for the case when the losses of experts suffered at each step can be unbounded. We present some mo...
Vladimir V. V'yugin
IBPRIA
2009
Springer
15 years 10 months ago
Score Fusion by Maximizing the Area under the ROC Curve
Information fusion is currently a very active research topic aimed at improving the performance of biometric systems. This paper proposes a novel method for optimizing the paramete...
Mauricio Villegas, Roberto Paredes
IPPS
1998
IEEE
15 years 10 months ago
Using the BSP Cost Model to Optimise Parallel Neural Network Training
We derive cost formulae for three di erent parallelisation techniques for training supervised networks. These formulae are parameterised by properties of the target computer archit...
R. O. Rogers, David B. Skillicorn