716 search results - page 111 / 144 » Optimizing Sorting with Machine Learning Algorithms |
162
click to vote
ALT
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
127
click to vote
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
127
click to vote
COLT
2010
Springer
14 years 12 months ago
2010
Springer
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
133
click to vote
COLT
2010
Springer
14 years 12 months ago
2010
Springer
We consider the problem of finding the best arm in a stochastic multi-armed bandit game. The regret of a forecaster is here defined by the gap between the mean reward of the optim...
224
click to vote
ALT
2011
Springer
14 years 1 months ago
2011
Springer
Deep architectures are families of functions corresponding to deep circuits. Deep Learning algorithms are based on parametrizing such circuits and tuning their parameters so as to ...