- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
In this paper, the authors propose GEAR, which addresses test-time compute allocation for frozen quantized spiking classifiers by distinguishing sample uncertainty from the actual utility of applying an additional inference action. It routes low-margin inputs through nested higher-resolution and flipped views, while using an action-conditioned response curve based on repair-minus-harm utility. Experiments on ImageNet and several ImageNet-derived distribution shifts show that the fixed routing policy improves accuracy, while probe-based calibration further adapts the operating width to target-like streams. The results also show that the benefit of escalation is action- and distribution-dependent, with failure cases occurring when improvement caused by GEAR is not concentrated among uncertain samples.
Critical strengths
Strengths
- This paper tackles a meaningful problem that can occur during inference of transformer models.
- The authors provide broad experimental results.
- The authors adopt their mechanism in a practical processing pipeline, including JPEG decoding, beyond simple image classification tasks.
Critical weaknesses
Weaknesses
- The introduction of this paper is really hard to read. The problem statement is not structured well, and I cannot follow how the authors decide to propose GEAR based on the mentioned problems.
- I think the core problem pointed out by the authors is that uncertainty alone does not tell whether additional test-time computation will actually improve a prediction. However, I do not think this core problem is specific to the SNNs. This problem is also related to ANN-based transformers.
- The discussion of dynamic networks at the beginning of Section 2 feels somewhat abrupt. While these methods share the high-level goal of input-dependent compute allocation with GEAR, their underlying mechanisms are different. It would improve readability to clarify GEAR's positioning within adaptive inference and then introduce dynamic networks as related but distinct approaches.
- Equation (2) approximates the additional computational workload using terms proportional to the input image size. However, it is not clear why the inference cost of the QSD-Transformer should scale proportionally with spatial resolution squared. Actually, different components of a Transformer may scale differently with the number of input tokens.
- The choice of appears to be an empirically selected operating point rather than a value derived from a theoretical analysis. I think this value can depend on the dataset and batch size, as Table 6 in the Appendix. Furthermore, this kind of design makes GEAR seem hardly dependent on heuristic approaches.
- Although the authors deal with SNNs, they do not consider event-based or sequential datasets at all. Experimental results with these datasets can enhance SNN-specific aspects of GEAR.
- The comparative results with existing approaches are in the Appendix. I recommend that the authors show these results in the main text of their paper.
Questions for authors
Questions
- What are SNN-specific aspects of GEAR?
- Could you provide a theoretical foundation for selection? If you cannot, please provide an intuitive, brief explanation to justify the selection.
- The authors mention dynamic neural networks in Section 2. Could you provide the advantages and disadvantages of GEAR compared to dynamic neural networks?