- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes RIFT, a lightweight post‑hoc feature adaptation method for few‑shot 3D anomaly localization using a frozen registration‑aware encoder and aligned normal templates. Registration assigns patches to predefined canonical slots and coordinates, treating cross‑template same‑slot patches as positives and different‑slot patches as negatives. RIFT combines frozen normalized patch features with Fourier‑encoded coordinates via layer‑normalized small MLP to generate gated residual feature updates, trained with InfoNCE‑style alignment and cosine compactness losses using only target‑category normal data. Adapted features serve for point‑level localization while the original object‑level detector is preserved. Built on COSSAD/RIConv++, RIFT improves Real3D‑AD P‑AUROC/P‑AUPR and Anomaly‑ShapeNet V2 P‑AUROC/P‑AUPR. Its adapter has 36,855 parameters, with ~7.4 s per‑category training and 0.12 ms overhead for 1000 inference descriptors. Real3D‑AD ablations cover fixed coordinates, coordinate‑only adaptation, shuffled correspondences, generic feature‑neighbor supervision, compactness‑loss removal and PointMAE backbone transfer.
Critical strengths
- Low-cost target-category specialization with meaningful Real3D localization gains. RIFT improves point AUPR by 15.66 points on Real3D-AD while freezing the backbone, using no anomalies, and adding very few parameters and little inference latency.
- Reasonably controlled internal evidence for correspondence supervision. The Frozen, fixed-coordinate, coordinate-only, shuffled-correspondence, and generic-neighbor comparisons suggest that the result is not solely caused by adding an adapter or exposing coordinates. Correct same-slot supervision appears beneficial on Real3D-AD.
Critical weaknesses
- The technical contribution is too incremental in its current form. COSSAD already learns from registered patch pairs; RIFT moves this supervision to post-hoc target-category adaptation and combines it with Fourier coordinates, a gated residual MLP, InfoNCE, and a compactness term. Each mechanism is standard, and the paper does not establish a new learning principle beyond applying registered correspondence supervision to a frozen adapter.
- The evidence for generality and for the central correspondence assumption is inadequate. RIFT assumes canonical slot identity implies structural equivalence, but there is no registration-error or correspondence-corruption analysis. The second benchmark improves by only 0.45 AUROC and 1.79 AUPR, 12/40 categories do not improve, no multi-seed uncertainty is reported, and the main ablations are limited to Real3D. The near-perfect slot-retrieval statistic may also be partly solved by the coordinate input itself.
Questions for authors
- How does RIFT behave under controlled rigid‑pose error, non‑rigid misregistration, partial overlap, symmetry‑induced swaps, and random corruption of a known fraction of slot correspondences? Could the authors report performance relative to Frozen as error increases, and identify conditions under which adaptation becomes harmful?
- Could the authors supply three‑run mean and standard‑deviation results across both datasets, and reproduce the shuffled‑correspondence, coordinate‑only, fixed‑coordinate, and generic‑neighbor ablations on Anomaly‑ShapeNet V2? I am curious whether those smaller performance gains are statistically reliable.
- The paper notes that the object‑level detector remains unchanged, yet the reported object‑level AUROC for RIFT diverges from published COSSAD numbers. Could the authors include a Frozen object‑level row evaluated within this identical pipeline and explain all evaluator‑related discrepancies.
- What exact normal‑only retrieval statistic drives checkpoint selection? Given the roughly 99.7–99.9 % held‑out slot‑retrieval performance, how much of this statistic can be solved purely from coordinate inputs? Could the authors provide a coordinate‑only retrieval control alongside full pair‑sampling and batch configuration details.
- How does RIFT compare against simpler post‑hoc target‑adaptation approaches constrained to matching trainable‑parameter and runtime budgets, for example linear metric learning, feature whitening, per‑slot prototypes, or adapters trained without Fourier coordinates? Could the authors include this comparison to establish whether the proposed gated‑residual architecture delivers meaningful benefits?
- I am curious whether every target category demands a separately stored and trained adapter. How do total storage overhead, calibration latency, and performance scale with growing numbers of categories and templates? Could the authors report any catastrophic degradation or cross‑category interference observed when training one single shared adapter across categories.
Official Comment by Reviewer xHU8
I appreciate the authors' detailed response and careful answers to my questions, which clarified many of my doubts. However, I believe my initial overall rating still accurately reflects my assessment of the paper, and therefore I would like to keep my original score.