- Rating
- 3
- Confidence
- 4(+1)
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3(+1)
Read review
Paper summary
TaskBridge uses a pretrained tabular foundation model (TFM) for one-class anomaly detection (AD) without updating its weights. From a clean normal reference set, it constructs five families of virtual classification tasks based on attribute prediction, local and global projections, clustering, and distributional extremity. It selects task configurations using held-out normal samples and structural perturbations, then combines calibrated predictive support into an anomaly score. The default backbone is TabICLv2, with framework settings calibrated once on 46 ADBench datasets. Evaluation covers 790 ODDBench datasets, five seeds, and 30 baselines, with additional task ablations, alternative backbones, and context-budget studies. The contribution is a reusable task portfolio that connect supervised in-context prediction to anomaly detection.
Critical strengths
-
My favorite thing about this paper is the approach. I like that the paper makes a meaningful methodological advance through its portfolio of context derived virtual classification tasks for frozen TFMs. Auxiliary prediction and frozen TFM dependency scoring have precedents in SLAD and TabPFN-OD. The distinctive contribution is the integration of profile aware target construction, predictive support selection, and score normalization. Attribute prediction, projections, prototypes, and extremity probe complementary aspects of normal structure, and task configurations are selected without target anomaly labels or backbone updates. Table 9 supports value of this combination: the single-attribute variant obtains mean area under the ROC curve (AUROC) and precision-recall curve (AUPR) of 77.12% and 42.33%, compared with 80.24% and 50.43% for the full system. This provide evidence of useful innovation beyond one auxiliary prediction task (Sections 3.2-3.5, Appendices A.3-A.6, and Table 9).
-
I also appreciate the methodologies portability across pretrained backbones and view this as a significant strength. The framework works with TabICLv2, TabPFN v2.6, and TabPFN v3, allowing existing predictive models to be reused for anomaly detection. More importantly, Table 12 compares TaskBridge with the likelihood-based AD extension usin the same TabPFN v3 backbone. TaskBridge improves mean AUROC from 73.61% to 75.91% and mean AUPR from 37.08% to 44.64%. This provides evidence of value beyond the default backbone and supports the method as a practical adaptation framework (Appendix C.6).
Critical weaknesses
-
The caveat to this portability strength is that TaskBridge's strongest overall performance seems to depend on the backbone. TaskBridge rank first overall with TabICLv2, but fourth with TabPFN v2.6 and second with v3. Both alternatives trail DTE-NP in mean AUROC, although v3 achieves the highest mean AUPR. Portability is well supported, but overall leadership does not persist across backbones. The matched v3 improvement is valuable, whereas Table 11 does not establish lift over a v2.6 extension because the extension baseline uses v3. The paper should distinguish these claims and explain the relevant backbone differences (Tables 4 and 11-12, Appendices B.3 and C.6).
-
I had a hard time understanding the central virtual task explanation on the first read, and I think a concrete example could really help here. The paper is well organized, but I had to connect Section 3.3 with Appendix A.3 to understand how the task constructions yield anomaly evidence. An anomalous row still receives a virtual label from the same construction rule, so detection depends on the TFM's support for that row-label pair. A worked example would make this distinction easier to follow. The explanation could also separate manually designed templates from dataset adaptive configuration and selection, and distinguish the theory's label stability result from anomaly- elective predictive support (Sections 3.1-3.5 and Appendices A.1 and A.3).
Questions for authors
-
How does TaskBridge compare with the AD extension and a feature prediction error baseline when the backbone and tuning are matched? A TabPFN v2.6 accuracy comparison and a v3 runtime comparison would help clarify this. Also, along this same line, do you have any intuition for why TabICLv2 perform better? This would be interesting to include.
-
Does task selection improve over an unfiltered ensemble and random ensembles matched to each dataset's retained task count using the same aggregation? This comparison would distinguish the selection rule's benefit from task complementarity.
-
As already mentioned, could you walk through one normal row and one anomalous row, showing the task inputs, constructed virtual labels, predictive support, and final anomaly scores? Distinguishing template design from context fitting and task selection, and explaining why low anomalous support is expected would make the central mechanism easier to understand.
8 comments
(Q2)
Task Selection vs. Unfiltered and Matched-Size Random Task Ensembles.
We thank the reviewer for suggesting this comparison. We interpret the request as comparing TaskBridge with (i) an unfiltered ensemble retaining all tasks after intra-task configuration selection and (ii) random task subsets matched to TaskBridge's retained-task count, using the same score aggregation.
As defined in Eq. (12) and detailed in Appendix A.5.2, inter-task selection retains tasks with predictive-support separation under the ADBench-calibrated ALL retention policy (Appendix B.1). We additionally examined the retained-task counts across all 790 ODDBench datasets and three seeds (2,370 dataset–seed evaluations). Notably, all five tasks were retained in 2,368/2,370 cases (99.92%). Filtering occurred only for TimeTrackingIssues (seed 1; 4/5 tasks retained) and AppFraudDetection (seed 2; 3/5 retained).
Thus, for 99.92% of evaluations, TaskBridge produces identical results to both the unfiltered ensemble and random task subsets matched to TaskBridge's retained-task count, as all five tasks are retained. For the two remaining cases, we evaluated all possible task subsets containing the same number of tasks as those retained by TaskBridge, while keeping the intra-task configurations and score aggregation unchanged. The results are shown below.
| Dataset (Seed) | TaskBridge | Random-k (Mean) | Unfiltered |
|---|---|---|---|
| TimeTrackingIssues (1), k=4 | 0.5885 / 0.5164 | 0.4331 / 0.4741 | 0.3767 / 0.4585 |
| AppFraudDetection (2), k=3 | 0.9997 / 0.9993 | 0.9996 / 0.9982 | 0.9999 / 0.9998 |
(Values denote AUROC / AUCPR. Random-k averages over all possible task subsets of the same size, including the subset selected by TaskBridge.)
These findings, together with the existing ablations, suggest that TaskBridge's overall ensemble benefit primarily stems from complementary virtual tasks and intra-task configuration selection, rather than frequent inter-task filtering. This is consistent with the task-family and intra-task ablations in Figure 5 of the original paper and the performance improvements with increasing numbers of retained tasks in Table 10. Notably, the existing wo-Inter-Selection ablation in Figure 5 uses a random single-task variant, so its performance gap also reflects the loss of task complementarity. Nevertheless, the TimeTrackingIssues result demonstrates that inter-task filtering can provide substantial benefits when an unsuitable task is identified. We also acknowledge that this benefit is not universal, as illustrated by AppFraudDetection.
(Q3/W2)
Thank you for suggesting a concrete example to clarify the central mechanism. We address your suggestions below.
Template design, context fitting, and selection.
We manually specify five task families targeting complementary aspects of normal structure. Their concrete parameters—including quantile boundaries, category supports, and prototypes—are fitted to the normal context. Using held-out normal samples and structural-violation probes, data-adaptive selection first selects a configuration for each task and then determines which tasks to retain for anomaly scoring. Thus, the templates are predefined, while their instantiation and selection adapt to each dataset.
Concrete walkthrough of TaskBridge.
We provide a real-data walkthrough on WineQuality, one of the ODDBench datasets, tracing a normal and an anomalous query from virtual-label construction through predictive support to final anomaly scores. With seed 0, TaskBridge uses 530 normal context rows and retains five tasks after data-adaptive task selection. For illustration, we select a normal–anomaly pair receiving the identical virtual-label vector [0, 0, 1, 0, 1] across k-means, masked subspace projection, radial binning, global projection, and Reg2Class, respectively. Ground-truth test labels are used only after inference to select this illustrative pair. Figure 3 shows the two queries’ feature values relative to the normal context, their task-wise predictive-support deficits, and their final anomaly scores.
Below, we use the radial task to illustrate label construction and predictive-support scoring, before showing how task-wise scores are aggregated.
(1) Label construction. The selected radial task uses two bins and all 11 numerical features with the raw transform, computing . The normal-context median radial statistic, , defines the boundary: label 0 for and label 1 otherwise. The normal and anomalous queries have radial statistics 44.1829 and 39.1407, respectively, so both receive label 1.
(2) Predictive support and score calibration. Given the feature vectors and virtually labeled normal context, the TFM assigns predictive support of 0.999999 to label 1 for the normal query and 0.288961 for the anomaly. Calibration compares these values with held-out normal supports. None of the 158 held-out normal supports is as low as the anomaly’s support under the radial task, yielding and task surprisal . The normal query instead receives .
(3) Anomaly scoring. Figure 3 shows how task-wise evidence is aggregated into the final anomaly score. For the anomalous query, the masked-subspace and Reg2Class tasks yield calibrated p-values of 0.118750 and 0.043750, respectively. Their surprisals, 2.1307 and 3.1293, are the anomaly’s two smallest task scores, which low2mean averages. Averaging the two smallest task scores gives for the anomaly and for the normal query. This example illustrates how identical virtual labels can yield different anomaly scores through context-conditioned predictive support.
We have included the detailed walkthrough in Appendix A.7, with a reference in Section 3 (lines 186–188) of the revised manuscript, to make TaskBridge’s central mechanism easier to follow.
Scope of the theoretical result.
Appendix A.1 establishes that normality anchoring stabilizes virtual-task semantics for normal queries. As stated in Section 3.2, this provides the structural basis for nominal predictive coherence (C1); it does not itself guarantee TFM prediction accuracy or low support for every anomaly. Low anomalous support is expected when a query–target pair violates the predictive relationships inferred from the normal context. Anomalies preserving those relationships may remain supported, motivating complementary task families and data-adaptive selection to improve selective task coverage (C2).
We thank the reviewer for the constructive feedback. We address the concerns below.
(Q1/W1)
Backbone-Dependent Performance and Possible Explanations.
As reported in the original paper, TaskBridge ranks first with TabICLv2, second with TabPFN v3, and fourth with TabPFN v2.6 in terms of Total Rank. We offer two possible explanations for this backbone-dependent performance:
While these explanations remain hypotheses, they motivate future improvements through backbone-aware configuration calibration and virtual-task diversification. We have also incorporated this discussion into Appendix C.6 of the revised manuscript.
Nevertheless, TaskBridge consistently ranks among the top four of 31 methods across all three backbones. Importantly, it combines competitive AD performance with the ability to repurpose frozen, general-purpose TFMs without anomaly-specific backbone pretraining or dataset-specific parameter updates, offering a practical and transferable approach to TAD.
Additional Experiments.
1. Accuracy Comparison with TabPFN-Extension (TabPFN v2.6)
As requested, we additionally compared TaskBridge against the official TabPFN-Extension using the TabPFN v2.6 backbone. Given the limited computational resources and rebuttal period, we evaluated both methods on 200 randomly sampled ODDBench datasets across five seeds. As shown below, on the 196 datasets with complete results across all five seeds (excluding four with incomplete TabPFN-Extension runs, including out-of-memory errors), TaskBridge substantially outperforms the extension under the matched backbone.
These results provide additional evidence that TaskBridge's advantage over the likelihood-based extension persists when both methods use the same pretrained TFM backbone.
(Implementation Details) We used
tabpfn==8.1.0and instantiated the TabPFN v2.6 classifier and regressor respectively. They were configured withn_estimators=8,auto_scale_n_estimators=True,softmax_temperature=0.9,fit_mode="fit_preprocessors", andinference_precision="auto", using the native v2.6 preprocessing.2. Accuracy Comparison with a Feature-Prediction-Error Baseline.
To address the reviewer's request, we implemented FPE-Native, a feature-prediction-error-based anomaly detector using the same TabICLv2 backbone as TaskBridge. FPE-Native predicts each non-constant feature from the remaining features, calibrates prediction errors against held-out normal samples, and aggregates the calibrated errors into anomaly scores. For a fair comparison, we also performed hyperparameter selection for FPE-Native on ADBench.
As shown in Table 3, on the same 200 randomly selected ODDBench datasets across 3 seeds, TaskBridge achieves 79.86% AUCROC and 48.88% AUCPR, outperforming FPE-Native (Full) (78.98% and 45.15%) and (Time-budgeted) (78.96% and 45.25%). Notably, the time-budgeted variant's budget matched TaskBridge’s total task-selection and query-inference time. These results support the effectiveness of our virtual-task construction and data-adaptive task selection over exhaustive feature-wise prediction, even under comparable computational budgets.
Full implementation details and results are provided in Appendix C.8, with a summary in Section 4.3 (lines 471–473) of the revised manuscript.