mlsanityData to 14 Oct 2026

Learning to Predict Trustworthiness with Steep Slope Loss

arXiv 2110.00054 ↗First posted 30 Sep 2021cs.CVcited by 11

Not on the map. Why?

Abstract (arXiv)

Understanding the trustworthiness of a prediction yielded by a classifier is critical for the safe and effective use of AI models. Prior efforts have been proven to be reliable on small-scale datasets. In this work, we study the problem of predicting trustworthiness on real-world large-scale datasets, where the task is more challenging due to high-dimensional features, diverse visual concepts, and large-scale samples. In such a setting, we observe that the trustworthiness predictors trained with prior-art loss functions, i.e., the cross entropy loss, focal loss, and true class probability confidence loss, are prone to view both correct predictions and incorrect predictions to be trustworthy. The reasons are two-fold. Firstly, correct predictions are generally dominant over incorrect predictions. Secondly, due to the data complexity, it is challenging to differentiate the incorrect predictions from the correct ones on real-world large-scale datasets. To improve the generalizability of trustworthiness predictors, we propose a novel steep slope loss to separate the features w.r.t. correct predictions from the ones w.r.t. incorrect predictions by two slide-like curves that oppose each other. The proposed loss is evaluated with two representative deep learning models, i.e., Vision Transformer and ResNet, as trustworthiness predictors. We conduct comprehensive experiments and analyses on ImageNet, which show that the proposed loss effectively improves the generalizability of trustworthiness predictors. The code and pre-trained trustworthiness predictors for reproducibility are available at https://github.com/luoyan407/predict_trustworthiness.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 22 of its 43 references that are in the map. First posted on arXiv 30 Sep 2021.

Builds on

22 of 43 references.

References · 22

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  4. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  5. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,442
  6. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
  7. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
  8. 2016A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networkscited by 2,385
  9. 2018ImageNet-trained CNNs are biased towards texture; increasing shape bias improves accuracy and robustnesscited by 1,432
  10. 2019Class-Balanced Loss Based on Effective Number of Samplescited by 1,245
  11. 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 989
  12. 2017Selective Classification for Deep Neural Networkscited by 852
10 more
  1. 2014Deep Neural Networks are Easily Fooled: High Confidence Predictions for Unrecognizable Imagescited by 776
  2. 2016Large-Margin Softmax Loss for Convolutional Neural Networkscited by 296
  3. 2018To Trust Or Not To Trust A Classifiercited by 207
  4. 2019Addressing Failure Prediction by Learning Model Confidencecited by 186
  5. 2020M2m: Imbalanced Classification via Major-to-minor Translationcited by 134
  6. 2020Confidence-Aware Learning for Deep Neural Networkscited by 113
  7. 2019Dynamic Curriculum Learning for Imbalanced Data Classificationcited by 93
  8. 2019Functional Adversarial Attackscited by 82
  9. 2020Metric-Free Individual Fairness in Online Learningcited by 30
  10. 2019G-softmax: Improving Intra-class Compactness and Inter-class Separability of Featurescited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 2; 2024: 5; 2025: 0; 2026: 3.

11 papers.