About this paper
Untrained neural networks with fixed random nonlinear features and Mahalanobis scoring can detect anomalies competitively on tabular and visual tasks without weight optimization or pretrained representations.
Anomaly detection (AD) is often framed as a representation-learning problem, where strong performance is expected to require learned features or AD-specific optimization. However, this view can overlook the intrinsic separability of anomalies from normal references, even in the absence of learned representations. We therefore investigate how far untrained neural networks can go in anomaly detection. To this end, we propose PRISM, a framework combining fixed random nonlinear features with normal-reference Mahalanobis scoring for tabular detection and dense visual localization. Across 47 tabular datasets in ADBench, PRISM-T achieves the highest mean AUROC (86.4%) and the second-highest mean…
anomaly detectionrepresentation learninguntrained neural networksfixed random nonlinear featuresMahalanobis scoringtabular anomaly detectiondense visual localizationAUROCAUPRCneural weight optimization
- Upvotes
- 6
- Authors
- 4
- Published
- Nov 9, 2026
Summary and abstract excerpt via Hugging Face Papers ↗ · arXiv.
Trending history
How Far Can Untrained Neural Networks Go in Anomaly Detection? From Tables to Pixels was first seen on Hugging Face · Daily papers on Nov 20, 2026. Since then it has appeared in 11 checks on 1 different day. Its best position was #22 of 30, reached on Nov 20, 05:29 UTC. It dropped off the list after Nov 20, 23:29 UTC.