Sciweavers

3016 search results - page 128 / 604
» The Online Transportation Problem
Sort
View
IBPRIA
2007
Springer
15 years 7 months ago
On-Line Classification of Human Activities
In this paper we address the problem of on-line recognition of human activities taking place in a public area such as a shopping center. We consider standard activities; namely, en...
Jacinto C. Nascimento, Mário A. T. Figueire...
COLT
2005
Springer
15 years 6 months ago
Loss Bounds for Online Category Ranking
Category ranking is the task of ordering labels with respect to their relevance to an input instance. In this paper we describe and analyze several algorithms for online category r...
Koby Crammer, Yoram Singer
COLT
2008
Springer
15 years 5 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
NIPS
2003
15 years 5 months ago
Online Passive-Aggressive Algorithms
We present a family of margin based online learning algorithms for various prediction tasks. In particular we derive and analyze algorithms for binary and multiclass categorizatio...
Shai Shalev-Shwartz, Koby Crammer, Ofer Dekel, Yor...
115
Voted
CORR
2010
Springer
165views Education» more  CORR 2010»
15 years 4 months ago
Online Learning: Beyond Regret
We study online learnability of a wide class of problems, extending the results of [26] to general notions of performance measure well beyond external regret. Our framework simult...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari