Optimal Transport-Induced Samples against Out-of-Distribution Overconfidence
Keke Tang, Ziyong Du, Xiaofei Wang, Weilong Peng, Peican Zhu, Zhihong Tian

TL;DR
This paper introduces a novel method using optimal transport to generate semantically ambiguous OOD samples, which helps calibrate neural networks and reduce overconfidence on out-of-distribution inputs.
Contribution
The paper proposes a new OT-based framework to identify and sample near semantic boundaries, improving model calibration against OOD overconfidence.
Findings
Significantly reduces OOD overconfidence in neural networks.
Outperforms existing methods in calibration and robustness.
Provides a geometrically grounded approach to OOD detection.
Abstract
Deep neural networks (DNNs) often produce overconfident predictions on out-of-distribution (OOD) inputs, undermining their reliability in open-world environments. Singularities in semi-discrete optimal transport (OT) mark regions of semantic ambiguity, where classifiers are particularly prone to unwarranted high-confidence predictions. Motivated by this observation, we propose a principled framework to mitigate OOD overconfidence by leveraging the geometry of OT-induced singular boundaries. Specifically, we formulate an OT problem between a continuous base distribution and the latent embeddings of training data, and identify the resulting singular boundaries. By sampling near these boundaries, we construct a class of OOD inputs, termed optimal transport-induced OOD samples (OTIS), which are geometrically grounded and inherently semantically ambiguous. During training, a confidence…
Peer Reviews
Decision·ICLR 2026 Poster
- the conceptual link drawn between singularities in semidiscrete OT and semantic ambiguity is interesting. Targeting these specific regions for confidence suppression is potentially more founded than using heuristics like noise or generic outlier datasets - the method for generating OTIS is detailed and the sample creation between latent concepts should provide a more effective signal for training than random interpolations or generic augmentations (e.g. Figure 5) - strong performance in ex
- The paper heavily relies on the theory of semi-discrete OT (Brenier potential, Laguerre cells) in order to define a notion of neighborhood (i.e., adjacency cell boundaries). However, the core measure of ambiguity is simply the angle between neighbor latent vectors, which is independent of the OT framework. Hence, the paper doesn’t clearly explain/justify the additional complexity : why the OT-neighborhood concept is necessary over a much simpler and standard k-NN approach. - The primary goal
1. The writing is fine. It is not hard to understand the paper 2. The description of the OT method is clear
1. Motivation is not very clear. It is a natural idea to lower the model's confidence on boundary samples in order to lower its confidence on OOD samples. However, it is not clear to me why using the specific method proposed in this work. There seems to be a bunch of possible ways to construct the boundary samples, and the authors do not elaborate on why the specific method proposed here is more efficient. While the formulation looks reasonable, it looks quite complicated and I am not really sur
To the best of my knowledge, the motivating idea of this work is novel. By incorporating the semi-discrete OT problem into DNN training, the authors successfully capture a picture depicting the generalization of NNs. The paper is clearly written, and I find the theoretical explanation in Section 2 is accurate and easy to follow for a wider audience. Empirical results also demonstrate the effectiveness of the proposed method, with several helpful visualizations.
As shown in Tables 1 and 2, the proposed method suffers from a relatively high test error, indicating that some accuracy is sacrificed for robustness against OOD samples. Nevertheless, the proposed method still has on-par test error compared to other baselines, and the OOD robustness (measured by OOD MMC) is significant.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Generative Adversarial Networks and Image Synthesis · Advanced Neural Network Applications
