betaFeedback

WorksComputer Science

Vendi Anomaly Scores for Efficient and Accurate Anomaly Detection

Abstract

Anomaly detection (AD) is a critical for trustworthy machine learning and scientific discovery. Existing methods typically define anomalies through local density, isolation heuristics, or distance from a fitted distribution, making them sensitive to neighborhood scale, partitioning choices, or restrictive distributional assumptions. In this work, we introduce a new paradigm by formulating anomaly detection from a diversity perspective. We propose the Vendi Anomaly Score\textit{Vendi Anomaly Score} (VAS), which detects anomalies by quantifying how much a sample changes the diversity of the dataset, as measured by the Vendi score, when removed. VAS captures both local redundancy and global data structure without relying on density estimation or partitioning heuristics. Moreover, VAS requires no hyperparameter tuning, instead adapting automatically to the spectral structure of the data. VAS is non-parametric and scales linearly with dataset size. Across 148 benchmark embedding datasets derived from 10 source datasets and 4 embedding architectures, VAS achieves state-of-the-art AD performance. We further validate VAS on large-scale ImageNet experiments, where it remains robust as both contamination rate and dataset scale increase.

Introduction

Anomaly detection (AD) is essential for analyzing and curating machine learning datasets and for discovery [10, 8]. In particular, by identifying samples that are corrupted, mislabeled, out-of-distribution, or otherwise irrelevant, AD helps maintain data quality and improve model reliability [1, 40]. Since modern datasets are increasingly inspected through learned embeddings that encode semantic relationships, effective data curation requires AD methods that operate directly in these embedding spaces [45, 50, 9].

AD algorithms are commonly categorized by the supervision available during training. Supervised methods fit detectors using labeled mixtures of normal and anomalous samples [37, 57], while semi-supervised methods assume access to clean data and identify deviations from this reference set [11]. Unsupervised AD fits directly to the dataset being analyzed, making it especially attractive for modern data curation. As datasets increasingly span diverse modalities, it is often impractical to collect data on anomalies or to construct clean reference sets for every domain, making unsupervised detectors appealing.

Unsupervised AD methods typically define anomalies through isolation [32], local density [7], or distance from a fitted distribution [51]. Isolation-based methods score points by how easily they can be separated from the rest of the data, with classical examples including isolation forests (iForest) [32], extended isolation forests (EIF) [24], and robust random cut forests (RRCF) [22], as well as geometric variants such as the hypersphere ensembles of INNE [3] and ADERH [17]. Other approaches use local neighborhood structure, including kk-nearest neighbor scoring [5] and local outlier factor (LOF) [7], or fitted feature-space distributions [51]. These methods are often effective, but their performance depends on certain implicit assumptions: isolation methods seek points that are easy to separate based on some heuristic, local methods depend on a chosen neighborhood scale, and distributional methods rely on the adequacy of the fitted density model. On the other hand, deep unsupervised detectors can learn more flexible notions of abnormality [Xu et al., 2023a,b, Goodge et al., 2022], but they require training a model for each dataset, which adds computational cost and other deployment-related challenges. How can we develop AD methods that retain the efficiency of classical detectors while making fewer assumptions about the geometry of embedding data?

Contribution. In this paper, we answer this question and make several contributions and findings that we summarize below.

  • We introduce a new paradigm for AD based on diversity. We propose the Vendi Anomaly Score (VAS), which builds on the Vendi Scores (VS), a family of similarity-based diversity metrics [20, 46], and defines anomaly through changes in the eigenvalue spectrum of the embedding similarity matrix (Figure 1).

  • We make VAS practical and easy to deploy. We derive an efficient approximation to the exact leave-one-out score, allowing VAS to scale to large embedding datasets. With a simple heuristic, our method also automatically adjusts to different data geometries, eliminating the need for neighborhood selection, fitting clusters, or estimating parametric densities.

  • We demonstrate the effectiveness of VAS across diverse embedding datasets and large-scale contamination experiments. On ADBENCH image and text benchmarks [23], spanning 148 total datasets, VAS outperforms all other baselines. We also evaluate VAS on controlled ImageNet experiments with up to 100k samples [13], showing that VAS is especially effective for detecting contaminating subpopulations at scale.

Figure 1. Overview of VAS. Left: A multimodal dataset contaminated with an anomaly. Right: Removing a rare anomalous point induces a larger change in the eigenvalue spectrum than removing a normal sample. VAS detects these shifts by estimating the change in Vendi Score, derived from the Rényi entropy of order qq of the spectrum (Eq. (1)).

Related Work

Our work relates to three lines of research, which we describe below.

Unsupervised anomaly detection. Existing unsupervised AD methods typically identify anomalies based on criteria such as separability, local density, or reconstruction error.

geometric variants such as the hypersphere ensembles of INNE [3] and ADERH [17]. Other approaches use local neighborhood structure, including kk-nearest neighbor scoring [5] and local outlier factor (LOF) [7], or fitted feature-space distributions [51]. These methods are often effective, but their performance depends on certain implicit assumptions: isolation methods seek points that are easy to separate based on some heuristic, local methods depend on a chosen neighborhood scale, and distributional methods rely on the adequacy of the fitted density model. On the other hand, deep unsupervised detectors can learn more flexible notions of abnormality [Xu et al., 2023a,b, Goodge et al., 2022], but they require training a model for each dataset, which adds computational cost and other deployment-related challenges. How can we develop AD methods that retain the efficiency of classical detectors while making fewer assumptions about the geometry of embedding data?

Partitioning-based methods isolate anomalies by recursively subdividing the feature space. Isolation Forest (iForest) [32] and its variants, such as Extended Isolation Forest [24], identify anomalies as points that can be separated with fewer splits. While effective in low-dimensional or tabular settings, these methods rely on partitions of the feature space, which can struggle to capture complex geometry in high-dimensional embedding spaces.

A second class of methods estimates local data density. Techniques such as Local Outlier Factor (LOF) [7] and deep nearest neighbors (DN2) [5] identify anomalies as points that lie in low-density regions relative to their neighbors. However, these approaches require constructing neighborhoods of fixed size, making them sensitive to scale and limiting their ability to adapt to heterogeneous or multimodal data distributions.

Ensemble-based methods combine multiple weak signals to improve robustness. For example, Lightweight on-line Detector of Anomalies (LODA) [49] aggregates anomaly scores from random low-dimensional projections, while ADERH leverages ensembles of random hyperspheres to estimate density and support [17]. ADERH provides the strongest results to date for AD on tabular data, although it requires the strong assumption that normal data can be bounded within hyperspheres, which may not be true for embedding data.

Recent work has also turned to deep learning to improve AD in complex data. Many of these methods aim to construct representation spaces where anomalies are more easily separated. For example, Deep Isolation Forest [60] learns a non-linear transformation of the data that IForest can leverage. LUNAR [21] unifies local outlier methods such as LOF through a graph neural network message-passing framework, introducing learnability into neighborhood-based AD. Similarly, DeepSVDD [52] learns to project normal data within a hypersphere and anomalous data outside of it. RCA [31] and RDP [59] use collaboration between multiple models to generate a new space where anomalies are more separable. SLAD [61] and DTE [36] both measure how far a sample deviates from normal data. SLAD learns to predict self-supervised “scale” relationships within each sample and identifies anomalies via inconsistencies in these predictions, while DTE leverages diffusion models to estimate deviation from the normal data manifold.

Out-of-distribution detection. Out-of-distribution (OOD) detection is closely related to semi-supervised AD: both settings assume access to in-distribution data and aim to identify samples that deviate from it. In OOD detection, however, the goal is typically to determine whether a test input falls outside the training distribution of a particular predictive model. As a result, many OOD methods are designed around signals produced by that model, including prediction confidence [27], energy-based scores [33, 34], feature-space statistics such as Mahalanobis distance [30, 39], or other properties of the learned representation [19, 5, 58]. Standardized benchmarks such as OpenOOD [62] evaluate these methods in model-centric settings where the detector is built around a classifier trained on a specified in-distribution dataset.

In contrast, we study unsupervised AD. Here, the goal is to identify anomalous samples within the dataset being analyzed, using embeddings produced by a model trained independently on that dataset. We do not assume labels, a clean reference set, prediction logits, or model-specific confidence scores. Our method instead operates directly on the similarity structure of the embedding dataset.

Measuring rarity with the Vendi Scores. Friedman and Dieng [2022] introduced the Vendi Score (VS) as a similarity-based diversity measure. It has since been used to evaluate diversity in a wide variety of domains [54, 41, 12, 44, 4 Tom et al.] (Zammzi et al. 2025). Recent methods have explored how the Vendi Scores can be used to identify rare or novel samples in various settings. In active search, Nguyen and Dieng [2024] measure incremental changes to quality-weighted extensions of the VS, showing that changes in the VS can be used to guide the selection of diverse and informative samples in experimental design settings. Similarly, Askari Hemmat et al. [2024] leverage incremental changes to the VS to guide image generation toward underrepresented regions of the output space. The VS has also been used for OOD detection: the Vendi Novelty Scores (VNS) detect OOD samples by measuring how much a test sample increases the diversity of a reference dataset by class-conditional novelty estimates derived from a trained classifier [47]. VNS relies on incremental changes to diversity, but it is designed for inference-time OOD detection relative to a fixed training distribution and leverages model-dependent signals.

Method

We review the Vendi Scores (VS), and introduce our method for leveraging them in unsupervised AD.

The Vendi Scores. Let X∈RN×DX \in\mathbb{R}^{N \times D} denote a dataset of NN samples. Given a positive semidefinite kernel k(⋅,⋅)k(\cdot,\cdot), we construct the similarity matrix K∈RN×NK \in\mathbb{R}^{N \times N} with entries Kij=k(xi,xj)K_{ij} = k(x_i,x_j). The VS [20] measures the diversity of XX via the entropy of the eigenvalues of KK, normalized such that Tr⁡(K)=1\operatorname{Tr}(K) = 1.

This definition can be generalized using the Rényi entropy [46]. Let λi(K)\lambda_i(K) denote the iith eigenvalue of KK and q≥0q \ge0 be the order of the VS. The order-qq is defined as

VS⁡q(K)=exp⁡(11−qlog⁡∑i=1Nλi(K)q).(1)\operatorname{VS}_q(K) = \exp\left(\frac{1}{1-q}\log\sum_{i=1}^{N}\lambda_i(K)^q\right). \tag*{(1)}

This simplifies to the exponential Shannon Entropy when q=1q = 1. The parameter qq controls sensitivity to different parts of the spectrum: smaller values emphasize the tail, while larger values emphasize the leading eigenmodes [46].

Computing VS⁡q\operatorname{VS}_q naively requires the eigendecomposition of the N×NN \times N matrix KK, which requires O(N3)O(N^3) complexity. However, as Friedman and Dieng [ [20] note, when working with ℓ2\ell_2-normalized features and using a cosine kernel, the VS can be computed more efficiently. In this setting, the similarity matrix is K=XXT/NK = XX^{\mathsf{T}}/N and has the same non-zero eigenvalues of the smaller D×DD \times D matrix XTX/NX^{\mathsf{T}}X/N. We therefore can compute the spectrum using XTX/NX^{\mathsf{T}}X/N, reducing the computational cost to O(D2N+D3)O(D^2N + D^3), which is considerably more efficient in the common ML setting where the number of samples greatly exceeds the feature dimension (N≫DN \gg D).

Fast estimation of diversity influence for anomaly detection. We consider a dataset of NN samples represented by DD-dimensional embeddings X∈RN×DX \in\mathbb{R}^{N \times D}, obtained from a pretrained model. The goal of unsupervised AD is to identify which samples are anomalous relative to the rest of the dataset. We aim to learn a scoring function s:{1,…,N}→Rs : \{1,\ldots,N\} \to\mathbb{R} that assigns a real-valued anomaly score to each sample based on its embedding. Higher scores correspond to more anomalous points. Only the induced ordering matters: any transformation of s(i)s(i) that preserves the ordering yields an equivalent solution.

We define anomaly scores based on the change in dataset diversity when a sample is removed. Assume ℓ2\ell_2 normalized features and let ρ=1NXTX∈RD×D\rho= \frac{1}{N}X^{\mathsf{T}}X \in\mathbb{R}^{D \times D} denote the feature covariance matrix corresponding to the cosine kernel. For a sample xi∈RDx_i \in\mathbb{R}^D, let X−iX_{-i} denote the dataset with xix_i removed, and define ρ−i=1N−1X−iTX−i=XTX−xixiTN−1\rho_{-i} = \frac{1}{N-1}X_{-i}^{\mathsf{T}}X_{-i} = \frac{X^{\mathsf{T}}X-x_i x_i^{\mathsf{T}}}{N-1}. We then define the anomaly score as,

Δ(xi)=log⁡VS⁡q(ρ)−log⁡VS⁡q(ρ−i).\Delta(x_i) = \log\operatorname{VS}_q(\rho) - \log\operatorname{VS}_q(\rho_{-i}).

Intuitively, samples that contribute uniquely to the structure of the dataset will induce a larger decrease in diversity when removed, yielding larger values of Δ(xi)\Delta(x_i), as shown in Figure 1.

However, computing Δ(xi)\Delta(x_i) naively for all NN samples requires O(ND3)O(ND^3) time, which is prohibitive for high-dimensional datasets. Moreover, this formulation requires recomputing the spectrum of ρ−i\rho_{-i} after removing each sample, preventing efficient vectorization and limiting the ability to leverage batched GPU computation. We can accelerate this computation by noting that each removal corresponds to a rank-one perturbation of ρ\rho of size O(1/N)O(1/N). Proposition 3.1 shows that the resulting change in Vendi Score can be approximated by a single quadratic form involving xix_i.

Proposition 3.1 (First-order approximation in log-space). Assume that log⁡VS⁡q\log\operatorname{VS}_q is twice continuously differentiable in a neighborhood of ρ\rho. Let

Gq={q(1−q)Tr⁡(ρq)ρq−1,q≠1,−(log⁡ρ+I),q=1.G_q = \begin{cases} \frac{q}{(1-q)\operatorname{Tr}(\rho^q)}\rho^{q-1}, & q \ne1,\\ -(\log\rho+ I), & q = 1. \end{cases}

Then, for each ii,

log⁡VS⁡q(ρ)−log⁡VS⁡q(ρ−i)=xiTGqxi−Tr⁡(Gqρ)N−1+O(1N2).\log\operatorname{VS}_q(\rho) - \log\operatorname{VS}_q(\rho_{-i}) = \frac{x_i^{\mathsf{T}}G_qx_i-\operatorname{Tr}(G_q\rho)}{N-1} + O\left(\frac{1}{N^2}\right).

A proof is provided in Appendix Section A. The differentiability assumption excludes spectral boundary cases in which zero eigenvalues make terms such as log⁡ρ\log\rho or ρq−1\rho^{q-1} singular. In implementation, all spectral quantities are computed on the positive eigenspace of ρ\rho, equivalently restricting the calculation to the span of the data.

Because Tr⁡(Gqρ)\operatorname{Tr}(G_q\rho) in Proposition 3.1 is constant across samples in a dataset, and we only care about ranking samples from our scoring function, we only need to compute the quantity xiTGqxix_i^{\mathsf{T}}G_qx_i for each sample xix_i. This yields a simple batched computation of the VAS:

VAS⁡(xi):=diag⁡(XGqXT)i∀i=1…N.(2)\operatorname{VAS}(x_i) := \operatorname{diag}(XG_qX^{\mathsf{T}})_i \qquad\forall i=1\ldots N. \tag*{(2)}

We empirically demonstrate the accuracy of the approximation used in VAS in § 4.1.

VAS can also be interpreted as a spectral quadratic anomaly score, connecting it to classical methods such as Mahalanobis distance and PCA reconstruction error. While these methods use predefined rules for weighting different directions of variation, VAS derives its weighting from each sample’s influence on dataset diversity, with the relative importance of different directions controlled by the Vendi Score order qq. In Appendix Section B, we provide additional description of how VAS relates to other spectral scores.

Automatically adapting qq. VAS introduces a single hyperparameter: the order qq of the Vendi Score. Previous methods leveraging the Vendi Scores often fix a single value of qq across experiments [63, 47] or track the VS across a range of qq values to draw diversity profiles [15, 28]. However, in unsupervised AD, the optimal choice of qq can vary significantly depending on the geometry of the embedding space, and we are not afforded a validation set to tune hyperparameters. Therefore, we design a simple, data-dependent heuristic that adapts qq automatically across datasets.

The parameter qq controls how strongly the Vendi Score emphasizes the tail of the eigenvalue spectrum. The importance of this tail varies across datasets. In embedding spaces where the data is highly concentrated, such as BERT embeddings of text, most variance is captured by the leading eigenmode, resulting in a large principal eigenvalue λ1\lambda_1 of the trace-normalized similarity matrix. In this regime, AD requires amplifying the contribution of the spectral tail, which is achieved by using smaller values of qq. In contrast, in more isotropic embedding spaces, such as image representations spanning diverse visual features, the variance is more evenly distributed, leading to a smaller λ1\lambda_1. In these settings, less emphasis on the tail is needed, and larger values of qq are appropriate.

To capture this behavior without manual tuning, we define qq as a function of the principal eigenvalue:

q=max⁡(2(1−λ1),0.1).q = \max\left(2(1-\lambda_1), 0.1\right).

The lower bound of 0.10.1 is introduced for numerical stability when evaluating ρq−1\rho^{q-1} for small qq. This heuristic assigns smaller values of qq to concentrated datasets and larger values to more dispersed ones, adapting automatically to the spectral structure of the data.

Interpreting VAS. Proposition 3.1 shows that VAS ranks samples by the quadratic form xTGqxx^{\mathsf{T}}G_qx. Therefore, to understand what kinds of subpopulations VAS identifies as anomalous, it suffices to study the expected score Ex∼Pc[xTGqx]\mathbb{E}_{x\sim P_c}[x^{\mathsf{T}}G_qx] for samples drawn from a component PcP_c. Proposition 3.2 analyzes this quantity under a stylized orthogonal mixture model.

Proposition 3.2 (Expected VAS under orthogonal mixtures). Let P=∑c=1KπcPcP=\sum_{c=1}^{K}\pi_cP_c be a mixture distribution on Sd−1\mathbb{S}^{d-1}, and define ρ=Ex∼P[xxT]\rho=\mathbb{E}_{x\sim P}[xx^{\mathsf{T}}]. Assume each component PcP_c is supported on a subspace Uc⊆RdU_c\subseteq\mathbb{R}^d, and that the subspaces U1,…,UKU_1,\ldots,U_K are mutually orthogonal. Let ρc=Ex∼Pc[xxT]\rho_c=\mathbb{E}_{x\sim P_c}[xx^{\mathsf{T}}]. Using GqG_q as defined in Proposition 3.1, for any x∈Ucx\in U_c and q≠1q\ne1,

xTGqx=q(1−q)Tr⁡(ρq)πcq−1xTρcq−1x.x^{\mathsf{T}}G_qx=\frac{q}{(1-q)\operatorname{Tr}(\rho^q)}\pi_c^{q-1}x^{\mathsf{T}}\rho_c^{q-1}x.

Consequently, the expected VAS score of a sample from component cc is

Ex∼Pc[xTGqx]=q(1−q)Tr⁡(ρq)(πcVS⁡q(ρc))q−1.\mathbb{E}_{x\sim P_c}[x^{\mathsf{T}}G_qx]=\frac{q}{(1-q)\operatorname{Tr}(\rho^q)}\left(\frac{\pi_c}{\operatorname{VS}_q(\rho_c)}\right)^{q-1}.

The proof is provided in Appendix C. Proposition 3.2 shows that the expected VAS score for samples from component cc depends on the ratio πc/VS⁡q(ρc)\pi_c/\operatorname{VS}_q(\rho_c). Here, πc\pi_c is the component mass, while VS⁡q(ρc)\operatorname{VS}_q(\rho_c)

DatasetEncoderVASADERHDIFIForestLUNARDN2LODALOFKPCASLADGMDDTE
CIFAR10ResNet180.7450.6330.6840.6270.6570.7400.6350.6960.7510.7350.7320.673
CIFAR10ViT0.9410.9240.8600.8760.8370.8550.8560.5190.9050.9420.8980.590
FashionMNISTResNet180.9110.8650.8680.8310.8520.8580.8290.6050.9150.9040.9120.848
FashionMNISTViT0.9300.9100.8560.8900.8150.8600.8620.5190.9170.9190.9250.657
MNIST-CResNet180.7930.7630.7440.7340.7800.7630.7240.6280.7650.7820.7930.759
MNIST-CViT0.7390.7230.7040.7200.6950.7040.6890.5550.7190.7320.7230.568
MVTec-ADResNet180.7990.7550.7500.7450.7680.7970.7040.7630.7410.7880.7900.705
MVTec-ADViT0.8960.8090.7950.8080.8580.8750.7810.8420.8470.8510.8910.697
SVHNResNet180.6570.5790.6150.5760.6090.6620.5890.6380.6570.6550.6590.592
SVHNViT0.5790.5190.5240.5300.5640.5840.5240.5770.5650.5530.5800.529
20NewsBERT0.6260.5430.5570.5550.5710.5650.5540.6070.5540.6060.6030.560
20NewsRoBERTa0.7490.6360.6240.6430.6980.7320.6070.7230.7200.7030.7160.503
AgnewsBERT0.6760.5830.5820.5830.6500.6100.5580.7250.6040.6560.6500.587
AgnewsRoBERTa0.8810.7180.6610.6770.7900.8500.6380.7190.8460.7970.8130.501
AmazonBERT0.6080.5770.5650.5580.6080.5950.5310.5780.5850.6060.6040.522
AmazonRoBERTa0.5440.4850.5180.5090.5360.5510.5200.5480.5510.5320.5300.548
ImdbBERT0.5020.4860.4900.4880.4930.5170.4470.5050.5170.5130.5150.483
ImdbRoBERTa0.5300.4390.5080.4850.5180.5290.5060.5320.5300.5100.5040.500
YelpBERT0.6790.6230.6170.6030.6640.6720.5730.6670.6470.6590.6760.467
YelpRoBERTa0.5660.5110.5370.5310.5780.5940.5480.5810.5770.5680.5750.532
Average Rank2.358.708.559.206.104.0510.156.254.704.353.809.80
p-Value-1.34e-201.15e-246.27e-243.78e-223.14e-102.08e-255.23e-154.11e-154.49e-161.34e-082.07e-24

caption: AUROC across dataset families and encoders. For multi-split datasets, we report average AUROC. Orange marks best, blue marks 2nd. Bottom-row p-values are paired Wilcoxon tests: VAS vs. each baseline over all 148 dataset-split/encoder instances.

:::

is the component’s effective spectral dimension. Thus, VAS is sensitive to how much probability mass a component has relative to its internal diversity. Components that are small but spectrally diffuse can receive high anomaly scores, even if their samples are not isolated from one another. This component-level sensitivity emerges without explicitly identifying components or forming local neighborhoods; it arises implicitly from the spectrum of the full dataset.

Time and space complexity. The computational cost of VAS is dominated by forming ρ=X⊤X/N\rho= X^\top X/N, eigen-decomposing the resulting D×DD \times D matrix, and computing the VAS scores from (2) for all samples. Forming ρ\rho costs O(ND2)O(ND^2) time, the eigendecomposition costs O(D3)O(D^3) time, and the batched score computation costs O(ND2)O(ND^2) time. Thus, the total runtime is O(ND2+D3)O(ND^2 + D^3), with memory complexity O(ND+D2)O(ND + D^2). In contrast, naively recomputing the Vendi Score after each sample removal would require NN separate eigendecompositions, yielding O(ND3)O(ND^3) time complexity. VAS therefore avoids per-sample spectral computations and reduces scoring to a single global eigendecomposition followed by batched matrix operations.

Experiments

In this section, we compare VAS against a diverse set of AD algorithms. We benchmark all algorithms on various image and text embedding datasets across multiple architectures.

Datasets and models. We evaluate VAS on the embedding-based image and text datasets from AD-BENCH [23]. These datasets span numerous image and text datasets and architectures. For all image datasets, we test methods against embeddings from ResNet18 [25] and ViT [16] architectures that had been pre-trained on ImageNet [13]. For text data, we test performance on embeddings from BERT [14] and RoBERTa [35]. The benchmark covers a wide range of AD scenarios. These include rare class detection (e.g., CIFAR-10 [29], SVHN [42]), where one class is treated as normal and samples from the remaining classes are downsampled to form anomalies; distributional corruption (e.g., MNIST vs. MNIST-C [38]), where anomalies arise from shifts in data generation; and semantic or structural anomalies (e.g., MVTec-AD [6]). In text datasets (e.g., Amazon [26], Yelp [65]), anomalies are constructed via shifts in semantic content, such as contrasting sentiment. Additional specifications for each dataset are provided in Appendix Section D.

We additionally perform AD experiments on ImageNet-1K [13], using embeddings extracted from the DinoV3 ViT-B/16 model [53].

Baselines. We compare against 11 unsupervised AD algorithms: ADERH [17], DIF [60], IForest [32], DN2 [5], LODA [49], LOF [7], KPCA [19], SLAD [61], DTE [36], and LUNAR [21]. We also include a custom Gaussian-mixture Mahalanobis distance baseline (GMD) to represent fitted-distribution methods. Inspired by Gaussian feature modeling for AD [51], GMD fits a Bayesian Information Criterion-selected Gaussian mixture model to the unlabeled embeddings and scores each sample by its Mahalanobis distance to its most likely component. Together, these baselines span feature-space partitions (IForest), local neighborhoods (LOF, DN2), randomized ensemble methods based on projections or hyperspheres (LODA, ADERH), deep anomaly detectors (SLAD, DIF, DTE, LUNAR), kernel reconstruction methods (KPCA), and fitted feature-space distributions (GMD). Additional descriptions of each algorithm and their relationship to VAS are provided in Appendix Section E.

Hyperparameters and preprocessing. All main-text experiments use the default hyperparameter recommendations from each method’s reference implementation. VAS uses the adaptive choice of qq described in § 3, with no validation-label tuning. To assess sensitivity of baselines to the default hyperparameter protocol, we additionally report a grid-search comparison in Appendix Section F.

For preprocessing, we use a method-specific protocol designed to match the assumptions of each baseline rather than imposing a single uniform pipeline. This avoids disadvantaging methods whose scoring rules depend on a particular feature scale. Specifically, ADERH uses MinMaxScaler and LUNAR uses StandardScaler [48]. SLAD, DIF, IForest, DTE, LOF, and LODA are applied to raw features, consistent with their standard usage. DN2 and GMD operate on ℓ2\ell_2-normalized features, following recent evidence that normalized embeddings improve distance- and Mahalanobis-based scoring in deep feature spaces [55, 39]. Finally, KPCA and VAS use a cosine kernel, so they operate on ℓ2\ell_2-normalized features.

Evaluation protocol. All methods are fit directly on the contaminated unlabeled dataset and then used to score the same samples, matching the standard unsupervised AD setting. We evaluate performance using Area Under the ROC Curve (AUROC) and Average Precision (AP). Higher values indicate better performance for both metrics.

Empirical Accuracy of VAS

Prior to benchmarking VAS against other baselines, we verify the accuracy of its approximation to the exact leave-one-out VS change. In Figure 2, we test the method on a 25,000-point, 100-component mixture of gaussians dataset in 512 dimensions. For all tested VS orders qq, we achieve a Spearman rank correlation of ρ=1.00\rho= 1.00, showing that the approximation preserves the sample ranking. We also show the practical efficiency of VAS: Varying the dataset size from 1000 to 25000 points shows that VAS is orders of magnitude faster than the exact approach.

Figure 2. VAS provides accurate and efficient diversity influence measurements. Left: VAS diversity influence compared against the exact leave-one-out Vendi Score change for multiple orders of qq. Spearman rank correlation ρ\rho is shown for each choice of qq. Right: Varying dataset sizes shows that VAS provides orders of magnitude speedup over the exact approach.

We additionally evaluate the approximation on all 148 ADّBENCH benchmark instances by comparing VAS against the exact leave-one-out Vendi Score change. The approximation closely preserves the anomaly rankings, with an average Spearman ρ\rho over 0.98 on all tested benchmarks. The change in AUROC is at most 1.16%. Detailed results are provided in Table 2.

DatasetEncoderApprox. AUROCExact AUROCΔ\Delta AUROC (%)Spearman ρ\rho
CIFAR-10ResNet180.7450.745-0.011.000
CIFAR-10ViT0.9410.941-0.021.000
FashionMNISTResNet180.9110.911-0.021.000
FashionMNISTViT0.9300.9290.001.000
MNIST-CResNet180.7930.7930.001.000
MNIST-CViT0.7390.7390.011.000
MVTec-ADResNet180.7990.796-0.410.990
MVTec-ADViT0.8960.9061.160.985
SVHNResNet180.6570.6570.001.000
SVHNViT0.5790.5790.061.000
20NewsBERT0.6260.6300.480.997
20NewsRoBERTa0.7490.748-0.080.995
AG NewsBERT0.6760.6760.031.000
AG NewsRoBERTa0.8810.8810.011.000
AmazonBERT0.6080.6080.001.000
AmazonRoBERTa0.5440.5440.001.000
IMDBBERT0.5020.502-0.011.000
IMDBRoBERTa0.5300.5300.001.000
YelpBERT0.6790.6790.001.000
YelpRoBERTa0.5660.5660.001.000

Table 2. Comparison of exact and approximate VAS across 148 ADBENCH benchmark instances. Results are averaged across dataset splits for each dataset–encoder combination. Δ\Delta AUROC (%) is the percentage change from approximate to exact VAS. Spearman’s ρ\rho measures the rank correlation between exact and approximate anomaly scores. The approximation preserves both anomaly rankings and downstream detection performance across datasets.

ADBENCH Anomaly Detection Performance Results

Tables 1 and Table 3 show the performance of VAS relative to other baselines on the ADBENCH embedding benchmarks based on AUROC and AP, respectively. We report family-level averages across datasets and across the two embedding models available for each benchmark family. Statistical tests are also run across all 148 benchmark instances, where each instance corresponds to a dataset split paired with an embedding model. VAS achieves significantly stronger performance than the competing methods under a Wilcoxon signed-rank test for both AUROC and AP.

DatasetEncoderVASADERHDIFIForestLUNARDN2LODALOFKPCASLADGMDDTE
CIFAR10ResNet180.1530.0930.1120.0880.1040.1630.0910.1220.1660.1450.1410.103
CIFAR10ViT0.6590.5410.3260.3600.3890.3860.3650.0720.4860.6700.4910.109
FashionMNISTResNet180.4490.3700.3950.3250.3190.3370.3210.1280.4950.4500.4360.335
FashionMNISTViT0.5460.5080.3250.4230.3330.3460.3810.0850.4510.5080.5110.115
MNIST-CResNet180.2370.2320.2230.1730.1920.1980.2080.1230.2140.2560.2350.227
MNIST-CViT0.2260.2690.2200.2420.1920.2160.2000.0900.2000.2310.2010.091
MVTec-ADResNet180.6420.5770.5700.5650.5820.6480.5200.5890.5780.6280.6370.543
MVTec-ADViT0.7480.6480.6120.6260.7120.7230.5910.6900.6840.6730.7500.489
SVHNResNet180.0920.0760.0800.0710.0810.0950.0760.0850.0910.0910.0930.076
SVHNViT0.0660.0560.0550.0560.0620.0670.0560.0680.0630.0600.0660.057
20NewsBERT0.0880.0660.0690.0650.0750.0760.0660.0830.0690.0800.0840.069
20NewsRoBERTa0.1480.0800.0740.0760.1120.1250.0690.1110.1270.1120.1150.055
AgnewsBERT0.0940.0660.0650.0640.0880.0770.0620.1300.0720.0800.0870.069
AgnewsRoBERTa0.3340.1250.0890.0890.1990.2490.0810.1150.2720.1880.2130.054
AmazonBERT0.0630.0600.0590.0580.0630.0610.0550.0580.0600.0640.0620.054
AmazonRoBERTa0.0550.0480.0520.0500.0530.0550.0520.0560.0550.0530.0520.059
ImdbBERT0.0470.0470.0470.0470.0470.0490.0440.0500.0500.0500.0490.047
ImdbRoBERTa0.0560.0460.0530.0500.0530.0540.0530.0560.0550.0520.0520.049
YelpBERT0.0860.0740.0740.0700.0860.0830.0640.0840.0750.0800.0830.049
YelpRoBERTa0.0570.0490.0520.0510.0610.0630.0530.0630.0590.0580.0580.056
Average Rank2.907.908.459.656.004.259.956.104.904.404.209.30
p-Value-1.12e-142.14e-202.79e-204.42e-203.84e-092.42e-211.89e-121.07e-103.59e-086.62e-114.99e-22

Table 3. AP across dataset families and encoders. For multi-split datasets, we report average AP. Orange marks best, blue marks 2nd. Bottom-row p-values are paired Wilcoxon tests: VAS vs. each baseline over all 148 dataset-split/encoder instances.

Figure 5 shows the distribution of the adaptively selected Vendi orders qq. The order qq controls which parts of the spectrum drive the diversity-influence score: larger values emphasize dominant eigen-directions, while smaller values place relatively more weight on lower-variance directions. We observe that NLP embeddings tend to have larger principal eigenvalues than CV embeddings, suggesting stronger concentration around shared semantic context. Consequently, the adaptive rule selects smaller values of qq for NLP datasets, which makes VAS more sensitive to variation in the spectral tail.

Figure 5. Distribution of principal eigenvalue (left) and the selected qq orders (right) on all tested ADBENCH benchmarks. The geometry of CV datasets is significantly different than those from NLP datasets, so we select different qq orders to account for this.

To ensure that our comparisons are robust against hyperparameters, we perform a grid search over the hyperparameters of all baseline methods. For each method, we pick the hyperparameters that give the strongest performance relative to VAS. Even in this setting of letting methods overfit to the evaluation sets, VAS still provides the strongest results (Table 4 and Table 5). Additional details of this grid search experiment are in Appendix Section F.

DatasetEncoderVASADERHDIFIForestLUNARDN2LODALOFKPCASLADGMDDTE
CIFAR10ResNet180.7450.6320.6310.6330.6630.7390.6510.6890.7340.7360.7320.655
CIFAR10ViT0.9410.9240.7880.8920.8760.8310.9000.4440.6100.9460.8980.578
FashionMNISTResNet180.9110.8690.8320.8390.8670.8380.8530.5760.8950.9040.9120.823
FashionMNISTViT0.9300.9110.7760.8960.8200.8370.8930.4930.9000.9230.9250.656
MNIST-CResNet180.7930.7720.7080.7420.7910.7520.7500.5990.7910.7800.7930.727
MNIST-CViT0.7390.7210.6820.7230.7050.6970.7180.5430.7320.7330.7230.566
MVTec-ADResNet180.7990.7600.7300.7460.7760.8010.7470.7570.7830.7910.7900.733
MVTec-ADViT0.8960.8130.7530.8150.8660.8800.7990.8410.7180.8640.8910.672
SVHNResNet180.6570.5830.5850.5830.6130.6650.5920.6370.6730.6540.6590.597
SVHNViT0.5790.5140.5150.5310.5630.5940.5290.5840.5840.5500.5800.526
20NewsBERT0.6260.5460.5550.5600.5920.5720.5610.6170.6060.5970.6030.567
20NewsRoBERTa0.7490.6270.5970.6510.7110.7330.6390.7080.7310.7090.7160.539
AgnewsBERT0.6760.5920.5690.5900.6660.6130.5680.7110.6530.6490.6500.604
AgnewsRoBERTa0.8810.7010.6160.6900.8320.8330.6740.6590.8650.8040.8130.523
AmazonBERT0.6080.5780.5480.5640.6080.5940.5710.5730.6080.6060.6040.525
AmazonRoBERTa0.5440.4740.5020.5110.5370.5550.5070.5520.5440.5300.5300.547
ImdbBERT0.5020.4860.4920.4880.4950.5180.4970.5040.5110.5100.5150.470
ImdbRoBERTa0.5300.4320.4930.4870.5190.5400.4940.5430.5370.5110.5040.506
YelpBERT0.6790.6280.5790.6050.6840.6720.6030.6560.6730.6600.6760.529
YelpRoBERTa0.5660.5070.5010.5430.5790.5980.5460.5770.5600.5730.5750.544
Average Rank2.608.6010.658.805.254.258.506.704.204.603.959.90
p-Value vs VAS-5.46e-203.10e-252.28e-238.92e-188.91e-106.01e-231.60e-146.22e-113.14e-141.34e-089.41e-24

Table 4. AUROC across dataset families and encoders using each method’s best hyperparameter setting. For multi-split datasets, we report average AUROC. Orange marks best, blue marks 2nd. Bottom-row p-values are paired Wilcoxon tests: VAS vs. each baseline over all 148 dataset-split/encoder instances.

DatasetEncoderVASADERHDIFIForestLUNARDN2LODALOFKPCASLADGMDDTE
CIFAR10ResNet180.1530.0940.0880.0910.1050.1600.0940.1160.1170.1430.1410.093
CIFAR10ViT0.6590.5440.2210.4050.4410.3410.4270.0540.0750.6890.4910.108
FashionMNISTResNet180.4490.3720.3150.3290.3270.3100.3590.1020.3830.4590.4360.264
FashionMNISTViT0.5460.5100.2050.4330.3290.3170.4350.0730.3930.5370.5110.129
MNIST-CResNet180.2370.2370.1690.1830.1960.1900.2260.1090.2200.2550.2350.169
MNIST-CViT0.2260.2730.1670.2430.1950.2090.2350.0820.2190.2380.2010.100
MVTec-ADResNet180.6420.5840.5390.5670.5880.6530.5720.5760.6250.6350.6360.569
MVTec-ADViT0.7480.6520.5540.6350.7220.7340.6130.6870.5540.6920.7500.468
SVHNResNet180.0920.0770.0710.0740.0810.0960.0770.0840.0980.0920.0930.077
SVHNViT0.0660.0550.0540.0560.0620.0680.0560.0690.0670.0600.0660.056
20NewsBERT0.0880.0670.0670.0660.0800.0740.0650.0940.0820.0770.0840.072
20NewsRoBERTa0.1480.0790.0730.0790.1170.1280.0750.1050.1350.1080.1150.064
AgnewsBERT0.0940.0670.0640.0650.0930.0780.0620.1200.0830.0780.0870.077
AgnewsRoBERTa0.3340.1220.0760.0920.2320.2280.0870.0960.2920.1830.2130.057
AmazonBERT0.0630.0600.0570.0580.0630.0610.0590.0580.0630.0630.0620.054
AmazonRoBERTa0.0550.0470.0500.0500.0530.0560.0500.0570.0550.0520.0520.058
ImdbBERT0.0470.0470.0470.0470.0470.0490.0470.0490.0480.0490.0490.046
ImdbRoBERTa0.0560.0450.0500.0510.0530.0540.0510.0570.0570.0530.0520.051
YelpBERT0.0860.0750.0670.0700.0900.0830.0680.0820.0840.0790.0830.057
YelpRoBERTa0.0570.0490.0490.0520.0610.0640.0520.0620.0570.0580.0580.058
Average Rank3.057.6010.608.755.404.658.406.304.704.354.309.90
p-Value vs VAS-2.80e-148.96e-268.92e-201.35e-171.71e-083.89e-189.30e-131.95e-131.68e-056.62e-113.96e-23

Table 5. AP across dataset families and encoders using each method’s best hyperparameter setting. For multi-split datasets, we report average AP. Orange marks best, blue marks 2nd. Bottom-row p-values are paired Wilcoxon tests: VAS vs. each baseline over all 148 dataset-split/encoder instances.

We additionally evaluate the sensitivity of VAS to alternative rules for selecting qq, including different scaling factors, multiple leading eigenvalues, and the effective spectral rank. Our heuristic performs comparably to several alternatives and significantly outperforms others across 148 ADBENCH tasks, suggesting that its effectiveness is not overly sensitive to the choice of heuristic (Appendix § 13).

ImageNet Anomaly Detection Results

We next evaluate VAS in a controlled large-scale image setting using ImageNet embeddings from DINOv3 ViT-B/16 [53]. We construct contaminated datasets by sampling normal images from one set of ImageNet classes and anomalous images from a disjoint set of classes. We study two settings. First, we fix the normal set to 25,000 images from 25 classes and vary the number of anomalous images sampled from 25 disjoint classes, thereby sweeping the anomaly rate. Second, we fix the anomaly rate at 20% and scale the dataset by increasing the number of normal classes in increments of 10, while sampling anomalies from an equal number of disjoint classes. This increases both dataset size and semantic diversity as we scale to 100,000 normal images. Across both settings, VAS uses the same adaptive choice of qq as in the ADBENCH experiments and achieves the strongest performance among the evaluated methods (Figure 3). SLAD provides the most competitive performance, although as shown in the following section, it is orders of magnitude slower than VAS.

Figure 3. VAS achieves accurate ImageNet AD. We construct contaminated datasets by sampling normal and anomalous images from disjoint ImageNet classes. Left: AUROC as the anomaly rate varies with 25,000 normal images from 25 classes. Right: AUROC as dataset size increases at a fixed 20% anomaly rate, adding normal samples in increments of 10, 000. VAS performs best across both sweeps, showing robustness to increasing contamination and scale. Results are averaged over 5 replications, with standard deviation bars included.

These results match the behavior predicted by Proposition 3.2. The anomalous samples in this experiment are not isolated outliers: they are sampled from a select number of ImageNet classes and can therefore form coherent local neighborhoods in feature space. This structure can weaken local density methods, which may treat anomalous samples as typical once they have nearby anomalous neighbors. VAS instead scores each sample by its diversity influence. Under the mixture structure described in Proposition 3.2, this score depends on both component mass and internal diversity, enabling VAS to detect rare but coherent anomalous subpopulations.

To further investigate VAS across different anomaly types, we consider three additional constructions using ADBENCH embeddings: locally class-confusable observations, global directional perturbations, and disrupted feature dependencies. VAS performs well across constructions compared to the other best-performing baselines. We provide details of these experiments in Appendix § 14.

Latency Evaluation of VAS

We compare the latency of VAS and all tested baselines on simulated Gaussian datasets while varying either the number of samples or the embedding dimension (Figure 4). We report the time required to fit each method and score all samples. All experiments were performed on a single NVIDIA A6000 GPU. For ADERH, LODA, and LOF, we use custom GPU-friendly implementations to provide fairer latency comparisons, and verify that their outputs match the original implementations.

Figure 4. VAS supports efficient AD. Left: Latency of methods when increasing dataset size at a fixed dimensionality of 128. Right: Latency of methods with increasing dimensionality at a fixed dataset size of 5000. Results are averaged over n=3n = 3 repetitions.

Figure 4 shows that neural baselines are substantially slower across the tested regimes. As the number of samples increases, VAS exhibits linear scaling and becomes one of the fastest methods on larger datasets. This follows from its batched quadratic-form computation after the matrix GqG_q has been formed. VAS has a stronger dependence on embedding dimension than alternatives such as IForest or LODA. However, in embedding-based AD, the dimension is fixed by the pretrained model. Thus, the more relevant large-scale regime is increasing NN at fixed DD, where VAS scales linearly.

Conclusion

This work introduces VAS, an unsupervised AD method for embedding data that scores each sample by its influence on dataset diversity. By deriving a first-order approximation to leave-one-out Vendi Scores, VAS avoids repeated eigendecompositions, requires no validation-based hyperparameter tuning, and adapts automatically to the geometry of the dataset. Across image and text AD benchmarks, VAS consistently improves over classical, kernel-based, fitted-distribution, and deep AD baselines. Our large-scale ImageNet experiments further show that VAS is especially effective for detecting coherent contamination, where anomalous samples form rare but structured subpopulations. Together, these results establish VAS as a scalable and effective approach to unsupervised AD.

Limitations. VAS depends on the quality of the embedding space and the chosen similarity function. If anomalies are indistinguishable from normal samples under the embedding or cosine similarity, VAS cannot reliably detect them. While VAS provides a principled anomaly ranking, the scalar score does not by itself explain the source of anomalousness. In addition, our adaptive rule for selecting qq is heuristic and may not be optimal for all data geometries.

Future work. Future work includes extending VAS to learned or task-specific kernels and developing principled rules for adapting the VS order to dataset geometry. More broadly, VAS may be useful for other data curation tasks, including coreset selection and duplicate detection.

Broader impacts. VAS can support dataset auditing by helping identify corrupted or mislabeled samples in large embedding datasets. However, anomaly scores depend on the embedding model and similarity function, and may reflect their biases. In sensitive applications, VAS should therefore be used as a tool for prioritizing human review rather than as an automatic rule for removing data.

Acknowledgments and Disclosure of Funding

Adji Bousso Dieng acknowledges support from the National Science Foundation CAREER grant CAIF #2541965. Amey Pasarkar is supported by an NSF-GRFP fellowship. The authors declare no competing interests.

AI use statement. In this work, we used generative AI tools for implementing methods in code. We have not used generative AI tools for generating data sets, developing theoretical models or conceptual frameworks, formulating mathematical claims, assisting in the writing of proofs, proposing hypotheses, cleaning and reformatting datasets, supporting qualitative and thematic data analysis, interpreting results or designing or providing feedback on research methodology. We have reviewed all AI-assisted work: All code went through testing to ensure we provided faithful reproductions of established baselines and that our code matched the experimental descriptions in the paper. AI tools were used as a small portion of the paper editing process and all changes were reviewed by the Authors. We take responsibility for the final content of this work, including text, claims, or artifacts produced with the aid of generative AI.

Proof of Proposition 3.1

Removing xix_i induces the perturbation

Δi:=ρ−i−ρ=−xixiT/N−ρN−1.\Delta_i := \rho_{-i} - \rho= -\frac{x_i x_i^{\mathsf T}/N - \rho}{N-1}.

Moreover,

∥Δi∥≤∥xixiT∥+∥ρ∥N−1≤2N−1=O(1N),\lVert\Delta_i \rVert\le\frac{\lVert x_i x_i^{\mathsf T}\rVert+ \lVert\rho\rVert}{N-1} \le\frac{2}{N-1} = O\left(\frac{1}{N}\right),

because ∥xi∥2=1\lVert x_i\rVert_2 = 1 and ∥ρ∥≤Tr⁡(ρ)=1\lVert\rho\rVert\le\operatorname{Tr}(\rho) = 1.

We now compute the first variation of log⁡VSq\log\mathrm{VS}_q.

Case q≠1q \ne1.

log⁡VSq(ρ)=11−qlog⁡Tr⁡(ρq).\log\mathrm{VS}_q(\rho) = \frac{1}{1-q}\log\operatorname{Tr}(\rho^q).

Here Dlog⁡VSq(ρ)[Δ]D\log\mathrm{VS}_q(\rho)[\Delta] denotes the directional derivative of log⁡VSq\log\mathrm{VS}_q at ρ\rho in the perturbation direction Δ\Delta. Then,

Dlog⁡VSq(ρ)[Δ]=q(1−q)Tr⁡(ρq)Tr⁡(ρq−1Δ)=Tr⁡(GqΔ).D\log\mathrm{VS}_q(\rho)[\Delta] = \frac{q}{(1-q)\operatorname{Tr}(\rho^q)}\operatorname{Tr}(\rho^{q-1}\Delta) = \operatorname{Tr}(G_q\Delta).

Case q=1q = 1.

log⁡VS1(ρ)=−Tr⁡(ρlog⁡ρ).\log\mathrm{VS}_1(\rho) = -\operatorname{Tr}(\rho\log\rho).

Using spectral calculus,

Dlog⁡VS1(ρ)[Δ]=−Tr⁡((log⁡ρ+I)Δ)=Tr⁡(GqΔ).D\log\mathrm{VS}_1(\rho)[\Delta] = -\operatorname{Tr}((\log\rho+ I)\Delta) = \operatorname{Tr}(G_q\Delta).

Thus, in both cases,

Dlog⁡VSq(ρ)[Δ]=Tr⁡(GqΔ).D\log\mathrm{VS}_q(\rho)[\Delta] = \operatorname{Tr}(G_q\Delta).

By Taylor’s theorem,

log⁡VSq(ρ+Δi)=log⁡VSq(ρ)+Tr⁡(GqΔi)+O(∥Δi∥2).\log\mathrm{VS}_q(\rho+\Delta_i) = \log\mathrm{VS}_q(\rho) + \operatorname{Tr}(G_q\Delta_i) + O(\lVert\Delta_i\rVert^2).

Substituting Δi\Delta_i gives

log⁡VSq(ρ−i)−log⁡VSq(ρ)=−1N−1Tr⁡(Gq(xixiT−ρ))+O(1N2).\log\mathrm{VS}_q(\rho_{-i})-\log\mathrm{VS}_q(\rho) = -\frac{1}{N-1}\operatorname{Tr}(G_q(x_i x_i^{\mathsf T}-\rho)) + O\left(\frac{1}{N^2}\right).

Using Tr⁡(GqxixiT)=xiTGqxi\operatorname{Tr}(G_qx_i x_i^{\mathsf T}) = x_i^{\mathsf T}G_qx_i, we obtain

log⁡VSq(ρ)−log⁡VSq(ρ−i)=xiTGqxi−Tr⁡(Gqρ)N−1+O(1N2),\log\mathrm{VS}_q(\rho)-\log\mathrm{VS}_q(\rho_{-i}) = \frac{x_i^{\mathsf T}G_qx_i-\operatorname{Tr}(G_q\rho)}{N-1} + O\left(\frac{1}{N^2}\right),

which completes the proof.

Comparison of VAS to Alternative Spectral Scores

VAS belongs to a broader family of spectral quadratic anomaly scores. For ℓ2\ell_2-normalized embeddings x1,…,xN∈RDx_1,\ldots,x_N \in\mathbb{R}^D, consider the eigendecomposition

ρ=1N∑i=1NxixiT=Udiag⁡(λ1,…,λD)UT,(3)\rho= \frac{1}{N}\sum_{i=1}^{N}x_i x_i^{\mathsf T} = U\operatorname{diag}(\lambda_1,\ldots,\lambda_D)U^{\mathsf T}, \tag*{(3)}

where λ1≥⋯≥λD≥0\lambda_1 \ge\cdots\ge\lambda_D \ge0. Writing zj=ujTxz_j = u_j^{\mathsf T}x, any spectral function M=f(ρ)M=f(\rho) defines a quadratic score

sM(x)=xTMx=∑jf(λj)zj2.(4)s_M(x)=x^{\mathsf T}Mx=\sum_j f(\lambda_j)z_j^2. \tag*{(4)}

Different spectral detectors differ in how the choice of MM, and therefore how they weight the eigen-directions of ρ\rho. From Proposition 3.1, VAS assigns the weights

fq(λj)={qλjq−1(1−q)Tr⁡(ρq),q≠1,−log⁡λj−1,q=1.(5)f_q(\lambda_j) = \begin{cases} \frac{q\lambda_j^{q-1}}{(1-q)\operatorname{Tr}(\rho^q)}, & q \ne1,\\ -\log\lambda_j - 1, & q = 1. \end{cases} \tag*{(5)}

As in the main text, spectral functions are evaluated on the positive eigenspace of ρ\rho. For 0<q<10 < q < 1, VAS assigns larger positive weights to smaller eigenvalues. For q>1q > 1, the weights are negative, with larger magnitudes on leading eigen-directions. Thus, the order qq controls how spectral directions contribute to diversity influence.

Mahalanobis distance. For mean-centered features, the covariance equals ρ\rho, and the squared Mahalanobis score is

sMah(x)=xTρ†x=∑λj>0λj−1zj2,(6)s_{\mathrm{Mah}}(x) = x^{\mathsf{T}}\rho^{\dagger}x = \sum_{\lambda_j>0}\lambda_j^{-1}z_j^2, \tag*{(6)}

where ρ†\rho^{\dagger} is the pseudoinverse. As q→0+q \to0^{+}, the VAS spectral weights become proportional to λj−1\lambda_j^{-1}. More precisely,

lim⁡q→0+(1−q)Tr⁡(ρq)qsVAS,q(x)=xTρ†x.(7)\lim_{q\to0^{+}}\frac{(1-q)\operatorname{Tr}(\rho^q)}{q}s_{\mathrm{VAS},q}(x)=x^{\mathsf{T}}\rho^{\dagger}x. \tag*{(7)}

Thus, VAS approaches the Mahalanobis ranking in this limit. Unlike standard Mahalanobis distance, however, VAS operates on the uncentered second-moment matrix and adaptively selects qq rather than fixing inverse eigenvalue weights.

PCA reconstruction error. Let UrU_r contain the leading rr eigenvectors of ρ\rho. The corresponding PCA residual score is

sPCA,r(x)=∥(I−UrUrT)x∥22=∑j>rzj2.(8)s_{\mathrm{PCA},r}(x)=\left\|(I-U_rU_r^{\mathsf{T}})x\right\|_2^2=\sum_{j>r}z_j^2. \tag*{(8)}

PCA therefore assigns zero weight to the leading rr directions and equal weight to the remaining directions. Kernel PCA applies an analogous reconstruction principle in a kernel feature space. In contrast, VAS uses a smooth spectral weighting without imposing a hard rank cutoff.

Global similarity. For q=2q=2, the VAS score simplifies to

sVAS,2(xi)=−2Tr⁡(ρ2)xiTρxi=−2NTr⁡(ρ2)∑j=1N(xiTxj)2.(9)s_{\mathrm{VAS},2}(x_i)=-\frac{2}{\operatorname{Tr}(\rho^2)}x_i^{\mathsf{T}}\rho x_i =-\frac{2}{N\operatorname{Tr}(\rho^2)}\sum_{j=1}^{N}(x_i^{\mathsf{T}}x_j)^2. \tag*{(9)}

Thus, at q=2q=2, VAS is ranking-equivalent to negative average squared cosine similarity, favoring samples that are globally dissimilar to the dataset.

VAS is related to classical spectral detectors, but its weighting arises from the leave-one-out influence of a sample on dataset diversity. Rather than prescribing a fixed spectral filter, VAS adapts its weighting to the dataset through the Vendi Score order qq.

Proof of Proposition 3.2

Since P=∑c=1KπcPcP = \sum_{c=1}^{K} \pi_c P_c, we have

ρ=Ex∼P[xx⊤]=∑c=1KπcEx∼Pc[xx⊤]=∑c=1Kπcρc.\rho= \mathbb{E}_{x\sim P}[xx^{\top}] = \sum_{c=1}^{K} \pi_c \mathbb{E}_{x\sim P_c}[xx^{\top}] = \sum_{c=1}^{K} \pi_c \rho_c.

Because each component PcP_c is supported on subspace UcU_c, the operator ρc\rho_c is supported on UcU_c. Since the subspaces are mutually orthogonal, ρ\rho is block diagonal with block πcρc\pi_c\rho_c on UcU_c. Therefore, for x∈Ucx \in U_c,

ρq−1x=(πcρc)q−1x=πcq−1ρcq−1x.\rho^{q-1}x = (\pi_c\rho_c)^{q-1}x = \pi_c^{q-1}\rho_c^{q-1}x.

Substituting into the definition of GqG_q gives

x⊤Gqx=q(1−q)Tr⁡(ρq)x⊤ρq−1x=q(1−q)Tr⁡(ρq)πcq−1x⊤ρcq−1x.x^{\top}G_qx = \frac{q}{(1-q)\operatorname{Tr}(\rho^q)}x^{\top}\rho^{q-1}x = \frac{q}{(1-q)\operatorname{Tr}(\rho^q)}\pi_c^{q-1}x^{\top}\rho_c^{q-1}x.

Taking expectation over x∼Pcx \sim P_c,

Ex∼Pc[x⊤Gqx]=q(1−q)Tr⁡(ρq)πcq−1Ex∼Pc[x⊤ρcq−1x].\mathbb{E}_{x\sim P_c}[x^{\top}G_qx] = \frac{q}{(1-q)\operatorname{Tr}(\rho^q)}\pi_c^{q-1}\mathbb{E}_{x\sim P_c}[x^{\top}\rho_c^{q-1}x].

Using Ex∼Pc[xx⊤]=ρc\mathbb{E}_{x\sim P_c}[xx^{\top}] = \rho_c,

Ex∼Pc[x⊤ρcq−1x]=Tr⁡(ρcq−1Ex∼Pc[xx⊤])=Tr⁡(ρcq).\mathbb{E}_{x\sim P_c}[x^{\top}\rho_c^{q-1}x] = \operatorname{Tr}(\rho_c^{q-1}\mathbb{E}_{x\sim P_c}[xx^{\top}]) = \operatorname{Tr}(\rho_c^q).

Finally, since

VSq(ρc)=(Tr⁡(ρcq))1/(1−q),\mathrm{VS}_q(\rho_c) = \left(\operatorname{Tr}(\rho_c^q)\right)^{1/(1-q)},

we have

Tr⁡(ρcq)=VSq(ρc)1−q.\operatorname{Tr}(\rho_c^q) = \mathrm{VS}_q(\rho_c)^{1-q}.

Thus

πcq−1Tr⁡(ρcq)=πcq−1VSq(ρc)1−q=(πcVSq(ρc))q−1,\pi_c^{q-1}\operatorname{Tr}(\rho_c^q) = \pi_c^{q-1}\mathrm{VS}_q(\rho_c)^{1-q} = \left(\frac{\pi_c}{\mathrm{VS}_q(\rho_c)}\right)^{q-1},

which proves the claim.

ADBENCH Embedding Datasets

Here we summarize the ADBENCH embedding datasets. For all image datasets, we use embeddings from both ResNet18 [25] and ViT models [16]. For text datasets, we use embeddings from BERT [14] and RoBERTa [35].

  • CIFAR-10 (10 splits): Each split treats one class as normal and the remaining nine classes as anomalies, which are downsampled to 5% of the total dataset. Each split contains 5,263 samples. Results are averaged across all 10 choices of the normal class. Evaluated using both 512- and 1000-dimensional image embeddings.

  • FashionMNIST (10 splits): Same protocol as CIFAR-10, with one class designated as normal and others downsampled to 5% anomalies. Each split contains 6,315 samples. Results are averaged across splits. Evaluated with 512- and 1000-dimensional embeddings.

  • SVHN (10 splits): Same one-class protocol as CIFAR-10. Each split corresponds to a different digit as the normal class, with remaining digits downsampled to 5% anomalies. Sample sizes range from 4,904 to 10,000. Evaluated with 512- and 1000-dimensional embeddings.

  • MNIST-C (16 splits): Corrupted variants of MNIST, where original MNIST images are treated as normal and corrupted versions (e.g., noise, blur, etc.) are treated as anomalies. Each split corresponds to a different corruption type and contains 10,000 samples. Evaluated with 512- and 1000-dimensional embeddings.

  • MVTec-AD (15 splits): Industrial anomaly detection dataset consisting of images of manufactured objects with defects. Each object category (15 total) defines a separate anomaly detection task, where defect-free images are normal and defective images are anomalous. Sample sizes range from 102 to 501 per category. Evaluated with 512- and 1000-dimensional embeddings.

  • 20 Newsgroups (6 splits): For each split, one topic group is treated as normal and the remaining groups are treated as anomalies. The six normal classes are computer, recreation, science, miscellaneous, politics, and religion. Sample sizes are 615, 1,532, 1,657, 2,497, 2,514, and 3,090. Evaluated using 768-dimensional text embeddings.

  • AG News (4 splits): Multi-class news dataset where each split treats one class as normal and the remaining classes are downsampled to 5% anomalies. Each split contains 10,000 samples. Evaluated with 768-dimensional embeddings.

  • Amazon Reviews (1 dataset): Binary sentiment dataset with 10,000 samples. Negative reviews are treated as anomalies and positive reviews as normal. Evaluated using 768-dimensional embeddings.

  • IMDB (1 dataset): Binary sentiment dataset with 10,000 samples. Negative reviews are treated as anomalies and positive reviews as normal. Evaluated using 768-dimensional embeddings.

  • Yelp (1 dataset): Review dataset with 10,000 samples. Reviews with 0–1 stars are treated as anomalies, while 3–4 star reviews are treated as normal. Evaluated using 768-dimensional embeddings.

Baselines

Here we review the baseline methods we compare against. In Figure 4, all baselines were run on a single NVIDIA A6000 GPU with 4 Intel Xeon Gold 5320, 2.20GHz CPUs, with results generated over 25 GPU hours.

IForest. Liu et al. [ [32] introduced Isolation Forest to take advantage of the idea that anomalies are easier to separate than a normal point from the rest of the dataset. IForest builds an ensemble of isolation trees based on random partitions of the feature space, and detects anomalies based on average how many partitions are needed to isolate a sample. The hyperparameters are the number of samples used to build each tree, and the total number of trees. IForest relies on the feature being easy to partition, which may not be true when features are highly correlated.

DIF. Xu et al. [ [60] improved on IForest by noting that the linear partitions are not expressive enough for most datasets. The resulting method, Deep Isolation Forest (DIF), augments isolation forests with random deep representations: instead of directly applying axis-parallel splits in the input space, DIF first maps data through an ensemble of randomly initialized neural networks, and then applies standard isolation trees in this transformed space.

DIF is primarily designed for tabular data where nonlinear feature transformations must be learned. On embedding datasets, the representation are already highly expressive and semantically structured. Applying additional random neural projections can distort this geometry, potentially destroying meaningful similarity structure and degrading distance-based anomaly signals. As a result, DIF may offer limited benefit on high-quality embedding datasets, while incurring additional computational overhead.

LOF. Breunig et al. [ [7] designed Local Outlier Factor (LOF) to detect anomalies based on local neighborhoods. In particular, LOF measures how dense a sample’s neighborhood is relative to its nearest neighbors. The main assumption is that anomalies will have significantly less dense neighborhoods than their neighbors. This identifies anomalies at a local level, but will ignore global structure, and requires the explicit construction of neighborhoods based on a fixed nearest-neighbor cutoff kk. LOF requires O(N2)O(N^{2}) complexity to construct the nearest-neighbor distances.

DN2. K-Nearest Neighbors on neural embeddings was explored by Bergman et al. [ [5] as a simple heuristic for anomaly detection. Anomaly scores are computed as the average distance between a test embedding and its kk nearest neighbors in the training set. Identifying the nearest neighbors requires O(N2)O(N^2) time and similar to LOF, requires the construction of explicit local neighborhoods that ignore global structure.

GMD. Gaussian feature modeling has been used for anomaly detection in pretrained deep feature spaces [51]. To this idea to our fully unsupervised setting, where the unlabeled data may be multi-modal and contaminated, we use a Gaussian-mixture Mahalanobis distance baseline. We fit a GMM with a tied covariance matrix Σ\Sigma, select the number of components KK by BIC, assign each sample xx to its most likely component with mean μk\mu_k, and score it by

d(x)=(x−μk)⊤Σ−1(x−μk),d(x) = (x - \mu_k)^\top\Sigma^{-1}(x - \mu_k),

with larger values indicating greater deviation from the learned feature distribution. The main computational cost is EM fitting, which scales as O(TKND2)O(T K N D^2) for TT iterations, KK components, NN samples, and dimension DD. Following recommendations for Mahalanobis scoring in deep feature spaces [39], we apply GMD to ℓ2\ell_2-normalized features.

SLAD. Scale Learning for Anomaly Detection (SLAD) is a deep learning approach for identifying anomalies [61]. It learns representations by introducing auxiliary supervisory signals derived from scale consistency, encouraging the model to produce embeddings that are invariant across randomly sampled feature subspaces. SLAD constructs multiple random subspaces of the input features and trains a neural network to predict consistent representations across these subspaces, thereby capturing stable patterns of normal data while amplifying deviations for anomalies. To improve robustness, SLAD uses an ensemble of subspace learners, where each model operates on different sampled feature subsets and their outputs are aggregated into a final anomaly score.

ADERH. Adaptive Density Estimation via Random Hyperspheres (ADERH) is an unsupervised anomaly detection method that estimates local data density by constructing an ensemble of random hyperspheres in feature space [17]. Each hypersphere is defined by a randomly sampled center and radius, and its contribution is weighted based on how many training points fall inside it. Regions that consistently contain many points across sampled hyperspheres are considered high-density (normal), while points that fall into few or low-density hyperspheres are assigned higher anomaly scores. This ensemble-based strategy allows ADERH to approximate complex density structure without explicitly fitting a parametric model, and aligns with the general principle that anomalies correspond to low-density regions in the data. ADERH’s complexity is O(N⋅M⋅D)O(N \cdot M \cdot D), where NN is the number of samples, MM is the number of hyperspheres, and DD is the feature dimension.

ADERH implicitly assumes that normal data can be well-approximated by a union of compact, spherical regions that are separable from anomalies. While this assumption is often reasonable for tabular data, it breaks down in modern embedding spaces. Embeddings tend to lie on continuous, dense manifolds rather than forming isolated clusters [18]. As a result, while ADERH can perform strongly on structured tabular datasets, it may be less appropriate for anomaly detection on modern embedding representations.

LODA. Lightweight On-line Detector of Anomalies (LODA) is an ensemble, training-free approach for anomaly detection based on sparse random projections [49]. Specifically, it projects high-dimensional data into many one-dimensional subspaces, fits simple histogram-based density estimators in each projection, and aggregates these to estimate the overall likelihood of a sample. LODA is quite fast: the runtime scales with O(NMD)O(NMD) for building MM projections and histograms in DD dimensions.

LODA assumes that meaningful structure can be captured through the random projections and corresponding densities. While this may be reasonable for tabular data, it breaks down in embedding spaces where information is distributed across many correlated dimensions and lies on a structured manifold. Random projections to 1D can destroy this geometry, making density estimates unreliable and reducing anomaly separability.

KPCA. Fang et al. [2025] demonstrated that Kernel PCA reconstruction errors can be a useful signal for OOD detection. Here, we apply their approach to anomaly detection. The KPCA approach uses a fused cosine-gaussian kernel to fit the data and compute reconstruction errors. Fang et al. [2025] showed that these errors can be computed efficiently for OOD detection using Random Fourier Features (RFFs). In all, this approach has time complexity O(NDm)O(NDm) for an NN sample dataset in DD dimensions approximated with a mm-dimensional RFF.

VAS and KPCA both rely on kernels, but use different motivations for anomaly detection. KPCA learns a low-rank approximation of the data and scores anomalies based on reconstruction error, implicitly assuming that normal data lies near a low-dimensional manifold. In contrast, VAS measures how each sample perturbs the eigenvalue spectrum of the similarity matrix. As a result, KPCA is sensitive primarily to deviations from the leading eigenvalues, whereas VAS captures changes to the full spectral distribution, including effects in the tail. This allows VAS to detect anomalies that may lie within the dominant subspace but still alter the overall diversity structure of the dataset.

LUNAR. LUNAR is a graph-neural-network-based local anomaly detector that learns to score samples from their nearest-neighbor graph [21]. It generalizes classical local outlier methods by replacing fixed neighborhood statistics with trainable message passing over local neighborhoods. Unlike fixed neighborhood scores, LUNAR incurs additional cost from constructing the nearest-neighbor graph and training a GNN, but can learn a more adaptive local anomaly score once the graph is built.

DTE. Diffusion Time Estimation (DTE) identifies anomalies based on how diffuse they are from the normal data distribution [36]. DTE estimates the posterior distribution over diffusion time for a given sample, which serves as a proxy for its distance from the data manifold. Intuitively, normal samples lie close to the data manifold and correspond to small diffusion times, while anomalous samples require larger diffusion times (i.e., more noise) to be explained. A neural network is trained to predict this diffusion time, and the anomaly score is given by the predicted mean or mode.

We focus on the categorical parametrization, which models diffusion time as a discrete distribution over bins. This variant is the empirically strongest.

Grid Search Experiment

We perform a discrete grid search over key hyperparameters for each method, while keeping all other settings fixed to their benchmark or paper-specified defaults. Below, we list for each method: (i) the default configuration, (ii) the hyperparameters swept over, and (iii) a brief description of each hyperparameter.

  • ADERH: Default: nestimators=256n_{\mathrm{estimators}} = 256, subset size n=18n = 18. Sweep: nestimators∈{100,200,300}n_{\mathrm{estimators}} \in\{100, 200, 300\}, n∈{8,18,24}n \in\{8, 18, 24\}. Here, nestimatorsn_{\mathrm{estimators}} is the number of hyperspheres in the ensemble, and nn is the number of samples used to define each hypersphere.

  • DIF: Default: nestimators=6n_{\mathrm{estimators}} = 6, nensemble=50n_{\mathrm{ensemble}} = 50. Sweep: nestimators∈{25,50,100}n_{\mathrm{estimators}} \in\{25, 50, 100\}, nensemble∈{2,4,6}n_{\mathrm{ensemble}} \in\{2, 4, 6\}. nestimatorsn_{\mathrm{estimators}} is the number of isolation trees, and nensemblen_{\mathrm{ensemble}} is the number of random neural representations used.

  • DTE (Categorical): Default: num_bins =7= 7 (all other training hyperparameters fixed as in Livernoche et al. [2024]). Sweep: num_bins ∈{3,7,15}\in\{3, 7, 15\}. num_bins is the number of discrete diffusion time bins in the categorical parametrization.

  • IForest: Default: nestimators=100n_{\mathrm{estimators}} = 100, max_samples =256= 256. Sweep: nestimators∈{50,100,200}n_{\mathrm{estimators}} \in\{50, 100, 200\}, max_samples ∈{128,256,512}\in\{128, 256, 512\}. nestimatorsn_{\mathrm{estimators}} is the number of trees, and max_samples is the subsample size used to build each tree.

  • KNN: Default: nneighbors=5n_{\mathrm{neighbors}} = 5 (with internal row-wise ℓ2\ell_2 normalization). Sweep: nneighbors∈{5,10,20}n_{\mathrm{neighbors}} \in\{5, 10, 20\}. nneighborsn_{\mathrm{neighbors}} is the number of nearest neighbors used to compute the anomaly score.

  • LODA: Default: nrandom_cuts=100n_{\mathrm{random\_cuts} } = 100, nbins=10n_{\mathrm{bins}} = 10. Sweep: nrandom_cuts∈{50,100,200}n_{\mathrm{random\_cuts}} \in\{50, 100, 200\}, nbins∈{5,10,25}n_{\mathrm{bins}} \in\{5, 10, 25\}. nrandom_cutsn_{\mathrm{random\_cuts}} is the number of random projections (histograms), and nbinsn_{\mathrm{bins}} is the number of bins per histogram.

  • LOF: Default: nneighbors=20n_{\mathrm{neighbors}} = 20. Sweep: nneighbors∈{5,10,20,40}n_{\mathrm{neighbors}} \in\{5, 10, 20, 40\}. nneighborsn_{\mathrm{neighbors}} is the number of neighbors used to estimate local density.

  • kPCA: Default: γ=2.5\gamma= 2.5, rff_dim =4096= 4096, exp_var_ratio =0.5= 0.5. Sweep: γ∈{2.0,2.5,3.0}\gamma\in\{2.0, 2.5, 3.0\}, exp_var_ratio ∈{0.5,0.7,0.9}\in\{0.5, 0.7, 0.9\}. γ\gamma controls the kernel bandwidth, rff_dim is the number of random Fourier features, and exp_var_ratio is the fraction of variance retained in PCA.

  • SLAD: Default: nensemble=20n_{\mathrm{ensemble}} = 20, subspace_pool_size =50= 50. Sweep: nensemble∈{10,20,50}n_{\mathrm{ensemble}} \in\{10, 20, 50\}, subspace_pool_size ∈{25,50,100}\in\{25, 50, 100\}. nensemblen_{\mathrm{ensemble}} is the number of subspace learners, and subspace_pool_size is the number of candidate feature subspaces.

  • LUNAR: Default: nneighbors=5n_{\mathrm{neighbors}} = 5, sampling strategy = mixed. Sweep: nneighbors∈{5,10,20}n_{\mathrm{neighbors}} \in\{5, 10, 20\}, sampling strategy ∈{subspace,mixed,uniform}\in\{\text{subspace}, \text{mixed}, \text{uniform}\}. nneighborsn_{\mathrm{neighbors}} is the number of neighbors used when constructing the KNN graph, and sampling strategy describes how the contrastive samples are constructed.

In tables 4 and 5, we report results using the best-performing configuration within the specified grid.

Alternative Heuristics for VAS

We evaluate the sensitivity of VAS to alternative data-dependent heuristics for selecting the Vendi Score order qq. Our default rule is q=max⁡{2(1−λ1),0.1}q = \max\{2(1-\lambda_1), 0.1\}, where λ1\lambda_1 is the largest eigenvalue of the trace-normalized feature covariance matrix ρ\rho.

We consider three families of alternatives:

qslope(a)=max⁡{a(1−λ1),0.1},a∈{1,5},(10)q_{\mathrm{slope}}(a) = \max\{a(1-\lambda_1), 0.1\}, \qquad a \in\{1,5\}, \tag*{(10)}
qtop(k)=max⁡{2(1−∑j=1kλj),0.1},k∈{5,10},(11)q_{\mathrm{top}}(k) = \max\left\{2\left(1-\sum_{j=1}^{k}\lambda_j\right), 0.1\right\}, \qquad k \in\{5,10\}, \tag*{(11)}
qVS1=max⁡{2VS1(ρ)D,0.1}.(12)q_{\mathrm{VS}_1} = \max\left\{\frac{2\mathrm{VS}_1(\rho)}{D}, 0.1\right\}. \tag*{(12)}

The slope variants modify the scaling factor in our default rule, while the top-kk variants use the cumulative mass of the leading eigenvalues. The normalized Vendi Score heuristic instead uses the effective spectral dimension, where VS1(ρ)=exp⁡(−∑jλjlog⁡λj)\mathrm{VS}_1(\rho) = \exp(-\sum_j \lambda_j \log\lambda_j). We retain the lower bound of 0.1 for numerical stability.

Table 6 shows that our default heuristic is robust to several reasonable changes in the adaptation rule. Modifying the scaling factor from 2 to 1, or using the cumulative mass of the top 5 or 10 eigenvalues, produces similar AUROC values, with no statistically significant differences under the paired Wilcoxon tests. In contrast, increasing the scaling factor to 5 or using the normalized VS1\mathrm{VS}_1 heuristic yields significantly worse performance. These results support the effectiveness of our simple default rule while indicating that VAS does not depend strongly on its precise formulation.

DatasetEncoderAdaptiveSlope-1Slope-5VS1/DVS_{1}/DTop-5Top-10
CIFAR-10ResNet180.7450.7320.7250.7110.7370.729
CIFAR-10ViT0.9410.9140.9430.8940.9190.911
FashionMNISTResNet180.9110.9080.8760.8970.9070.903
FashionMNISTViT0.9300.9280.9100.9260.9290.928
MNIST-CResNet180.7930.7940.7550.7910.7940.793
MNIST-CViT0.7390.7410.7370.7430.7400.741
MVTec-ADResNet180.7990.8000.7940.7900.8000.800
MVTec-ADViT0.8960.9000.8730.9040.9000.900
SVHNResNet180.6570.6560.6330.6460.6550.652
SVHNViT0.5790.5850.5460.5890.5850.586
20NewsBERT0.6260.6290.6130.6300.6290.629
20NewsRoBERTa0.7490.7490.7490.7500.7490.749
AG NewsBERT0.6760.6780.6630.6800.6780.678
AG NewsRoBERTa0.8810.8810.8810.8810.8810.881
AmazonBERT0.6080.6080.6070.6080.6080.608
AmazonRoBERTa0.5440.5440.5440.5440.5440.544
IMDBBERT0.5020.5010.5070.4990.5010.501
IMDBRoBERTa0.5300.5300.5300.5290.5300.530
YelpBERT0.6790.6790.6780.6790.6790.679
YelpRoBERTa0.5660.5660.5660.5660.5660.566
Wilcoxon p-value–0.3991.46×10−131.46 \times10^{-13}0.00580.3710.0728

Table 6. Sensitivity of VAS to alternative adaptive rules for selecting qq across 148 ADBENCH benchmark instances. AUROC values are averaged across dataset splits for each dataset–encoder combination. Mean AUROC is computed across all benchmark instances. The bottom row reports unadjusted, one-sided paired Wilcoxon tests comparing our default adaptive rule against each alternative, with the alternative hypothesis that our default achieves higher AUROC.

Anomaly Detection Across Different Anomaly Types

Han et al. [ [23] define four types of anomalies: local, global, dependency, and clustered anomalies. Our ImageNet experiments investigate clustered anomalies: coherent anomalous subpopulations. Here we evaluate VAS on three additional constructions inspired by the remaining anomaly types. We create realistic anomalies using data from ADBENCH embedding datasets to construct anomalies with different geometric properties.

We evaluate four datasets (CIFAR-10, SVHN, 20News, and AG News), each with two embedding architectures, and compare VAS against five representative baselines: GMD, DN2, KPCA, LOF, and SLAD. Across all tables, we report mean AUROC over five independent trials and the average rank of each method across the eight dataset–encoder combinations.

Local Anomalies. We first investigate local anomalies - those that deviate from their local neighborhood. To construct these, we identify samples that are semantically different from a normal class but appear plausible under its local distribution. For each dataset, we split embeddings into fit and hold-out sets, fit one Gaussian per class, and assign each held-out sample to its highest-likelihood class.

For each predicted class cc, we form a dataset from samples assigned to cc. True-cc samples are normal; misclassified samples are anomalous. These are local anomalies because they lie in cc’s region rather than being globally isolated.

Global Directional Anomalies. We next investigate anomalies that deviate from the global geometry of the normal data. We compute class-centroid directions from the genuine embeddings and define the subspace spanned by these centroids. For each anomaly, we sample a random Gaussian direction z⊥z_{\perp} and project it onto the orthogonal complement of this subspace. Given a normalized genuine embedding tt, we construct an anomalous direction as

xanom=normalize⁡((1−α)t+αz⊥),(13)x_{\mathrm{anom}} = \operatorname{normalize}((1-\alpha)t+\alpha z_{\perp}), \tag*{(13)}

and restore the original embedding norm.

The parameter α\alpha controls the magnitude of the directional perturbation. We report results for α=0.1\alpha= 0.1, representing a relatively small departure from the original embedding direction. Each trial contains 2,500 genuine normal observations and 278 synthesized anomalies, corresponding to approximately 10% contamination. Results are averaged across five independent trials.

Feature-Dependency Anomalies. Finally, we investigate anomalies that preserve feature marginals while breaking feature dependence.. For each semantic class, we sample up to 2,500 genuine embeddings, normalize them to unit length, and apply a random orthogonal rotation. We divide the rotated features into four approximately equal-sized blocks.

To construct an anomaly, we replace one randomly selected block with the corresponding block from a different observation. We then apply the inverse rotation and normalize the resulting embedding. This construction combines feature blocks from normal observations while disrupting their joint structure. We generate approximately 10% anomalies and average results across all available semantic classes and five random trials. For classes with fewer observations, sample counts are reduced accordingly.

Overall, VAS achieves the best average rank across all three anomaly constructions. It performs particularly well on global directional anomalies and on feature-dependency anomalies in text embeddings. For image-based dependency anomalies, LOF is also highly competitive. Local class-confusable anomalies are substantially more challenging across methods, although VAS retains the strongest average rank. These experiments provide complementary evidence of VAS’s ability to identify different forms of anomalous structure in pretrained embedding spaces.

DatasetEncoderVASGMDDN2KPCALOFSLAD
CIFAR-10ResNet180.5570.5610.5710.5740.5440.551
CIFAR-10ViT0.7330.7230.7190.7210.6590.727
SVHNResNet180.6100.6100.6170.6170.5790.600
SVHNViT0.5520.5430.5350.5430.5390.543
20NewsBERT0.5550.5600.5260.5250.5250.548
20NewsRoBERTa0.6040.5600.5600.5610.5360.538
AG NewsBERT0.6610.6080.6090.6090.6200.632
AG NewsRoBERTa0.6600.5890.6420.6300.6240.605
Average Rank1.813.633.563.065.193.75

Table 7. AUROC for local class-confusable anomalies constructed from genuine ADBENCH embeddings. Results are averaged across assigned-class subsets and five independent trials. Anomaly rates vary with class overlap. Average ranks are computed across dataset–encoder combinations (lower is better).

DatasetEncoderVASGMDDN2KPCALOFSLAD
CIFAR-10ResNet180.5780.5610.1880.4330.5170.530
CIFAR-10ViT0.5260.5310.1940.2150.5210.488
SVHNResNet180.6690.5580.2890.5540.5300.560
SVHNViT0.9560.5850.2720.6070.5720.586
20NewsBERT0.9960.7190.7270.7460.9190.924
20NewsRoBERTa1.0000.9951.0001.0000.9561.000
AG NewsBERT0.9910.7120.6570.7520.9320.896
AG NewsRoBERTa1.0001.0001.0001.0001.0001.000
Average Rank1.633.695.133.753.942.88

Table 8. AUROC for global directional anomalies constructed by perturbing embeddings outside the span of normal-class centroids. Results use α=0.1\alpha= 0.1 and approximately 10% contamination, averaged across five trials. Average ranks are computed across dataset–encoder combinations (lower is better).

DatasetEncoderVASGMDDN2KPCALOFSLAD
CIFAR-10ResNet180.8250.7890.8440.8640.8940.747
CIFAR-10ViT0.8280.7480.7930.8250.8470.669
SVHNResNet180.8580.7780.8510.8410.8790.791
SVHNViT0.9590.6940.7990.8180.8350.716
20NewsBERT0.9220.6850.8140.7440.8950.775
20NewsRoBERTa0.9850.5490.7280.7790.7620.628
AG NewsBERT0.9170.6640.7540.7360.9100.770
AG NewsRoBERTa0.9990.5310.8100.8140.8270.611
Average Rank1.635.753.633.381.754.88

Table 9. AUROC for feature-dependency anomalies constructed by swapping blocks of orthogonally rotated embeddings. Results use approximately 10% contamination and are averaged across semantic classes and five trials. Average ranks are computed across dataset–encoder combinations (lower is better).

References

  1. [1]Mohiuddin Ahmed, Nazim Choudhury, and Shahadat Uddin. Anomaly detection on big data in financial markets. In Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, pages 998–1001, 2017.DOI
  2. [3]Tharindu R Bandaragoda, Kai Ming Ting, David Albrecht, Fei Tony Liu, and Jonathan R Wells. Efficient anomaly detection by isolation using nearest neighbour ensemble. In 2014 IEEE International conference on data mining workshop, pages 698–705. IEEE, 2014.DOI
  3. [4]Roberto Barceló, Cristóbal Alcázar, and Felipe Tobar. Avoiding mode collapse in diffusion models fine-tuned with reinforcement learning. arXiv preprint arXiv:2410.08315, 2024.arxiv.org/abs/2410.08315
  4. [5]Liron Bergman, Niv Cohen, and Yedid Hoshen. Deep nearest neighbor anomaly detection. arXiv preprint arXiv:2002.10445, 2020.arxiv.org/abs/2002.10445
  5. [6]Paul Bergmann, Michael Fauser, David Sattlegger, and Carsten Steger. Mvtec ad–a comprehensive real-world dataset for unsupervised anomaly detection. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 9592–9600, 2019.DOI
  6. [7]Markus M Breunig, Hans-Peter Kriegel, Raymond T Ng, and Jörg Sander. LoF: identifying density-based local outliers. In Proceedings of the 2000 ACM SIGMOD international conference on Management of data, pages 93–104, 2000.
  7. [8]Elizabeth G Campolongo, Yuan-Tang Chou, Ekaterina Govorkova, Wahid Bhimji, Wei-Lun Chao, Chris Harris, Shih-Chieh Hsu, Hilmar Lapp, Mark S Neubauer, Josephine Namayanja, et al. Building machine learning challenges for anomaly detection in science. arXiv preprint arXiv:2503.02112, 2025.arxiv.org/abs/2503.02112
  8. [9]Yang Cao, Sikun Yang, Chen Li, Haolong Xiang, Lianyong Qi, Bo Liu, Rongsheng Li, and Ming Liu. Tad-bench: A comprehensive benchmark for embedding-based text anomaly detection. arXiv preprint arXiv:2501.11960, 2025.arxiv.org/abs/2501.11960
  9. [10]Varun Chandola, Arindam Banerjee, and Vipin Kumar. Anomaly detection: A survey. ACM computing surveys (CSUR), 41(3):1–58, 2009.
  10. [11]Wei Dai, Kai Hwang, and Jicong Fan. Unsupervised anomaly detection for tabular data using noise evaluation. arXiv preprint arXiv:2412.11461, 2024.arxiv.org/abs/2412.11461
  11. [12]Alan DenAdel, Madeline Hughes, Akshaya Thoutam, Anay Gupta, Andrew W Navia, Nicolo Fusi, Srivatsan Raghavan, Peter S Winter, Ava P Amini, and Lorin Crawford. Evaluating the role of pre-training dataset size and diversity on single-cell foundation model performance. bioRxiv, pages 2024–12, 2025.DOI
  12. [13]Jia Deng, Wei Dong, Richard Socher, Li-Jia Li, Kai Li, and Li Fei-Fei. Imagenet: A large-scale hierarchical image database. In 2009 IEEE conference on computer vision and pattern recognition, pages 248–255. Ieee, 2009.
  13. [14]Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. Bert: Pre-training of deep bidirectional transformers for language understanding. In Proceedings of the 2019 conference of the North American chapter of the association for computational linguistics: human language technologies, volume 1 (long and short papers), pages 4171–4186, 2019.arxiv.org/abs/1810.04805
  14. [15]Adji Bousso Dieng and Amey Pasarkar. A unified and predictive measure of functional diversity. arXiv preprint arXiv:2509.16133, 2025.arxiv.org/abs/2509.16133
  15. [16]Alexey Dosovitskiy, Lucas Beyer, Alexander Kolesnikov, Dirk Weissenborn, Xiaohua Zhai, Thomas Unterthiner, Mostafa Dehghani, Matthias Minderer, Georg Heigold, Sylvain Gelly, et al. An image is worth 16x16 words: Transformers for image recognition at scale. arXiv preprint arXiv:2010.11929, 2020.arxiv.org/abs/2010.11929
  16. [17]Walid Durani, Collin Leiber, Khalid Durani, Claudia Plant, and Christian Böhm. Anomaly detection by an ensemble of random pairs of hyperspheres. In The Thirty-ninth Annual Conference on Neural Information Processing Systems, 2025. URL https://openreview.net/forum?id=vM4PIjsJDG.DOI
  17. [18]Kawin Ethayarajh. How contextual are contextualized word representations? comparing the geometry of bert, elmo, and gpt-2 embeddings. In Proceedings of the 2019 conference on empirical methods in natural language processing and the 9th international joint conference on natural language processing (EMNLP-IJCNLP), pages 55–65, 2019.arxiv.org/abs/1909.00512
  18. [19]Kun Fang, Qinghua Tao, Mingzhen He, Kexin Lv, Runze Yang, Haibo Hu, Xiaolin Huang, Jie Yang, and Longbin Cao. Kernel pca for out-of-distribution detection: Non-linear kernel selections and approximations. arXiv preprint arXiv:2505.15284, 2025.DOI
  19. [20]Dan Friedman and Adji Bousso Dieng. The vendi score: A diversity evaluation metric for machine learning. arXiv preprint arXiv:2210.02410, 2022.
  20. [21]Adam Goodge, Bryan Hooi, See-Kiong Ng, and Wee Siong Ng. Lunar: Unifying local outlier detection methods via graph neural networks. In Proceedings of the AAAI conference on artificial intelligence, volume 36, pages 6737–6745, 2022.
  21. [22]Sudipto Guha, Nina Mishra, Gourav Roy, and Okke Schrijvers. Robust random cut forest based anomaly detection on streams. In International conference on machine learning, pages 2712–2721. PMLR, 2016.
  22. [23]Songqiao Han, Xiyang Hu, Hailiang Huang, Minqi Jiang, and Yue Zhao. Adbench: Anomaly detection benchmark. Advances in neural information processing systems, 35:32142–32159, 2022.
  23. [24]Sahand Hariri, Matias Carrasco Kind, and Robert J Brunner. Extended isolation forest. IEEE transactions on knowledge and data engineering, 33(4):1479–1489, 2019.DOI
  24. [25]Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 770–778, 2016.arxiv.org/abs/1512.03385
  25. [26]Ruining He and Julian McAuley. Ups and downs: Modeling the visual evolution of fashion trends with one-class collaborative filtering. In proceedings of the 25th international conference on world wide web, pages 507–517, 2016.
  26. [27]Dan Hendrycks and Kevin Gimpel. A baseline for detecting misclassified and out-of-distribution examples in neural networks. arXiv preprint arXiv:1610.02136, 2016.
  27. [28]Xiuyuan Hu, Xuege Hou, Guoqing Liu, Yang Zhao, Jieran Li, Dongbiao Sun, José Miguel Hernández-Lobato, Hao Zhang, and Xue Liu. Evaluating the diversity of ai-generated content with diversity profiles. arXiv preprint arXiv:2608.17731, 2026.arxiv.org/abs/2608.17731
  28. [29]Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images. 2009.
  29. [30]Kimin Lee, Kibok Lee, Honglak Lee, and Jinwoo Shin. A simple unified framework for detecting out-of-distribution samples and adversarial attacks. Advances in neural information processing systems, 31, 2018.
  30. [31]Boyang Liu, Ding Wang, Kaixiang Lin, Pang-Ning Tan, and Jiayu Zhou. Rca: A deep collaborative autoencoder approach for anomaly detection. In IJCAI: proceedings of the conference, volume 2021, page 1505, 2021.
  31. [32]Fei Tony Liu, Kai Ming Ting, and Zhi-Hua Zhou. Isolation forest. In 2008 eighth ieee international conference on data mining, pages 413–422. IEEE, 2008.
  32. [33]Weitang Liu, Xiaoyun Wang, John Owens, and Yixuan Li. Energy-based out-of-distribution detection. Advances in neural information processing systems, 33:21464–21475, 2020.arxiv.org/abs/2010.03759
  33. [34]Xixi Liu, Yaroslava Lochman, and Christopher Zach. Gen: Pushing the limits of softmax-based out-of-distribution detection. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 23946–23955, 2023.
  34. [35]Yinhan Liu, Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen, Omer Levy, Mike Lewis, Luke Zettlemoyer, and Veselin Stoyanov. Roberta: A robustly optimized bert pretraining approach. arXiv preprint arXiv:1907.11692, 2019.
  35. [36]Victor Livernoche, Vineet Jain, Yashar Hezaveh, and Siamak Ravanbakhsh. On diffusion modeling for anomaly detection. In The Twelfth International Conference on Learning Representations, page 7999, 2024.
  36. [37]Jiangang Ma, Le Sun, Hua Wang, Yanchun Zhang, and Uwe Aickelin. Supervised anomaly detection in uncertain pseudoperiodic data streams. ACM Transactions on Internet Technology (TOIT), 16 (1):1–20, 2016.
  37. [38]Norman Mu and Justin Gilmer. Mnist-c: A robustness benchmark for computer vision. arXiv preprint arXiv:1906.02337, 2019.arxiv.org/abs/1906.02337
  38. [39]Maximilian Mueller and Matthias Hein. Mahalanobis++: Improving ood detection via feature normalization. arXiv preprint arXiv:2505.18032, 2025.
  39. [40]Ali Bou Nassif, Manar Abu Talib, Qassim Nasir, and Fatima Mohamad Dakalbab. Machine learning for anomaly detection: A systematic review. Ieee Access, 9:78658–78700, 2021.
  40. [41]Mehdi Neshat, Menasha Thilakaratne, Mohammed El-Abd, Seyedali Mirjalili, Amir H Gandomi, and John Boland. Smart buildings energy consumption forecasting using adaptive evolutionary bagging extra tree learning models. Energy, page 137130, 2025.DOI
  41. [42]Yuval Netzer, Tao Wang, Adam Coates, Alessandro Bissacco, Baolin Wu, Andrew Y Ng, et al. Reading digits in natural images with unsupervised feature learning. In NIPS workshop on deep learning and unsupervised feature learning, volume 2011, page 4. Granada, 2011.
  42. [44]Bjarke Frost Nielsen, Amey P Pasarkar, Qiqi Yang, Bryan T Grenfell, and Adji Bousso Dieng. Applications of the vendi score in genomic epidemiology. arXiv preprint arXiv:2509.22520, 2025.arxiv.org/abs/2509.22520
  43. [45]Guansong Pang, Chunhua Shen, Longbing Cao, and Anton Van Den Hengel. Deep learning for anomaly detection: A review. ACM computing surveys (CSUR), 54(2):1–38, 2021.DOI
  44. [46]Amey P Pasarkar and Adji Bousso Dieng. Cousins of the vendi score: A family of similarity-based diversity metrics for science and machine learning. arXiv preprint arXiv:2310.12952, 2023.arxiv.org/abs/2310.12952
  45. [47]Amey P Pasarkar and Adji Bousso Dieng. Vendi novelty scores for out-of-distribution detection. arXiv preprint arXiv:2602.10062, 2026.arxiv.org/abs/2602.10062
  46. [48]Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, et al. Scikit-learn: Machine learning in python. the Journal of machine Learning research, 12:2825–2830, 2011.arxiv.org/abs/1201.0490
  47. [49]Tomáš Pevný. Loda: Lightweight on-line detector of anomalies. Machine Learning, 102(2):275–304, 2016.DOI
  48. [50]Tal Reiss, Niv Cohen, Liron Bergman, and Yedid Hoshen. Panda: Adapting pretrained features for anomaly detection and segmentation. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 2806–2814, 2021.arxiv.org/abs/2010.05903
  49. [51]Oliver Rippel, Patrick Mertens, and Dorit Merhof. Modeling the distribution of normal data in pre-trained deep features for anomaly detection. In 2020 25th International Conference on Pattern Recognition (ICPR), pages 6726–6733. IEEE, 2021.arxiv.org/abs/2005.14140
  50. [52]Lukas Ruff, Robert Vandemeulen, Nico Goernitz, Lucas Deecke, Shoaib Ahmed Siddiqui, Alexander Binder, Emmanuel Müller, and Marius Kloft. Deep one-class classification. In International conference on machine learning, pages 4393–4402. PMLR, 2018.
  51. [53]Oriane Siméoni, Huy V. Vo, Maximilian Seitzer, Federico Baldassarre, Maxime Oquab, Cijo Jose, Vasil Khalidov, Marc Szafraniec, Seungeun Yi, Michaël Ramamonjisoa, Francisco Massa, Daniel Haziza, Luca Wehrstedt, Jianyuan Wang, Timothée Darcet, Théo Moutakanni, Leonel Sentana, Claire Roberts, Andrea Vedaldi, Jamie Tolan, John Brandt, Camille Couprie, Julien Mairal, Hervé Jégou, Patrick Labatut, and Piotr Bojanowski. DINOv3, 2025. URL https://arxiv.org/abs/2508.10104.
  52. [54]George Stein, Jesse Cresswell, Rasa Hosseinzadeh, Yi Sui, Brendan Ross, Valentin Villecroze, Zhaoyan Liu, Anthony L Caterini, Eric Taylor, and Gabriel Loaiza-Ganem. Exposing flaws of generative model evaluation metrics and their unfair treatment of diffusion models. Advances in Neural Information Processing Systems, 36:3732–3784, 2023.arxiv.org/abs/2306.04675
  53. [55]Yiyou Sun, Yifei Ming, Xiaojin Zhu, and Yixuan Li. Out-of-distribution detection with deep nearest neighbors. In International conference on machine learning, pages 20827–20840. PMLR, 2022.arxiv.org/abs/2204.06507
  54. [57]Shay Vargaftik, Isaac Keslassy, Ariel Orda, and Yaniv Ben-Itzhak. Rade: resource-efficient supervised anomaly detection using decision tree-based ensemble methods. Machine Learning, 110(10):2835–2866, 2021.arxiv.org/abs/1909.11877
  55. [58]Haoqi Wang, Zhizhong Li, Litong Feng, and Wayne Zhang. Vim: Out-of-distribution with virtual-logit matching. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 4921–4930, 2022.arxiv.org/abs/2203.10807
  56. [59]Hu Wang, Guansong Pang, Chunhua Shen, and Congbo Ma. Unsupervised representation learning by predicting random distances. arXiv preprint arXiv:1912.12186, 2019.arxiv.org/abs/1912.12186
  57. [60]Hongzuo Xu, Guansong Pang, Yijie Wang, and Yongjun Wang. Deep isolation forest for anomaly detection. IEEE transactions on knowledge and data engineering, 35(12):12591–12604, 2023a.DOI
  58. [61]Hongzuo Xu, Yijie Wang, Juhui Wei, Songlei Jian, Yizhou Li, and Ning Liu. Fascinating supervisory signals and where to find them: Deep anomaly detection with scale learning. In International Conference on Machine Learning, pages 38655–38673. PMLR, 2023b.arxiv.org/abs/2305.16114
  59. [62]Jingkang Yang, Pengyun Wang, Dejian Zou, Zitang Zhou, Kunyuan Ding, Wenxuan Peng, Haoqi Wang, Guangyao Chen, Bo Li, Yiyou Sun, et al. Openood: Benchmarking generalized out-of-distribution detection. Advances in Neural Information Processing Systems, 35:329598–32611, 2022.arxiv.org/abs/2210.07242
  60. [63]Yuming Yang, Yang Nan, Junjie Ye, Shihan Dou, Xiao Wang, Shuo Li, Huijie Lv, Tao Gui, Qi Zhang, and Xuan-Jing Huang. Measuring data diversity for instruction tuning: A systematic analysis and a reliable metric. In Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 18530–18549, 2025.
  61. [65]Xiang Zhang, Junbo Zhao, and Yann LeCun. Character-level convolutional networks for text classification. Advances in neural information processing systems, 28, 2015.arxiv.org/abs/1509.01626

Paper details

vlnc:W_emt7kuvb
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 5

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

generative AI tools

View statement
Looking for related papers…
Contents