The reviewed record of science sign in
Pith

arxiv: 2502.18002 · v2 · pith:YGGAB32I · submitted 2025-02-25 · cs.LG · cs.AI

A Radon-Nikod\'ym Perspective on Anomaly Detection: Theory and Implications

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:YGGAB32Irecord.jsonopen to challenge →

classification cs.LG cs.AI
keywords radon-nikodanomalyderivativedetectiondatasetslosstakescase
0
0 comments X
read the original abstract

Which principle underpins the design of an effective anomaly detection loss function? The answer lies in the concept of Radon-Nikod\'ym theorem, a fundamental concept in measure theory. The key insight from this article is: Multiplying the vanilla loss function with the Radon-Nikod\'ym derivative improves the performance across the board. We refer to this as RN-Loss. We prove this using the setting of PAC (Probably Approximately Correct) learnability. Depending on the context a Radon-Nikod\'ym derivative takes different forms. In the simplest case of supervised anomaly detection, Radon-Nikod\'ym derivative takes the form of a simple weighted loss. In the case of unsupervised anomaly detection (with distributional assumptions), Radon-Nikod\'ym derivative takes the form of the popular cluster based local outlier factor. We evaluate our algorithm on 96 datasets, including univariate and multivariate data from diverse domains, including healthcare, cybersecurity, and finance. We show that RN-Derivative algorithms outperform state-of-the-art methods on 68% of Multivariate datasets (based on F1 scores) and also achieves peak F1-scores on 72% of time series (Univariate) datasets.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.