Sciweavers

11 search results - page 2 / 3
» An Asymptotically Optimal Algorithm for the Max k-Armed Band...
Sort
View
ALT
2008
Springer
14 years 2 months ago
Active Learning in Multi-armed Bandits
In this paper we consider the problem of actively learning the mean values of distributions associated with a finite number of options (arms). The algorithms can select which opti...
András Antos, Varun Grover, Csaba Szepesv&a...
ALT
2005
Springer
14 years 2 months ago
Defensive Universal Learning with Experts
This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedba...
Jan Poland, Marcus Hutter
GECCO
2004
Springer
100views Optimization» more  GECCO 2004»
13 years 10 months ago
Analysis of the (1+1) EA for a Noisy OneMax
Abstract. In practical applications evaluating a fitness function is frequently subject to noise, i. e., the “true fitness” is disturbed by some random variations. Evolutiona...
Stefan Droste
FOCS
2004
IEEE
13 years 9 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
13 years 10 months ago
Toward comparison-based adaptive operator selection
Adaptive Operator Selection (AOS) turns the impacts of the applications of variation operators into Operator Selection through a Credit Assignment mechanism. However, most Credit ...
Álvaro Fialho, Marc Schoenauer, Michè...