Sciweavers

388 search results - page 1 / 78
» The covering number in learning theory
Sort
View
JC
2002
49views more  JC 2002»
13 years 5 months ago
The covering number in learning theory
Ding-Xuan Zhou
BMCBI
2007
154views more  BMCBI 2007»
13 years 5 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 5 months ago
Online Learning: Random Averages, Combinatorial Parameters, and Learnability
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...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
JMLR
2002
135views more  JMLR 2002»
13 years 5 months ago
Covering Number Bounds of Certain Regularized Linear Function Classes
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
Tong Zhang
DAM
2007
84views more  DAM 2007»
13 years 5 months ago
Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
Vera Kurková, Marcello Sanguineti