Bias In, Bias Out? Finding Unbiased Subnetworks in Vanilla Models
Authors: Ivan Luiz De Moura Matos, Abdel Djalil Sad Saoud, Ekaterina Iakovleva, Vito Paolo Pastore, Enzo Tartaglione
Organizations: LTCI, Télécom Paris, Institut Polytechnique de Paris, France · MaLGa-DIBRIS, University of Genoa, Italy · AI for Good (AIGO), Istituto Italiano di Tecnologia, Italy
The issue of algorithmic biases in deep learning has led to the development of various debiasing techniques, many of which perform complex training procedures or dataset manipulation. However, an intriguing question arises: is it possible to extract fair and bias-agnostic subnetworks from standard vanilla-trained models without relying on additional data, such as unbiased training set? In this work, we introduce Bias-Invariant Subnetwork Extraction (BISE), a learning strategy that identifies and isolates "bias-free" subnetworks that already exist within conventionally trained models, without retraining or finetuning the original parameters. Our approach demonstrates that such subnetworks can be extracted via pruning and can operate without modification, effectively relying less on biased features and maintaining robust performance. Our findings contribute towards efficient bias mitigation through structural adaptation of pre-trained neural networks via parameter removal, as opposed to costly strategies that are either data-centric or involve (re)training all model parameters. Extensive experiments on common benchmarks show the advantages of our approach in terms of the performance and computational efficiency of the resulting debiased model.
Figures & tables
Figure 1: Overview of the proposed method. BISE aims to extract an unbiased subnetwork from the biased vanilla-trained network.
Figure 2: Illustration of BISE. Solid black arrows indicate forward propagation; dashed blue arrows indicate backward gradient propagation. During the training of the mask M and of Caux , the original model, f=C∘E , is kept frozen.
Method
Accuracy (%)
ρ=0.99
ρ=0.995
ρ=0.997
Vanilla
88.9±0.4
75.1±4.2
66.1±1.7
Rubi [ 14 ]
93.6
43.0
90.4
EnD [ 92 ]
96.0
93.9
83.7
BCon+BBal [ 31 ]
98.1
97.7
97.3
ReBias [ 5 ]
88.4
75.4
65.8
Table 1: Results on BiasedMNIST for different ρ values.
Method
Proportion of bias-aligned samples in the training set ( ρ )
ρ=0.99
ρ=0.995
ρ=0.997
S (%) ↑
MFLOPs ↓
S (%) ↑
MFLOPs ↓
S (%) ↑
MFLOPs ↓
Vanilla
0
415.4
0
415.4
0
415.4
BISE
20.9±4.4
328.3±18.2
29.9±7.5
290.8±31.0
35.0±1.5
269.6±6.2
BISE (last)
18.9±4.3
336.4±17.7
30.0±6.8
290.7±28.3
33.8±4.0
274.6±16.7
Table 2: Sparsity ( S ) and computational cost (MFLOPs) of models, for the BiasedMNIST dataset.
Method
Accuracy (%)
ρ=0.995
ρ=0.99
ρ=0.98
ρ=0.95
Vanilla
22.03±0.39
26.89±0.25
33.42±0.65
47.18±0.34
EnD [ 92 ]
19.38
23.12
34.07
36.57
HEX [ 98 ]
13.87
14.81
15.20
16.04
ReBias [ 5 ]
22.27
25.72
31.66
43.43
LfF [ 70 ]
28.57
33.07
39.91
50.27
Table 3: Results on Corrupted-CIFAR10, for different values of ρ .
Method
Proportion of bias-aligned samples in the training set ( ρ )
ρ=0.995
ρ=0.99
ρ=0.98
ρ=0.95
S (%) ↑
MFLOPs ↓
S (%) ↑
MFLOPs ↓
S (%) ↑
MFLOPs ↓
S (%) ↑
MFLOPs ↓
Vanilla
0
37.1
0
37.1
0
37.1
0
37.1
BISE (last)
77.8±2.3
15.5±0.9
92.2±1.0
15.7±1.1
89.6±0.6
19.2±0.8
82.3±0.6
22.5±0.6
Table 4: Sparsity ( S ) and computational cost (MFLOPs) of models, for Corrupted-CIFAR10.
Table 7
Method
Accuracy (%) ↑
(Alig., Alig.)
(Alig., Conf.)
(Conf., Alig.)
(Conf., Conf.)
Unbiased
Vanilla
100.0±0.0
97.2±0.8
30.3±1.4
5.2±0.3
58.2±0.6
LfF [ 70 ]
99.6
4.7
98.6
5.1
52.0
EIIL [ 19 ]
100.0
97.2
70.8
10.9
69.7
PGI [ 3 ]
98.6
82.6
26.6
9.5
54.3
DebiAN [ 53 ]
100.0
95.6
76.5
16.0
72.0
Table 7: Results on the Multi-Color MNIST dataset. (*) indicates that debiasing is performed by leveraging an unbiased dataset.
Reweighting of LCE(y^,y)
I(b^,b)
Acc. (%) ↑
S (%) ↑
MFLOPs ↓
-
-
91.9±0.7
5.8±2.6
390.9±10.6
✓
-
96.0±0.4
18.5±6.5
338.2±27.1
-
✓
91.1±0.5
18.7±0.5
337.3±2.0
✓
✓
96.1±0.5
20.9±4.4
328.3±18.2
Table 8: Ablation study for the components of the objective J .
Figure 3: Analysis of (a) coefficient γ and (b) pruning strategies. Shaded areas indicate the interval of one standard deviation.
Method
Acc. (%) ↑
S (%) ↑
MFLOPs ↓
Vanilla
76.5±2.1
0
1818.6
Unsup. BISE
87.5±2.5
67.3±4.8
953.1±218.4
Unsup. BISE (last)
85.1±1.8
67.7±4.6
936.5±190.1
Table 9: Results for unsupervised ( Unsup. ) debiasing on CelebA.
Appendix figures & tables19 assets
Supplementary material from the paper’s appendix.
Appendix
Figure C.1 : Samples from the BiasedMNIST dataset [ 5 ] . In the first row, bias-aligned images; in the second row, bias-conflicting images.
Figure C.2 : Samples from the CelebA dataset [ 58 ] .
Figure C.3 : Samples from the Corrupted-CIFAR10 dataset [ 30 ] . We show two images belonging to each class.
Figure C.4 : Samples from the Multi-Color MNIST dataset [ 53 ] . In the first row, images that are bias-aligned with respect to both background colors; in the second row, images that are bias-conflicting with respect to at least one of the colors.
Figure C.5 : Samples from the CivilComments dataset [ 11 , 44 ] . Label y indicates whether a comment is toxic, while b indicates if it mentions any sensitive attribute.
Biased MNIST
CelebA
Corrupted- CIFAR10
Multi-Color MNIST
Civil Comments
# weights
531210
11177538
11181642
256510
109361664
# mi
240(0.05%)
3840(0.03%)
3840(0.03%)
300(0.12%)
46848(0.04%)
Appendix
Table E.1 : Number of weights vs. of updated parameters mi .
Method
Acc. (%) ↑
S (%) ↑
MFLOPs ↓
Vanilla
10.0±0.1
0
415.4
BISE
15.7±1.3
85.6±4.0
59.8±16.7
BISE + finetuning
60.5±9.4
85.6±4.0
59.8±16.7
BISE (last)
14.7±2.5
78.2±2.9
90.5±11.9
FFW * [ 68 ]
19.9
–
–
Appendix
Table G.1 : Results on BiasedMNIST for ρ=0.999 . (*) indicates that debiasing is performed by leveraging an unbiased dataset.
Metric
E
1
5
10
20
50
Acc. (%) ↑
95.9±0.4
96.0±0.5
96.0±0.4
95.7±0.5
96.1±0.5
S (%) ↑
18.9±7.3
17.6±7.1
20.0±6.1
17.2±7.6
20.9±4.4
MFLOPs ↓
336.7±30.4
342.1±29.5
331.9±25.2
343.7±31.6
328.3±18.2
Appendix
Table H.1 : Effect of E on the extracted subnetwork.
Metric
κ
0.1
0.5
0.8
Acc. (%) ↑
96.0±0.4
96.1±0.5
96.2±0.6
S (%) ↑
20.6±3.9
20.9±4.4
18.9±7.6
MFLOPs ↓
329.3±16.3
328.3±18.2
336.5±31.4
Appendix
Table H.2 : Effect of κ on the extracted subnetwork.
Metric
υ
1
5
10
20
50
Acc. (%) ↑
95.9±0.5
95.8±0.5
96.1±0.5
96.0±0.5
96.5±0.3
S (%) ↑
22.4±6.3
18.3±6.2
20.9±4.4
19.2±6.3
19.8±8.0
MFLOPs ↓
322.2±26.2
338.9±25.7
328.3±18.2
335.2±26.2
333.0±33.3
Appendix
Table H.3 : Effect of υ on the extracted subnetwork.
Metric
τmin
10−1
10−2
10−3
10−4
Acc. (%) ↑
95.9±0.6
96.1±0.5
96.1±0.5
96.1±0.5
S (%) ↑
20.4±5.0
20.9±4.4
20.9±4.4
20.9±4.4
MFLOPs ↓
330.3±20.7
328.3±18.2
328.3±18.2
328.3±18.2
Appendix
Table H.4 : Effect of τmin on the extracted subnetwork.
Method
Accuracy (%)
ρ=0.99
ρ=0.995
ρ=0.997
Vanilla
88.9±0.4
75.1±4.2
66.1±1.7
BISE ( Tab. 1 )
96.1±0.5
92.2±1.9
90.8±0.6
BISE + trainable BN (avg., std.)
97.3±0.1
94.9±1.1
94.0±1.2
BISE + trainable BN (avg., std., β , γ )
96.9±0.4
92.2±1.9
90.1±3.7
Appendix
Table I.1 : Experiments on BiasedMNIST with trainable vs. non-trainable batch normalization layers.
Method
Proportion of bias-aligned samples in the training set ( ρ )
ρ=0.99
ρ=0.995
ρ=0.997
S (%) ↑
MFLOPs ↓
S (%) ↑
MFLOPs ↓
S (%) ↑
MFLOPs ↓
Vanilla
0
415.4
0
415.4
0
415.4
BISE ( Tab. 2 )
20.9±4.4
328.3±18.2
29.9±7.5
290.8±31.0
35.0±1.5
269.6±6.2
BISE + trainable BN (avg., std.)
18.3±6.8
339.2±28.1
26.5±4.0
305.0±16.7
33.3±7.9
276.9±32.9
BISE + trainable BN (avg., std., β , γ )
32.7±7.7
279.5±32.0
45.7±3.9
225.6±16.2
48.2±12.0
214.9±49.8
Appendix
Table I.2 : Sparsity ( S ) and computational cost (MFLOPs) of models, for the BiasedMNIST dataset, when updating the batch normalization layers during BISE.
Figure J.1 : Analysis of the effect of varying the threshold ζ on the pruned network. Threshold ζ=0 corresponds to the vanilla dense model; ζ=0.5 is the original threshold used in BISE.
Method
Accuracy (%)
ρ=0.99
ρ=0.995
ρ=0.997
Vanilla
88.9±0.4
75.1±4.2
66.1±1.7
Unsup. BISE
95.8±0.5
92.0±2.0
90.4±0.6
Unsup. BISE (last)
95.4±0.7
90.6±1.9
90.0±0.2
Appendix
Table K.1 : Unsupervised ( Unsup. ) debiasing on BiasedMNIST.
Method
Proportion of bias-aligned samples in the training set ( ρ )
ρ=0.99
ρ=0.995
ρ=0.997
S (%) ↑
MFLOPs ↓
S (%) ↑
MFLOPs ↓
S (%) ↑
MFLOPs ↓
Vanilla
0
415.4
0
415.4
0
415.4
Unsup. BISE
19.9±4.4
332.4±18.2
26.2±4.7
306.3±19.5
30.9±2.3
286.6±9.7
Unsup. BISE (last)
19.7±3.6
333.4±14.9
28.8±4.9
295.6±20.3
28.8±4.5
295.5±18.7
Appendix
Table K.2 : Sparsity ( S ) and computational cost (MFLOPs) of models, for the BiasedMNIST dataset, in the unsupervised debiasing scenario.
Figure L.1 : Results on BiasedMNIST (training set with ρ=0.99 ) under noisy bias labels. Noise level p=0% corresponds to the standard setting ( i.e. , use of true bias labels).
Model
Accuracy of the aux. classifier on color prediction (%)
Vanilla
97.6±1.0
Debiased with BISE
82.1±7.3
Appendix
Table M.1 : Comparison of accuracy on color prediction for two auxiliary classifiers: one trained on top of a vanilla encoder, and the other trained on top of the BISE-pruned encoder.
Metric
Model
Dataset
BiasedMNIST ( ρ=0.99 )
Corrupted-CIFAR10 ( ρ=0.95 )
CelebA
Multi-Color MNIST ( ρL=0.99 , ρR=0.95 )
CivilComments
Acc. (%)
Vanilla
88.9±0.4
47.18±0.34
76.5±2.1
58.2±0.6
59.6±2.7
Best competitor
98.1 (BCon+BBal [ 31 ] )
51.13 (DFA [ 51 ] )
91.4 (BCon+BBal [ 31 ] )
73.1 (VCBA [ 69 ] )
80.4 (Group DRO [ 82 ] )
BISE ∗
96.1±0.5
55.38±1.96
89.7±0.8
60.3±1.0
80.4±0.2
BISE + finetuning ∗
98.1±0.1
57.22±1.81
91.8±1.3
70.6±1.6
81.0±0.1
S (%)
BISE ∗
20.9±4.4
82.3±0.6
67.6±0.8
17.1±5.3
26.0±5.4
Appendix
Table N.1 : Summary of results across datasets. ( ∗ ) indicates that the result for BISE “best” is reported whenever a validation set is available; otherwise, we report the result for BISE “last” . The metric Acc. corresponds to the accuracy on an unbiased test set, in the case of BiasedMNIST, CelebA and Corrupted-CIFAR10; for Multi-Color MNIST, it denotes the average test accuracy across the four existing groups in the dataset (as described in Sec. 4.2 ); for CivilComments, it denotes the worst-group test accuracy. The sparsity ( S ) for the vanilla and competing methods is zero, since no parameter is removed from the network.
The problem of bias persists in the deep learning community as models continue to provide disparate performance across different demographic subgroups. Therefore, several algorithms have been proposed to improve the fairness of deep models. However, a majority of these algorithms utilize the protected attribute information for bias mitigation, which severely limits their application in real-world scenarios. To address this concern, we have proposed a novel algorithm, termed as Non-Protected Attribute-based Debiasing (NPAD) algorithm for bias mitigation, that does not require the protected attribute information. The proposed NPAD algorithm utilizes the auxiliary information provided by the non-protected attributes to optimize the model for bias mitigation. Further, two different loss functions, Debiasing via Attribute Cluster Loss (DACL) and Filter Redundancy Loss (FRL) have been proposed to optimize the model for fairness goals. Multiple experiments are performed on the LFWA and CelebA datasets for facial attribute prediction, and a significant reduction in bias across different gender and age subgroups is observed.
Foundation models trained on biased datasets often rely on spurious correlations between target labels and non-causal attributes, resulting in poor generalization on minority groups. Bias mitigation remains challenging due to two fundamental issues. First, when group labels are unavailable, existing group-unsupervised methods typically infer spurious attributes implicitly from model behavior, making it difficult to identify spurious factors that are semantically aligned with real-world biases. Second, even with pseudo spurious supervision, most existing debiasing methods follow a single-branch design that operates within a single shared feature space, where target and spurious attributes are intrinsically entangled. To address the first challenge, we introduce Confidence-guided Bias Concept Mining (CBCM), which leverages diffusion-disentangled, semantically grounded concept representations to identify reliable spurious attributes without attribute annotations. To address the second challenge, we propose Dual-branch Cross-projection Debiasing (DCD), a prompt-tuning framework that separates target and spurious representations into two branches and explicitly removes spurious information through cross null-space projection while preserving target-relevant semantics. Extensive experiments on four benchmark datasets show that our method achieves state-of-the-art worst group accuracy among group-unsupervised approaches, while tuning at most 0.22% of the model parameters. The source code is available in the supplementary materials.
Xiangqian Zhao, Xinyang Jiang, Zhipeng Xu +5
Xidian University · Shaanxi, China · Microsoft Research Asia +1
Language models (LMs) often acquire various biases during pre-training and may express them in interactions, potentially causing social harm. Existing methods often rely on counterfactual augmentation or representation projection. These strategies remain limited in practice due to their high computational costs and difficulty in scaling to larger models. Additionally, many of these strategies require manual data annotation, narrowing their scope to specific cultures and bias categories. To overcome these limitations, we propose HEIMAT, a HEurIstic-style autoMATic debiasing framework for LMs. HEIMAT consists of two main steps: bias disclosure and debiasing fine-tuning. In the first step, it uses simple templates to construct heuristic prompts, which are applied to reveal model biases and generate corresponding context prompts. In the second step, it fine-tunes the model by minimizing the Jensen-Shannon divergence of predictions on these context prompts to reduce bias. Extensive experiments show that HEIMAT effectively mitigates bias in different cultures while maintaining the model's natural language understanding (NLU) performance.
Tian Lan, Yemin Wang, Chuancheng Shi +6
Inner Mongolia University · Xiamen University · University of Sydney +3