- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper introduces parameter-efficient linear probing heads for foundation model-based AD. Current AD methods based on foundation models (e.g., DINO, CLIP) mostly train lightweight projection layers on pre-trained features to estimate anomaly segmentations from limited labeled samples. While adopting projection layers provides an efficient and effective approach to few-shot AD, this design still faces challenges when we need to reduce the total number of learnable parameters because the weight dimension is tightly tied to the number of feature dimensions. To overcome this challenge, this paper decomposes the original weights of the linear head W as W=g(W*, z), where W* is orthogonally initialized and fixed during training, and g denotes some non-linear function. Experimental results on widely used AD benchmarks demonstrate that it can reduce the total number of parameters by up to 10 times while minimizing the effect on accuracy.
Critical strengths
S1: The core design philosophy is simple and easy to understand.
S2: Experiments cover broader AD benchmarks, including RealIAD, VisA, BTAD, and MVTecAD. Additional ablation results and technical details are well presented in the main paper and the supplementary.
Critical weaknesses
W1: Contributions. As pointed out in L102, UniADet have already achieved highly-efficient AD with pretrained backbones (~0.02M trainable parameters). While the proposed method achieves a 10x reduction in the total number of trainable parameters, it is still unclear whether such parameter efficiency can yield practical benefits for AD.
W2: Novelty. As stated in L119-121, the authors acknowledge that the weight generation mechanism itself is not a main contribution in this paper, and they adopt a well-established scheme for generating head weights. This highlights the paper's lack of novelty, and the resulting mechanism seems highly engineered. Specifically, they need to tune the training budget for different backbones (e.g., d=512 for DINO, d=2048 for CLIP as in L289). Also, as shown in Fig.3, the best-performing budget differs across backbones.
W3: Accuracy. As shown in Tab.1, the proposed method lagged behind previous competitors like UniADet in most metrics. Also, in their comparison between "shared" vs. "per-layer" code generation strategies, the accuracy with a limited budget is much lower than that of the compared methods in Tab.1.
Questions for authors
Q1: What practical benefit does the proposed method bring? As in W1, explain the motivation and why we need to pursue training memory efficiency beyond lightweight linear probing. During inference, this method likely requires the same total number of floating-point operations. Also, when we use more capable and bigger foundation models (e.g., DINOv3-7B), the inference and training cost is mostly dominated by the backbone forward pass rather than the projection layer.
Q2: Can we test other backbone models? As in W2, we see that the best-performing d is different across backbones. It is better to add other backbone models used in AD, including MAE [1], SigLIP [2]. These additional experiments might help us understand sensitivity to backbone choices.
Q3: Parameter reduction. Recall that the training budget C can be determined with C_b=2LD for baselines and C_p=Ld for the proposed method (L67-74), D=1024 (L34), and d=2048 for DINOv2. Does this therefore imply C_b=C_p (i.e., no improvement in terms of memory efficiency) with per-layer coding?
Q4: Presentation details. What is the definition of sigma (L154), and also for g (L161, L195)? It is better to provide a clear definition of them when they first appear in the manuscript.
References:
[1] He+, "Masked Autoencoders Are Scalable Vision Learners", CVPR'22, https://ieeexplore.ieee.org/document/9879206
[2] Zhai+, "Sigmoid Loss for Language Image Pre-Training", https://ieeexplore.ieee.org/document/10377550
2 comments
Thank you for your rebuttal with additional details and results. Yet, I think their response merely addressed my concerns.
For W1/Q1: In my opinion, the decision guidelines in this paper should be tied to computational efficiency. As this paper focuses on industrial AD, it should be encouraged to explain what this method brings in terms of actual benefit for practical use.
For W2/Q2: Thank you for providing an additional ablation result. Nevertheless, I still have a concern about the backbone-specific selection of the C/L, and there is a gap in the optimal d*.
The authors mostly addressed the other technical comments (W3/Q3/Q4) in their response. Please highlight the revised parts in the manuscript so reviewers can easily see where the authors made changes.
Overall, I think this paper needs to address the points above before publication. Therefore, I'm inclined to maintain my score.
W1 / Q1 — practical benefit.
We reframe the benefit as decision guidance and diagnosis, not compute: (i) at a fixed budget, structure and basis choices change accuracy by 5–25 points (Sec. 4.4; Table 12, Appendix A.8); (ii) the failure of a shared code is diagnosable and fixable (independent codes restore per-layer performance: SigLIP shared 31.9 → IW 41.3; a tied basis explains the DINOv3 exception); (iii) we document boundaries (source-selection reversal on DINOv3, augmentation-shortcut at long training, unstable deep-heavy allocation) so practitioners do not mis-attribute failures to capacity. We quantify the cost of wrong choices and make no SOTA claim.
W2 — novelty and backbone sensitivity / Q2 — other backbones.
We added SigLIP and MAE (four backbones). The preferred per-head width is backbone-dependent (CLIP keeps improving to 2048, DINOv3 peaks at 512, and SigLIP/MAE gain little beyond 512), and the structure ranking changes with the target (DINOv3). This variability is now the object of study, not a hidden tuning knob: the paper gives a budget-aware rule (d* vs C/L) and a diagnostic, and states its failure modes.
W3 — accuracy behind UniADet.
We concede the main table is competitive rather than superior and no longer claim otherwise. The table is a feasibility check under one harness; the new analyses (Secs. 4.3–4.5; Table 12, Appendix A.8) are within-structure comparisons at matched budgets. We also report a score-implementation sensitivity analysis (Table 9, Appendix A.5): the original SPLIT numbers are conservative because float32 softmax saturates, and raw logit scores change some image-level cells (e.g., Real-IAD CLIP 69.6 → 76.9). We do not use this to re-rank against baselines, whose raw score maps are unavailable; we flag it as a limitation of the original evaluation.
Q3 — parameter reduction with per-layer coding.
Correct: C_p = Ld. With d=2048 on CLIP, C_p = 8192 = C_b = 2LD, so there is no reduction; with DINOv3 d=512, C_p=2048 vs 8192, a factor of four. The revised paper reports both and makes no universal efficiency claim.
Q4 — definitions of σ and g.
Added at first use (Sec. 3.1): σ is the coordinate-wise activation (identity for SPLIT/SPLIT-M, tanh for SPLIT-D); g(W,z)=σ(W̃ z) is the generator map.