paper-with-me

홈 › Papers

REALM: Robust Entropy Adaptive Loss Minimization for Improved Single-Sample Test-Time Adaptation

2023-09-07 · Skyler Seto, Barry-John Theobald, Federico Danieli, Navdeep Jaitly, Dan Busbridge

Fully-test-time adaptation (F-TTA) can mitigate performance loss due to distribution shifts between train and test data (1) without access to the training data, and (2) without knowledge of the model training procedure. In online F-TTA, a pre-trained model is adapted using a stream of test samples by minimizing a self-supervised objective, such as entropy minimization. However, models adapted with online using entropy minimization, are unstable especially in single sample settings, leading to degenerate solutions, and limiting the adoption of TTA inference strategies. Prior works identify noisy, or unreliable, samples as a cause of failure in online F-TTA. One solution is to ignore these samples, which can lead to bias in the update procedure, slow adaptation, and poor generalization. In this work, we present a general framework for improving robustness of F-TTA to these noisy samples, inspired by self-paced learning and robust loss functions. Our proposed approach, Robust Entropy Adaptive Loss Minimization (REALM), achieves better adaptation accuracy than previous approaches throughout the adaptation process on corruptions of CIFAR-10 and ImageNet-1K, demonstrating its effectiveness.

📄 PDF Abstract BibTeX arXiv:2309.03964

Code (0)

등록된 구현이 없습니다.

Tasks

Test-time Adaptation

Methods 이 논문이 사용한 방법론

Adaptive Loss 설명 없음

Similar Papers 제목 키워드 기반

Adaptive Adversarial Cross-Entropy Loss for Sharpness-Aware Minimization

2024-06-20 · Tanapat Ratchatorn, Masayuki Tanaka

Recent advancements in learning algorithms have demonstrated that the sharpness of the loss surface is an effective measure for improving the generalization gap. Building upon this concept, Sharpness-Aware Minimization (…

image-classificationImage Classification

Fast and Accurate Road Crack Detection Based on Adaptive Cost-Sensitive Loss Function

2021-06-29 · Kai Li, Bo wang, Yingjie Tian, Zhiquan Qi

Numerous detection problems in computer vision, including road crack detection, suffer from exceedingly foreground-background imbalance. Fortunately, modification of loss function appears to solve this puzzle once and fo…

Tilted Cross Entropy (TCE): Promoting Fairness in Semantic Segmentation

2021-03-25 · Attila Szabo, Hadi Jamali-Rad, Siva-Datta Mannava

Traditional empirical risk minimization (ERM) for semantic segmentation can disproportionately advantage or disadvantage certain target classes in favor of an (unfair but) improved overall performance. Inspired by the re…

FairnessSegmentationSemantic Segmentation

A Layer Separation Optimization Framework for Cross-Entropy Training in Deep Learning

2026-04-25 · Yaru Liu, Michael K. Ng, Yiqi Gu arxiv

This paper investigates the deep learning optimization problem with softmax cross-entropy loss. We propose a layer separation strategy to alleviate the strong nonconvexity encountered during training deep networks. For c…

LookSharp: Attention Entropy Minimization for Test-Time Adaptation

2025-11-24 · Yash Mali, Evan Shelhamer arxiv

Test-time adaptation (TTA) updates models during inference to reduce error on distribution shifts. While entropy minimization over the output distribution has proven effective as a TTA loss, we study using the intermedia…

Test-time Adaptation