Great Models Think Alike: Improving Model Reliability via Inter-Model Latent Agreement

Ailin Deng, Miao Xiong, Bryan Hooi
5/2/2023
cs.LGcs.AIcs.CV

No confident code implementation found for this paper.

Abstract

Reliable application of machine learning is of primary importance to the practical deployment of deep learning methods. A fundamental challenge is that models are often unreliable due to overconfidence. In this paper, we estimate a model's reliability by measuring \emph{the agreement between its latent space, and the latent space of a foundation model}. However, it is challenging to measure the agreement between two different latent spaces due to their incoherence, \eg, arbitrary rotations and different dimensionality. To overcome this incoherence issue, we design a \emph{neighborhood agreement measure} between latent spaces and find that this agreement is surprisingly well-correlated with the reliability of a model's predictions. Further, we show that fusing neighborhood agreement into a model's predictive confidence in a post-hoc way significantly improves its reliability. Theoretical analysis and extensive experiments on failure detection across various datasets verify the effectiveness of our method on both in-distribution and out-of-distribution settings.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{deng2023great,
  title  = {Great Models Think Alike: Improving Model Reliability via Inter-Model Latent Agreement},
  author = {Ailin Deng and Miao Xiong and Bryan Hooi},
  year   = {2023},
  eprint = {2305.01481},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.01481v1},
  journal = {ICML 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.01481.svg)](https://codeofpaper.com/paper/2305.01481)

Discussion