234 search results - page 4 / 47 » Rademacher Margin Complexity |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
JMLR
2010
13 years 5 months ago
2010
Leading classification methods such as support vector machines (SVMs) and their counterparts achieve strong generalization performance by maximizing the margin of separation betw...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study online learnability of a wide class of problems, extending the results of [26] to general notions of performance measure well beyond external regret. Our framework simult...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
—Univariate Marginal Distribution Algorithms (UMDAs) are a kind of Estimation of Distribution Algorithms (EDAs) which do not consider the dependencies among the variables. In thi...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
This paper examines the problem of learning with a finite and possibly large set of p base kernels. It presents a theoretical and empirical analysis of an approach addressing thi...