Sciweavers

23 search results - page 5 / 5
» Oblivious Polynomial Evaluation and Oblivious Neural Learnin...
Sort
View
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 5 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
IJCNN
2006
IEEE
13 years 11 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
13 years 12 months ago
A study on metamodeling techniques, ensembles, and multi-surrogates in evolutionary computation
Surrogate-Assisted Memetic Algorithm(SAMA) is a hybrid evolutionary algorithm, particularly a memetic algorithm that employs surrogate models in the optimization search. Since mos...
Dudy Lim, Yew-Soon Ong, Yaochu Jin, Bernhard Sendh...