- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper introduced AdaGPK, which builds visual tokens by pooling convolutional features with image-dependent Gaussian kernels that adapt their position, size, and orientation. The model also achieved competitive results, while the Gaussian constraint improves zero-shot localization compared with free-form adaptive pooling.
Critical strengths
-
Each token comes from a region described by a small set of geometric parameters, making its pooling region easy to inspect. The method also fits into a standard Transformer without requiring a specialized attention mechanism.
-
This paper shows that free-form pooling can match or exceed classification accuracy, while Gaussian kernels provide better localization on CUB-200 and single-object Pascal VOC. This is a more convincing argument than relying on classification gains alone, and the three-seed experiments and kernel analyses add useful support.
Critical weaknesses
-
This work moves quickly into equations without clearly explaining the motivation for the design choices or what each component is meant to achieve. In particular, the authors should explain why moment-based Gaussian reconstruction is needed and what benefit it is intended to provide over directly pooling with the predicted heatmaps.
-
AdaGPK uses a convolutional feature extractor, whereas the ViT and TokenLearner comparisons use patch-based models. The matched free-form ablation addresses part of this concern, but a fixed-pooling baseline with the same convolutional backbone is still needed. Comparisons with additional hybrid or hierarchical models would make the performance claims stronger.
-
The evaluation uses class-agnostic relevance maps and restricts Pascal VOC to single-object images. Since Gaussian reconstruction directly produces smooth spatial maps, it remains unclear how much of the gain reflects better learned spatial representations versus the shape of the maps used for evaluation.
Questions for authors
-
How does AdaGPK compare with fixed-grid pooling or TokenLearner-style pooling using exactly the same convolutional backbone, token count, and Transformer?
-
Would the localization advantage remain if the free-form and baseline relevance maps were smoothed before evaluation? This would help separate the effect of Gaussian map shape from what the model learns.
-
How does the method behave on images with multiple objects, small objects, or objects with irregular shapes? Could you include results beyond the single-object setting?
-
Could you please report inference latency, throughput, and peak memory at different token budgets? The paper acknowledges higher FLOPs than the ViT baselines, so these measurements would clarify the practical benefit of using fewer tokens.