arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.09082cs.LGstat.ML
收藏

Confidence Dimension for Deep Learning based on Hoeffding Inequality and Relative Evaluation

Beihang University(北京航空航天大学);University of Bonn(波恩大学);Amazon(亚马逊);University at Buffalo(布法罗大学);Baidu(百度)

Runqi Wang, Linlin Yang, Baochang Zhang, Wentao Zhu, David Doermann, Guodong Guo

英文摘要:

Research on the generalization ability of deep neural networks (DNNs) has recently attracted a great deal of attention. However, due to their complex architectures and large numbers of parameters, measuring the generalization ability of specific DNN models remains an open challenge. In this paper, we propose to use multiple factors to measure and rank the relative generalization of DNNs based on a new concept of confidence dimension (CD). Furthermore, we provide a feasible framework in our CD to theoretically calculate the upper bound of generalization based on the conventional Vapnik-Chervonenk dimension (VC-dimension) and Hoeffding's inequality. Experimental results on image classification and object detection demonstrate that our CD can reflect the relative generalization ability for different DNNs. In addition to full-precision DNNs, we also analyze the generalization ability of binary neural networks (BNNs), whose generalization ability remains an unsolved problem. Our CD yields a consistent and reliable measure and ranking for both full-precision DNNs and BNNs on all the tasks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑