Name
Abstract | ||
|---|---|---|
We introduce a broad learning model formed by cascades of predictors, Deep Cascades, that is structured as general decision trees in which leaf predictors or node questions may be members of rich function families. We present new data-dependent theoretical guarantees for learning with Deep Cascades with complex leaf predictors and node questions in terms of the Rademacher complexities of the sub-families composing these sets of predictors and the fraction of sample points reaching each leaf that are correctly classified. These guarantees can guide the design of a variety of different algorithms for deep cascade models and we give a detailed description of two such algorithms. Our second algorithm uses as node and leaf classifiers SVM predictors and we report the results of experiments comparing its performance with that of SVM combined with polynomial kernels. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-24486-0_17 | ALT |
Keywords | Field | DocType |
Decision trees, Learning theory, Supervised learning | Decision tree,Polynomial,Learning theory,Computer science,Support vector machine,Supervised learning,Artificial intelligence,Cascade,Machine learning | Conference |
Volume | ISSN | Citations |
9355 | 0302-9743 | 4 |
PageRank | References | Authors |
0.44 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Giulia DeSalvo | 1 | 73 | 6.45 |
| Mehryar Mohri | 2 | 4502 | 448.21 |
| Umar Syed | 3 | 259 | 18.34 |