83 search results - page 15 / 17 » Rademacher Chaos Complexities for Learning the Kernel Proble... |
NIPS
2003
13 years 9 months ago
2003
Nonlinear filtering can solve very complex problems, but typically involve very time consuming calculations. Here we show that for filters that are constructed as a RBF network ...
NIPS
2008
13 years 9 months ago
2008
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
TNN
2010
13 years 2 months ago
2010
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
ICCV
2009
IEEE
15 years 19 days ago
2009
IEEE
Many machine learning algorithms require the summation of Gaussian kernel
functions, an expensive operation if implemented straightforwardly. Several methods
have been proposed t...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...