K^4: Online Log Anomaly Detection via Unsupervised Typicality Learning
3 barthelomew 1 7/30/2025, 8:58:39 PM arxiv.org ↗
Comments (1)
westurner · 1d ago
> Abstract: [...] (K^4) transforms arbitrary log embeddings into compact four-dimensional descriptors (Precision, Recall, Density, Coverage) using efficient k-nearest neighbor (k-NN) statistics. These descriptors enable lightweight detectors to accurately score anomalies without retraining. Using a more realistic online evaluation protocol, sets a new state-of-the-art (AUROC: 0.995-0.999), outperforming baselines by large margins while being orders of magnitude faster, with training under 4 seconds and inference as low as 4 us.