Sciweavers

5214 search results - page 128 / 1043
» The Online Specialization Problem
Sort
View
COLT
2005
Springer
15 years 5 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...
113
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
IJET
2006
40views more  IJET 2006»
15 years 3 months ago
An open source information system for online counseling for a Mexican university
One of the primary goals of undergraduate studies programs is to promote the professional and personal growth and success of their students. First year students, however, often suf...
Arthur Walter Edwards