1235 search results - page 187 / 247 » Learning with Idealized Kernels |
COLT
1998
Springer
14 years 2 months ago
1998
Springer
We introduce and analyze a new algorithm for linear classification which combines Rosenblatt's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like...
ECML
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat al...
NIPS
2008
13 years 11 months ago
2008
In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. These representa...
EMNLP
2006
13 years 11 months ago
2006
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
ICML
2010
IEEE
13 years 11 months ago
2010
IEEE
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumpti...