Sciweavers

3050 search results - page 208 / 610
» On-line Algorithms in Machine Learning
Sort
View
ALT
2009
Springer
15 years 9 months ago
The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses
In this paper the sequential prediction problem with expert advice is considered for the case when the losses of experts suffered at each step can be unbounded. We present some mo...
Vladimir V. V'yugin
ICML
2008
IEEE
16 years 5 months ago
Training SVM with indefinite kernels
Similarity matrices generated from many applications may not be positive semidefinite, and hence can't fit into the kernel machine framework. In this paper, we study the prob...
Jianhui Chen, Jieping Ye
NLP
2000
15 years 7 months ago
Enhancing Preference-Based Anaphora Resolution with Genetic Algorithms
Abstract. The paper argues that a promising way to improve the success rate of preference-based anaphora resolution algorithms is the use of machine learning. The paper outlines MA...
Constantin Orasan, Richard Evans, Ruslan Mitkov
ICML
2006
IEEE
16 years 5 months ago
Experience-efficient learning in associative bandit problems
We formalize the associative bandit problem framework introduced by Kaelbling as a learning-theory problem. The learning environment is modeled as a k-armed bandit where arm payof...
Alexander L. Strehl, Chris Mesterharm, Michael L. ...
ICML
2005
IEEE
16 years 5 months ago
Relating reinforcement learning performance to classification performance
We prove a quantitative connection between the expected sum of rewards of a policy and binary classification performance on created subproblems. This connection holds without any ...
John Langford, Bianca Zadrozny