701 search results - page 86 / 141 » Self Bounding Learning Algorithms |
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
Recent theoretical results have shown that improved bounds on generalization error of classifiers can be obtained by explicitly taking the observed margin distribution of the trai...
SIAMJO
2010
13 years 2 months ago
2010
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different for...