arXiv AI
Text-ADBench: Text Anomaly Detection Benchmark Based on LLM Embeddings
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv Machine Learning
Sep 10
SIM: Subspace Interaction-based Method for Token-Level Text Anomaly Detection
arXiv:2609.08200v1 Announce Type: new Abstract: Token-level text anomaly detection, as an emerging trend of text anomaly detection, moves beyond coarse-grained document-level detection by localizing...
arXiv Machine Learning
Sep 22
DiFA: Dual Evidence Fusion and Aggregation for Token-Level Text Anomaly Detection
arXiv:2609.22136v1 Announce Type: cross Abstract: Text anomaly detection, the task of identifying text instances that deviate from normal language patterns, is crucial for language-driven application...
arXiv AI
Jul 24
Interpretable Embeddings with Sparse Autoencoders: A Data Analysis Toolkit
arXiv:2512. 10092v2 Announce Type: replace Abstract: Analyzing large-scale text corpora is a core challenge in machine learning, crucial for tasks like identifying undesirable model behaviors or biases in training data.
arXiv AI
Sep 24
Comparative Evaluation of Static Embedding Models for HTTP Request Anomaly Detection
The paper benchmarks static embedding models—Word2Vec, FastText, and Doc2Vec—for detecting anomalous HTTP requests using a single‑class classification framework. It introduces HEDA, a modular pipeline that trains both embeddings and detectors solely on benign traffic in an unsupervised setting. Experiments on synthetic and real datasets show that FastText embeddings consistently yield high detection rates with controlled false positives.
arXiv Machine Learning
Sep 7
GLASS: Graph-Language Alignment with Spherical Scoring for Transferable Graph-Level Anomaly Detection
GLASS is a graph‑level anomaly detection framework that aligns graph and language representations on a unit hypersphere to achieve cross‑domain transferability. It constructs a Graph Descriptor Prompt to encode local, global, and semantic graph properties, and uses a multi‑slice soft cosine objective to unify graph and text embeddings. Anomaly scoring is performed via spherical density estimation with von Mises‑Fisher kernels, enabling zero‑shot detection and few‑shot adaptation across twelve benchmarks and three meta‑domains, outperforming recent GLAD baselines.
arXiv Machine Learning
Sep 23
Can We Predict Anomaly Detection Performance from Embedding-Space Geometry?
The paper investigates whether the performance of anomaly detection systems can be predicted without labeled anomalies. For kNN-based detectors, it derives a lower bound on AUC that links detection performance to the separation and variance of inlier and outlier scores, and uses this to analyze how density variation, intrinsic dimensionality, and domain mismatch affect score variability. The authors introduce pseudo‑anomaly probes that provide a reference for estimating relative score separation, and demonstrate through experiments on DCASE benchmarks that these probes enable anomaly‑free model selection to outperform conventional development‑set selection, especially under domain shift.