Hugging Face Trending Papers

Don't Replace, Complement: A Detector-Agnostic Subspace Signal for Near-OOD Detection

arXiv AI
1d ago

Don't Replace, Complement: A Detector-Agnostic Subspace Signal for Near-OOD Detection

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
arXiv AI
6d ago

MahaVar: OOD Detection via Class-wise Mahalanobis Distance Variance under Neural Collapse

MahaVar is a post‑hoc out‑of‑distribution detector that augments the Mahalanobis distance with a class‑wise distance variance term. The authors observe that in‑distribution samples exhibit a sharp minimum in class‑wise Mahalanobis distances, leading to high variance across classes, whereas OOD samples show a flatter structure and lower variance. Theoretical analysis based on Neural Collapse supports this observation, and empirical results on CIFAR‑100 and ImageNet demonstrate state‑of‑the‑art performance compared to existing Mahalanobis‑based methods.

By Donghwan Kim, Hyunsoo Yoon
arXiv Computer Vision
Sep 18

Distance to Class Prototypes: Active Learning for Object Detection

The paper introduces a new active learning signal for object detection that relies on a supervised contrastive term added to the training objective. This term shapes an embedding space where distance reflects class membership, allowing an unlabeled detection to be scored by its distance from the predicted category’s region weighted by confidence—all from a single forward pass of one network. Experiments on PASCAL VOC and MS‑COCO show that this criterion outperforms the standard posterior and remains competitive with ensemble‑based methods while incurring only a modest 8.3% increase in parameters.

By Licheng Zhang, Zheng Gong
arXiv Machine Learning
Oct 5

Mitigating Convergence Collapse in Fixed-Target Anomaly Detectors via Kernel-Anchored Locality Regularization

The paper studies a class of tabular anomaly detectors that train a neural map toward a fixed target using squared‑error loss, noting that improved optimization can paradoxically worsen detection performance—a phenomenon termed convergence collapse. It demonstrates that this collapse arises because the learned map extrapolates beyond the training data, erasing residual signals on anomalies. To address this, the authors introduce Kernel Contraction Matching (KCM), a closed‑form, training‑free kernel‑based baseline, and propose the Kernel‑Anchored Regularizer (KAR), which penalizes deviations from a kernel‑weighted average of training targets, thereby mitigating collapse and improving AUROC during extended training.

By Jos\'e Lucas De Melo Costa, Fabrice Popineau, Arpad Rimmel, Bich-Li\^en Doan
arXiv Computer Vision
Oct 2

Dataset Identity, Not Novelty: The Source of an Inflated OOD Detection Gain

The paper investigates why post‑hoc out‑of‑distribution (OOD) detectors often report inflated gains. It shows that many detectors learn to recognize the specific dataset they were trained on rather than true novelty, a phenomenon called the inflation gap. By holding out entire OOD datasets during evaluation, the authors demonstrate that most reported gains vanish, and they provide a closed‑form method to predict which fits will inflate.

By Donghoon Lee, Shinjin Kang
arXiv AI
6d ago

PairCLIP-SWA: Similarity-Guided Balancing and Stochastic Weight Averaging for Generalized Deepfake Image Detection with OpenCLIP

PairCLIP‑SWA is a single‑backbone deepfake detector that fine‑tunes an OpenCLIP ViT‑L/14 visual tower using a class‑balanced corpus created by CLIP‑similarity‑guided subsampling and then applies stochastic weight averaging over the fine‑tuning trajectory. Trained on the IEEE SP Cup 2025 (DF‑Wild‑Cup) benchmark, the weight‑averaged model achieves 97.04 % accuracy, 98.64 % AU‑ROC and a 4.07 % equal error rate—outperforming the best published three‑backbone ensemble. The study shows that averaging stabilizes validation performance, prevents misranking on disjoint test sets, and that CLIP pre‑training, rather than ensembling, is the key driver of accuracy.

By Md. Nakib, Sudipto Sarkar, A. J. A. Jubayer Talukder, Mohammad Ariful Haque