Sciweavers

148 search results - page 23 / 30
» Bounds for Linear Multi-Task Learning
Sort
View
NIPS
2001
13 years 9 months ago
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
Roni Khardon, Dan Roth, Rocco A. Servedio
COLT
2010
Springer
13 years 5 months ago
Convex Games in Banach Spaces
We study the regret of an online learner playing a multi-round game in a Banach space B against an adversary that plays a convex function at each round. We characterize the minima...
Karthik Sridharan, Ambuj Tewari
ATAL
2008
Springer
13 years 9 months ago
A new perspective to the keepaway soccer: the takers
Keepaway is a sub-problem of RoboCup Soccer Simulator in which 'the keepers' try to maintain the possession of the ball, while 'the takers' try to steal the ba...
Atil Iscen, Umut Erogul
CORR
2010
Springer
70views Education» more  CORR 2010»
13 years 7 months ago
Structured sparsity-inducing norms through submodular functions
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
Francis Bach
PRL
2008
133views more  PRL 2008»
13 years 7 months ago
Better multiclass classification via a margin-optimized single binary problem
We develop a new multiclass classification method that reduces the multiclass problem to a single binary classifier (SBC). Our method constructs the binary problem by embedding sm...
Ran El-Yaniv, Dmitry Pechyony, Elad Yom-Tov