arXiv:2607. 12094v1 Announce Type: cross Abstract: Reliable detection of out-of-distribution (OOD) samples is crucial for the safe deployment of machine learning models.
By Ayush Karmacharya (Purdue University), Luke Luschwitz (Purdue University), Lucia Romero (Purdue University), Yanan Niu (EPFL), Joseph Campbell (Purdue University)
The paper introduces PLUS, a detector‑agnostic subspace signal that enhances near‑out‑of‑distribution (near‑OOD) detection. PLUS selects the most class‑active neurons via a sparse autoencoder, orthonormalizes their decoder directions to form a low‑dimensional subspace, and scores inputs using a per‑class whitened squared Mahalanobis distance within that subspace. The resulting signal is fused additively with any calibrated base score using a single global weight, improving near‑OOD AUROC across 126 detector–backbone combinations while largely preserving far‑OOD performance.
By Wonseok Shin, Songkuk Kim
Post-hoc out-of-distribution (OOD) detection is mature on far-OOD yet remains weak on near-OOD. These two settings differ in their use of class-characteristic feature directions: far-OOD inputs largel...
arXiv:2606. 17352v1 Announce Type: new Abstract: We introduce MM++ (Multilayer Mahalanobis++), a fully unsupervised, strictly post-hoc, and scale-invariant framework for Out-of-Distribution (OOD) detection.
By Rahim Hossain, Md Tawheedul Islam Bhuian, Md Farhan Shadiq, Kyoung-Don Kang
arXiv:2503. 05169v2 Announce Type: replace Abstract: Applying machine learning to increasingly high-dimensional problems with sparse or biased training data increases the risk that a model is used on inputs outside its training domain.
By Felix Krumbiegel, Juniper Tyree, Michael Boy, Petri Clusius, Andreas Rupp
The paper presents a tight generalization bound for deterministic neural networks that relies on the quality of their last hidden layer representations rather than traditional parameter-space metrics. By using a parameter‑free k‑nearest‑neighbor classifier to assess representation quality, the bound decomposes into three measurable components—local class geometry, decoder‑network agreement, and training stability—providing both a non‑vacuous certificate and a diagnostic tool for understanding generalization. Experiments show the bound achieves an 8.0‑percentage‑point gap to test error on CIFAR‑10 with ResNet‑18, yields the first non‑vacuous certificates on CIFAR‑100, and certifies 1.4 % on CIFAR‑10 and 23.1 % on 1,000‑class ImageNet using frozen DINOv2 representations.
By Niclas G\"oring, Shuofeng Zhang, Branton DeMoss, Ard A. Louis