159 search results - page 3 / 32 » Geometric Bounds for Generalization in Boosting |
ALT
2010
Springer
13 years 6 months ago
2010
Springer
Stability has been explored to study the performance of learning algorithms in recent years and it has been shown that stability is sufficient for generalization and is sufficient ...
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
STOC
1995
ACM
13 years 8 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...