Sciweavers

1062 search results - page 158 / 213
» Sublinear Optimization for Machine Learning
Sort
View
COLT
2004
Springer
14 years 2 months ago
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
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...
H. Brendan McMahan, Avrim Blum
COLT
2005
Springer
14 years 2 months ago
Trading in Markovian Price Models
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...
Sham M. Kakade, Michael J. Kearns
ECML
2004
Springer
14 years 2 months ago
Associative Clustering
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...
Janne Sinkkonen, Janne Nikkilä, Leo Lahti, Sa...
IBPRIA
2007
Springer
14 years 3 months ago
Parsimonious Kernel Fisher Discrimination
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...
Kitsuchart Pasupa, Robert F. Harrison, Peter Wille...
COLT
2003
Springer
14 years 2 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