Combining Statistical Depth and Fermat Distance for Uncertainty Quantification
We measure the Out-of-domain uncertainty in the prediction of Neural Networks using a statistical notion called `Lens Depth'' (LD) combined with Fermat Distance, which is able to capture precisely the `depth'' of a point with respect to a distribution in feature space, without any assumption about the form of distribution. Our method has no trainable parameter. The method is applicable to any classification model as it is applied directly in feature space at test time and does not intervene in training process. As such, it does not impact the performance of the original model. The proposed method gives excellent qualitative result on toy datasets and can give competitive or better uncertainty estimation on standard deep learning datasets compared to strong baseline methods.
Code (0)
등록된 구현이 없습니다.
Tasks
Uncertainty QuantificationSimilar Papers 제목 키워드 기반
Fermat Distances: Metric Approximation, Spectral Convergence, and Clustering Algorithms
We analyze the convergence properties of Fermat distances, a family of density-driven metrics defined on Riemannian manifolds with an associated probability measure. Fermat distances may be defined either on discrete sam…
ClusteringChoosing the parameter of the Fermat distance: navigating geometry and noise
The Fermat distance has been recently established as a useful tool for machine learning tasks when a natural distance is not directly available to the practitioner or to improve the results given by Euclidean distances b…
NavigateHigh-dimensional Semi-supervised Classification via the Fermat Distance
Semi-supervised classification, where unlabeled data are massive but labeled data are limited, often arises in machine learning applications. We address this challenge under high-dimensional data by leveraging the manifo…
Bearing-Only Solution for Fermat-Weber Location Problem: Generalized Algorithms
This paper presents novel algorithms for the Fermat-Weber Location Problem, guiding an autonomous agent to the point that minimizes the weighted sum of Euclidean distances to some beacons using only bearing measurements.…
Learning Distances from Data with Normalizing Flows and Score Matching
Density-based distances (DBDs) offer an elegant solution to the problem of metric learning. By defining a Riemannian metric which increases with decreasing probability density, shortest paths naturally follow the data ma…
Density EstimationMetric Learning