3415 search results - page 163 / 683 » Lower Bounds for Kernelizations |
132
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...
141
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
Abstract. The Perceptron algorithm, despite its simplicity, often performs well in online classification tasks. The Perceptron becomes especially effective when it is used in conju...
138
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
In this paper, we consider a smoothing kernelbased classification rule and propose an algorithm for optimizing the performance of the rule by learning the bandwidth of the smoothi...
132
Voted
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
The power and popularity of kernel methods stem in part from their ability to handle diverse forms of structured inputs, including vectors, graphs and strings. Recently, several m...
158
click to vote
NIPS
2004
15 years 6 months ago
2004
The computation and memory required for kernel machines with N training samples is at least O(N2 ). Such a complexity is significant even for moderate size problems and is prohibi...