Sciweavers

1235 search results - page 14 / 247
» Learning with Idealized Kernels
Sort
View
IJCV
2007
208views more  IJCV 2007»
13 years 9 months ago
Binet-Cauchy Kernels on Dynamical Systems and its Application to the Analysis of Dynamic Scenes
We derive a family of kernels on dynamical systems by applying the Binet-Cauchy theorem to trajectories of states. Our derivation provides a unifying framework for all kernels on d...
S. V. N. Vishwanathan, Alexander J. Smola, Ren&eac...
CVPR
2009
IEEE
15 years 5 months ago
Let the Kernel Figure it Out; Principled Learning of Pre-processing for Kernel Classifiers
Most modern computer vision systems for high-level tasks, such as image classification, object recognition and segmentation, are based on learning algorithms that are able to se...
Peter V. Gehler, Sebastian Nowozin
ICML
2001
IEEE
14 years 10 months ago
General Loss Bounds for Universal Sequence Prediction
The Bayesian framework is ideally suited for induction problems. The probability of observing xt at
Marcus Hutter
IDEAL
2009
Springer
14 years 4 months ago
Supervised Feature Extraction Using Hilbert-Schmidt Norms
We propose a novel, supervised feature extraction procedure, based on an unbiased estimator of the Hilbert-Schmidt independence criterion (HSIC). The proposed procedure can be dire...
Povilas Daniusis, Pranas Vaitkus
NECO
2010
97views more  NECO 2010»
13 years 8 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell