1822 search results - page 121 / 365 » Risk-Sensitive Online Learning |
134
Voted
COLT
1991
Springer
15 years 7 months ago
1991
Springer
While most theoretical work in machine learning has focused on the complexity of learning, recently there has been increasing interest in formally studying the complexity of teach...
142
Voted
SOFSEM
2010
Springer
16 years 18 days ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
131
Voted
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
133
Voted
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
We treat tracking as a matching problem of detected keypoints between successive frames. The novelty of this paper is to learn classifier-based keypoint descriptions allowing to i...
140
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Identifying similar keywords, known as broad matches, is an important task in online advertising that has become a standard feature on all major keyword advertising platforms. Eff...