Sciweavers

17 search results - page 3 / 4
» Online Learning with Expert Advice and Finite-Horizon Constr...
Sort
View
CORR
2010
Springer
91views Education» more  CORR 2010»
13 years 2 months ago
Switching between Hidden Markov Models using Fixed Share
In prediction with expert advice the goal is to design online prediction algorithms that achieve small regret (additional loss on the whole data) compared to a reference scheme. I...
Wouter M. Koolen, Tim van Erven
COLT
1997
Springer
13 years 11 months ago
On-line Learning and the Metrical Task System Problem
We relate two problems that have been explored in two distinct communities. The first is the problem of combining expert advice, studied extensively in the computational learning...
Avrim Blum, Carl Burch
COLT
2006
Springer
13 years 11 months ago
Online Learning with Constraints
In this paper, we study a sequential decision making problem. The objective is to maximize the total reward while satisfying constraints, which are defined at every time step. The...
Shie Mannor, John N. Tsitsiklis
COLT
2006
Springer
13 years 11 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
ICML
2007
IEEE
14 years 8 months ago
Online discovery of similarity mappings
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
Alexander Rakhlin, Jacob Abernethy, Peter L. Bartl...