256 search results - page 6 / 52 » On a Generalized Notion of Mistake Bounds |
22
Voted
CORR
2010
Springer
13 years 7 months ago
2010
Springer
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...
SIGIR
2002
ACM
13 years 7 months ago
2002
ACM
We describe a new family of topic-ranking algorithms for multi-labeled documents. The motivation for the algorithms stems from recent advances in online learning algorithms. The a...
NIPS
2001
13 years 9 months ago
2001
We investigate the generalization performance of some learning problems in Hilbert functional Spaces. We introduce a notion of convergence of the estimated functional predictor to...
WG
2005
Springer
14 years 29 days ago
2005
Springer
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...
NIPS
2008
13 years 9 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...