Self-supervised debiasing using low rank regularization
Geon Yeong Park, Chanyong Jung, Sangmin Lee, Jong Chul Ye, Sang Wan, Lee

TL;DR
This paper introduces a self-supervised debiasing method that uses low rank regularization to identify and mitigate spurious correlations in neural networks, improving generalization especially with limited annotations.
Contribution
It reveals that spurious attributes induce low rank representations and leverages this insight to develop a self-supervised framework for debiasing without extensive annotations.
Findings
Significantly improves generalization of self-supervised models.
Outperforms some state-of-the-art supervised debiasing methods.
Effectively identifies bias-conflicting samples using spectral analysis.
Abstract
Spurious correlations can cause strong biases in deep neural networks, impairing generalization ability. While most existing debiasing methods require full supervision on either spurious attributes or target labels, training a debiased model from a limited amount of both annotations is still an open question. To address this issue, we investigate an interesting phenomenon using the spectral analysis of latent representations: spuriously correlated attributes make neural networks inductively biased towards encoding lower effective rank representations. We also show that a rank regularization can amplify this bias in a way that encourages highly correlated features. Leveraging these findings, we propose a self-supervised debiasing framework potentially compatible with unlabeled samples. Specifically, we first pretrain a biased encoder in a self-supervised manner with the rank…
Peer Reviews
Decision·ICLR 2024 Conference Withdrawn Submission
In situations where bias labels are not provided, many studies have focused on debiasing algorithms; however, most of these assume the availability of target labels. This research, by assuming a scarcity of target labeled data, adds the advantage of considering a more realistic scenario.
W1. Throughout the paper, the mixture of supervised learning settings and self-supervised learning settings makes it challenging to comprehend. - Initially, the paper emphasizes operating within a self-supervised learning setting, indicated by the title, abstract, and the early sections of the introduction. However, as the introduction progresses and throughout the remainder of the paper, it becomes ambiguous when and under what circumstances the supervised learning setting is also considered. T
- The paper is very well written and is easy to follow - The idea behind rank regularization is very interesting and seems to be very effective - The improvements that has been achieved over the compared baselines are also impressive
- The main weakness appears to be in the choice of the contrastive learning objective. The backbone has been trained in the same way as in the SimCLR paper, however other constrastive learning techniques have not been explored. The regularization loss seems to be a very general one and hence can be applied to other contrastive learning techniques such as Barlow Twins [1] and BYOL [2]. I would especially encourage the authors to show the effect of this loss on [1] as the regularization loss propo
1. The paper tries to tackle an important question regarding improving the generalization ability of models from the aspect of spurious correlation. 2. Empirically, they have some interesting findings about the effective rank of the representation matrix and the bias of the dataset 3. They also show their method has better performance under their experiment settings. 4. The use of unlabeled data to improve the method.
While the paper aims to tackle an important question of improving model generalization ability by reducing bias, many of the concepts are not well supported. 1. the bias is not rigorously defined, which makes the problem hard to connect to the ultimate goal of improving generalization. 2. The whole logic of the paper is built on providing a method that evaluates its own craft benchmark dataset, which makes the paper less credentialed. 2. all the statements come from empirical observation and la
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Domain Adaptation and Few-Shot Learning · Machine Learning and ELM
