5 search results - page 1 / 1 » Competing in the Dark: An Efficient Algorithm for Bandit Lin... |
76
Voted
COLT
2008
Springer
14 years 11 months ago
2008
Springer
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
80
Voted
STOC
2007
ACM
15 years 9 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
98
Voted
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
TNN
2008
14 years 9 months ago
2008
Blind inversion of a linear and instantaneous mixture of source signals is a problem often encountered in many signal processing applications. Efficient FastICA (EFICA) offers an ...
CVPR
2010
IEEE
15 years 26 days ago
2010
IEEE
In a sparse-representation-based face recognition scheme, the desired dictionary should have good representational power (i.e., being able to span the subspace of all faces) while...