FRET: Feature Redundancy Elimination for Test Time Adaptation
Test-Time Adaptation (TTA) aims to enhance the generalization of deep learning models when faced with test data that exhibits distribution shifts from the training data. In this context, only a pre-trained model and unlabeled test data are available, making it particularly relevant for privacy-sensitive applications. In practice, we observe that feature redundancy in embeddings tends to increase as domain shifts intensify in TTA. However, existing TTA methods often overlook this redundancy, which can hinder the model's adaptability to new data. To address this issue, we introduce Feature Redundancy Elimination for Test-time Adaptation (FRET), a novel perspective for TTA. A straightforward approach (S-FRET) is to directly minimize the feature redundancy score as an optimization objective to improve adaptation. Despite its simplicity and effectiveness, S-FRET struggles with label shifts, limiting its robustness in real-world scenarios. To mitigate this limitation, we further propose Graph-based FRET (G-FRET), which integrates a Graph Convolutional Network (GCN) with contrastive learning. This design not only reduces feature redundancy but also enhances feature discriminability in both the representation and prediction layers. Extensive experiments across multiple model architectures, tasks, and datasets demonstrate the effectiveness of S-FRET and show that G-FRET achieves state-of-the-art performance. Further analysis reveals that G-FRET enables the model to extract non-redundant and highly discriminative features during inference, thereby facilitating more robust test-time adaptation.
Code (0)
등록된 구현이 없습니다.
Tasks
Contrastive LearningTest-time AdaptationSimilar Papers 제목 키워드 기반
Developing and Testing a Bayesian Analysis of Fluorescence Lifetime Measurements
FRET measurements can provide dynamic spatial information on length scales smaller than the diffraction limit of light. Several methods exist to measure FRET between fluorophores, including Fluorescence Lifetime Imaging …
Bayesian InferenceBELIEF: A distance-based redundancy-proof feature selection method for Big Data
With the advent of Big Data era, data reduction methods are highly demanded given its ability to simplify huge data, and ease complex learning processes. Concretely, algorithms that are able to filter relevant dimensions…
feature selectionThe FRET-based structural dynamics challenge -- community contributions to consistent and open science practices
Single-molecule F\"{o}rster resonance energy transfer (smFRET) has become a mainstream technique for probing biomolecular structural dynamics. The rapid and wide adoption of the technique by an ever-increasing number of …
PositionEfficient Wrapper Feature Selection using Autoencoder and Model Based Elimination
We propose a computationally efficient wrapper feature selection method - called Autoencoder and Model Based Elimination of features using Relevance and Redundancy scores (AMBER) - that uses a single ranker model along w…
feature selectionGeneral ClassificationFaster Exact MPE and Constrained Optimization with Deterministic Finite State Automata
We propose a concise function representation based on deterministic finite state automata for exact most probable explanation and constrained optimization tasks in graphical models. We then exploit our concise representa…