1897 search results - page 183 / 380 » Sparse Additive Machine |
125
click to vote
COLT
2001
Springer
15 years 9 months ago
2001
Springer
In this paper we derive convergence rates for Q-learning. We show an interesting relationship between the convergence rate and the learning rate used in Q-learning. For a polynomi...
139
Voted
ICML
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with assoc...
148
click to vote
COLT
1998
Springer
15 years 9 months ago
1998
Springer
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
151
click to vote
ECML
2007
Springer
15 years 9 months ago
2007
Springer
We consider the problem of ordinal classification, in which a value set of the decision attribute (output, dependent variable) is finite and ordered. This problem shares some chara...
133
Voted
ECML
2006
Springer
15 years 8 months ago
2006
Springer
Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. We approach this setting from a case-based perspective and propo...