Sciweavers

2223 search results - page 286 / 445
» Implicit Online Learning
Sort
View
COLT
2010
Springer
15 years 4 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
CVPR
2011
IEEE
14 years 10 months ago
How does Person Identity Recognition Help Multi-Person Tracking?
We address the problem of multi-person tracking in a complex scene from a single camera. Although trackletassociation methods have shown impressive results in several challenging ...
Cheng-Hao Kuo, Ram Nevatia
TKDE
2012
226views Formal Methods» more  TKDE 2012»
13 years 9 months ago
DDD: A New Ensemble Approach for Dealing with Concept Drift
—Online learning algorithms often have to operate in the presence of concept drifts. A recent study revealed that different diversity levels in an ensemble of learning machines a...
Leandro L. Minku, Xin Yao
ICML
2007
IEEE
16 years 7 months ago
Exponentiated gradient algorithms for log-linear structured prediction
Conditional log-linear models are a commonly used method for structured prediction. Efficient learning of parameters in these models is therefore an important problem. This paper ...
Amir Globerson, Terry Koo, Xavier Carreras, Michae...
ICML
2008
IEEE
16 years 7 months ago
A worst-case comparison between temporal difference and residual gradient with linear function approximation
Residual gradient (RG) was proposed as an alternative to TD(0) for policy evaluation when function approximation is used, but there exists little formal analysis comparing them ex...
Lihong Li