Cover-based combinatorial bounds on probability of overfitting |
| |
| Authors: | A I Frey I O Tolstikhin |
| |
| Institution: | 1. Moscow Institute of Physics and Technology (State University), Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700, Russia
2. Dorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119333, Russia
|
| |
| Abstract: | The paper improves existing combinatorial bounds on probability of overfitting. A new bound is based on partitioning of a set of classifiers into non-overlapping clusters, and then embedding each cluster into a superset with known exact formula for the probability of overfitting. Such approach makes the bound sharper because it accounts for similarities between classifiers within each cluster. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
