Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published July 2020 | Submitted + Published + Supplemental Material
Journal Article Open

Angular Visual Hardness

Abstract

Recent convolutional neural networks (CNNs) have led to impressive performance but often suffer from poor calibration. They tend to be overconfident, with the model confidence not always reflecting the underlying true ambiguity and hardness. In this paper, we propose angular visual hardness (AVH), a score given by the normalized angular distance between the sample feature embedding and the target classifier to measure sample hardness. We validate this score with an in-depth and extensive scientific study, and observe that CNN models with the highest accuracy also have the best AVH scores. This agrees with an earlier finding that state-of-art models improve on the classification of harder examples. We observe that the training dynamics of AVH is vastly different compared to the training loss. Specifically, AVH quickly reaches a plateau for all samples even though the training loss keeps improving. This suggests the need for designing better loss functions that can target harder examples more effectively. We also find that AVH has a statistically significant correlation with human visual hardness. Finally, we demonstrate the benefit of AVH to a variety of applications such as self-training for domain adaptation and domain generalization.

Additional Information

© 2020 by the author(s). Work done during internship at NVIDIA. We would like to thank Shiyu Liang, Yue Zhu and Yang Zou for the valuable discussions that enlighten our research. We are also grateful to the anonymous reviewers for their constructive comments that significantly helped to improve our paper. Weiyang Liu is partially supported by Baidu scholarship and NVIDIA GPU grant. This work was supported by NSF-1652131, NSF-BIGDATA 1838177, AFOSR-YIPFA9550-18-1-0152, Amazon Research Award, and ONR BRC grant for Randomized Numerical Linear Algebra.

Attached Files

Published - chen20n.pdf

Submitted - 1912.02279.pdf

Supplemental Material - chen20n-supp.pdf

Files

chen20n-supp.pdf
Files (17.4 MB)
Name Size Download all
md5:5ccd63198daf470fecb67f0cb70beeda
4.0 MB Preview Download
md5:0776d5a4eac53dec6d7385ffa6be8e8a
7.3 MB Preview Download
md5:004bcef5d5b751cb87c58ed43b5639e6
6.1 MB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 18, 2023