Sciweavers

683 search results - page 20 / 137
» Generalization Bounds for Learning Kernels
Sort
View
JMLR
2008
131views more  JMLR 2008»
13 years 7 months ago
On Relevant Dimensions in Kernel Feature Spaces
We show that the relevant information of a supervised learning problem is contained up to negligible error in a finite number of leading kernel PCA components if the kernel matche...
Mikio L. Braun, Joachim M. Buhmann, Klaus-Robert M...
CORR
2010
Springer
47views Education» more  CORR 2010»
13 years 7 months ago
Robustness and Generalization
We derive generalization bounds for learning algorithms based on their robustness: the property that if a testing sample is "similar" to a training sample, then the test...
Huan Xu, Shie Mannor
ICML
2004
IEEE
14 years 8 months ago
Bayesian inference for transductive learning of kernel matrix using the Tanner-Wong data augmentation algorithm
In kernel methods, an interesting recent development seeks to learn a good kernel from empirical data automatically. In this paper, by regarding the transductive learning of the k...
Zhihua Zhang, Dit-Yan Yeung, James T. Kwok
UAI
2008
13 years 8 months ago
Small Sample Inference for Generalization Error in Classification Using the CUD Bound
Confidence measures for the generalization error are crucial when small training samples are used to construct classifiers. A common approach is to estimate the generalization err...
Eric Laber, Susan Murphy
JMLR
2010
119views more  JMLR 2010»
13 years 2 months ago
Semi-Supervised Learning via Generalized Maximum Entropy
Various supervised inference methods can be analyzed as convex duals of the generalized maximum entropy (MaxEnt) framework. Generalized MaxEnt aims to find a distribution that max...
Ayse Erkan, Yasemin Altun