1062 search results - page 158 / 213 » Sublinear Optimization for Machine Learning |
138
click to vote
COLT
2004
Springer
15 years 10 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
126
click to vote
COLT
2005
Springer
15 years 10 months ago
2005
Springer
We examine a Markovian model for the price evolution of a stock, in which the probability of local upward or downward movement is arbitrarily dependent on the current price itself...
113
Voted
ECML
2004
Springer
15 years 10 months ago
2004
Springer
This report contains derivations which did not fit into the paper [3]. Associative clustering (AC) is a method for separately clustering two data sets when one-to-one association...
131
click to vote
IBPRIA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. By applying recent results in optimization transfer, a new algorithm for kernel Fisher Discriminant Analysis is provided that makes use of a non-smooth penalty on the coe...
163
click to vote
COLT
2003
Springer
15 years 10 months ago
2003
Springer
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...