REVIEW 3 cited by
Evaluation of Test-Time Adaptation Under Computational Time Constraints
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
This paper proposes a novel online evaluation protocol for Test Time Adaptation (TTA) methods, which penalizes slower methods by providing them with fewer samples for adaptation. TTA methods leverage unlabeled data at test time to adapt to distribution shifts. Although many effective methods have been proposed, their impressive performance usually comes at the cost of significantly increased computation budgets. Current evaluation protocols overlook the effect of this extra computation cost, affecting their real-world applicability. To address this issue, we propose a more realistic evaluation protocol for TTA methods, where data is received in an online fashion from a constant-speed data stream, thereby accounting for the method's adaptation speed. We apply our proposed protocol to benchmark several TTA methods on multiple datasets and scenarios. Extensive experiments show that, when accounting for inference speed, simple and fast approaches can outperform more sophisticated but slower methods. For example, SHOT from 2020, outperforms the state-of-the-art method SAR from 2023 in this setting. Our results reveal the importance of developing practical TTA methods that are both accurate and efficient.
Forward citations
Cited by 3 Pith papers
-
Improving Accuracy and Generalization for Efficient Visual Tracking
SiamABC, a Siamese tracker with a dual-search-region, a fast filtration layer, and backward-free test-time adaptation, improves out-of-distribution tracking while running at 100 FPS on a CPU.
-
DCFS: Continual Test-Time Adaptation via Dual Consistency of Feature and Sample
A new continual test-time adaptation framework that disentangles target features into semantic and domain parts, enforces dual consistency, and weights self-supervised losses by confidence, achieving small average err...
-
SPARNet: Continual Test-Time Adaptation via Sample Partitioning Strategy and Anti-Forgetting Regularization
SPARNet combines sample partitioning, generalized entropy minimization, mean-teacher consistency, and an anti-forgetting regularizer to improve continual test-time adaptation on CIFAR10-C, CIFAR100-C, and ImageNet-C.
Discussion (0). Continue with ORCID to comment.