paper-with-me

Papers

DivIL: Unveiling and Addressing Over-Invariance for Out-of- Distribution Generalization

2025-02-18 · Jiaqi Wang, YuHang Zhou, Zhixiong Zhang, Qiguang Chen, Yongqiang Chen, James Cheng

Out-of-distribution generalization is a common problem that expects the model to perform well in the different distributions even far from the train data. A popular approach to addressing this issue is invariant learning (IL), in which the model is compiled to focus on invariant features instead of spurious features by adding strong constraints during training. However, there are some potential pitfalls of strong invariant constraints. Due to the limited number of diverse environments and over-regularization in the feature space, it may lead to a loss of important details in the invariant features while alleviating the spurious correlations, namely the over-invariance, which can also degrade the generalization performance. We theoretically define the over-invariance and observe that this issue occurs in various classic IL methods. To alleviate this issue, we propose a simple approach Diverse Invariant Learning (DivIL) by adding the unsupervised contrastive learning and the random masking mechanism compensatory for the invariant constraints, which can be applied to various IL methods. Furthermore, we conduct experiments across multiple modalities across 12 datasets and 6 classic models, verifying our over-invariance insight and the effectiveness of our DivIL framework. Our code is available at https://github.com/kokolerk/DivIL.

📄 PDF Abstract BibTeX arXiv:2502.12413

Code (1)

kokolerk/divil 공식 구현 pytorch

Tasks

Contrastive LearningOut-of-Distribution Generalization

Methods 이 논문이 사용한 방법론

Contrastive Learning 설명 없음
Focus 설명 없음

Similar Papers 제목 키워드 기반

Unveiling Invariances via Neural Network Pruning

2023-09-15 · Derek Xu, Yizhou Sun, Wei Wang

Invariance describes transformations that do not alter data's underlying semantics. Neural networks that preserve natural invariance capture good inductive biases and achieve superior performance. Hence, modern networks …

Network Pruning

Asymptotic Validity and Finite-Sample Properties of Approximate Randomization Tests

2019-08-12 · Panos Toulis

Randomization tests rely on simple data transformations and possess an appealing robustness property. In addition to being finite-sample valid if the data distribution is invariant under the transformation, these tests c…

Clusteringvalid

Beyond Invariance: Test-Time Label-Shift Adaptation for Addressing "Spurious" Correlations

2023-09-21 · NeurIPS 2023 11

Changes in the data distribution at test time can have deleterious effects on the performance of predictive models $p(y|x)$. We consider situations where there are additional meta-data labels (such as group labels), deno…

On genuine invariance learning without weight-tying

2023-08-07 · Artem Moskalev, Anna Sepliarskaia, Erik J. Bekkers, Arnold Smeulders

In this paper, we investigate properties and limitations of invariance learned by neural networks from the data compared to the genuine invariance achieved through invariant weight-tying. To do so, we adopt a group theor…

Decision Making

Learning to Transform for Generalizable Instance-wise Invariance

2023-09-28 · ICCV 2023 1 · Utkarsh Singhal, Carlos Esteves, Ameesh Makadia, Stella X. Yu

Computer vision research has long aimed to build systems that are robust to spatial transformations found in natural data. Traditionally, this is done using data augmentation or hard-coding invariances into the architect…

Data Augmentation