- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes GOOD, a meta-learning framework that selects both an anomaly detection algorithm and its hyperparameter configuration for a new unlabeled dataset. Each dataset is represented by sample-wise similarity graphs built with Gaussian kernels at multiple scales, and WL similarities and Minimum Factorization Distances against historical graphs form a task representation. An MLP meta-learner maps this representation to the predicted performance of 358 candidate (algorithm, configuration) pairs. Evaluation covers 47 tabular and 61 image-embedding tasks derived from ADBench, with leave-one-out experiments, representation ablations, and domain and modality transfer studies. The main contribution is the graph-induced task representation within an established offline-online meta-selection framework.
Critical strengths
The graph-induced task representation is a concrete and well-validated answer to a real bottleneck in meta-learning-based selection. The tabular AUPRC result is the strongest evidence: GOOD reaches 64.44% against 57.79% for ISAC, 56.31% for MetaOOD, and 54.80% for ELECT, with paired tests supporting the differences, and the AUPRC metric is the informative one under class imbalance. The analysis in Section 4.2, showing that WL similarity tracks detector-ranking similarity substantially better than MetaOD features, gives direct quantitative support for why the representation works, and the authors appropriately describe this relationship as inductive rather than guaranteed.
The empirical study is more complete than is typical for this line of work. Scale and measurement ablations, alternative graph constructions, meta-learner comparisons, and the domain-exclusion and cross-modality transfer experiments together examine the contribution from several angles instead of reporting a single aggregate table. The finding that performance is largely insensitive to excluding same-domain datasets from the history, and drops only about 2% under full modality exchange, is practically important for deployment.
Critical weaknesses
- The paper does not position the problem against the current generation of tabular and anomaly detection foundation models. The candidate pool contains only classical and earlier deep detectors, and no foundation model appears as a candidate, a baseline, or even a discussion point. Since these models also operate without labels on the new task, the practical question a reader is left with is when one should run meta-learned selection over a legacy pool at all, rather than applying a strong foundation model directly. The paper should at least report where the pool's empirical upper bound stands relative to such models, and discuss whether foundation models can be included as pool members.
Relatedly, the method assumes a strictly label-free new task; it neither uses nor discusses the common intermediate case where a few labeled anomalies are available, in which direct candidate evaluation may dominate. The boundary of the intended setting remains undefined.
-
Two further issues affect the reliability of specific claims. MetaOD's tabular AUROC of 65.18 is almost ten points below simply running KNN (74.74), which is inconsistent with MetaOD's published behavior and suggests a baseline implementation or adaptation problem; since Table 2 is the main evidence, this needs verification.
-
As a minor presentation request, Table 1 is difficult to read at its current font size and Figure 4 could be made more compact.
Questions for authors
-
How does the pool and its empirical upper bound compare to current tabular and anomaly detection foundation models on the same tasks, and can such models be added as pool members?
-
Can the framework exploit a small number of labeled anomalies on the new task, or should it be understood as strictly label-free?
-
Please describe the per-fold construction of the reference-based features, including whether the held-out task's reference column, graph-threshold contribution, and preprocessing statistics are excluded, and identify any intentionally transductive steps.
-
Please also verify the MetaOD configuration underlying Table 2, since its reported performance falls well below both its published results and a default KNN detector.
Thank you for the detailed response. The additional UniOD comparison and the fold-wise feature-construction clarification address much of my concern.
One remaining issue is that the UniOD results appear to be taken from the original paper rather than reproduced under the same experimental environment as GOOD. If so, I recommend explicitly characterizing this as a cross-paper comparison and clarifying differences in task splits, preprocessing, metric implementation, and runtime accounting. If computationally feasible, a unified rerun would provide stronger evidence. It would also be useful to consider FoMo-0D [1] and OutFormer [2] as additional external baselines or potential pool members, since they are directly relevant zero-shot tabular anomaly detection foundation models.
The weakly supervised extension is a reasonable future direction, but it could be made more concrete. In particular, future work could specify how labels modify the graph construction, how the sampling rate p is selected, how target-task labels are prevented from leaking into training, and how performance varies with the number of labeled anomalies.
These remaining points concern positioning and future work rather than the validity of the main findings. I will therefore maintain my weak acceptance score.
[1] Shen, Wen, and Akoglu. FoMo-0D: A Foundation Model for Zero-shot Tabular Outlier Detection. TMLR, 2025.
[2] Ding, Wen, Klüttermann, and Akoglu. From Zero to Hero: Advancing Zero-Shot Foundation Models for Tabular Outlier Detection. ICML, 2026.