R EVISITING G ROUP R OBUSTNESS : C LASS - SPECIFIC S CALING IS A LL Y OU N EED
Anonymous authors
Paper under double-blind review
A BSTRACT
Group distributionally robust optimization, which aims to improve robust accuracies such as worst-group or unbiased accuracy, is one of the mainstream algorithms to mitigate spurious correlation and reduce dataset bias.
While existing approaches have apparently gained performance in robust accuracy, these improvements mainly come from a trade-off at the expense of average accuracy.
To address the challenges, we ﬁrst propose a simple class-speciﬁc scaling strategy to control the trade-off between robust and average accuracies ﬂexibly and efﬁciently, which is directly applicable to existing debiasing algorithms without additional training; it reveals that a na ¨ ıve ERM baseline matches or even outperforms the recent debiasing approaches by adopting the class-speciﬁc scaling.
Then, we employ this technique to 1) evaluate the performance of existing algorithms in a comprehensive manner by introducing a novel uniﬁed metric that summarizes the trade-off between the two accuracies as a scalar value and 2) develop an instancewise adaptive scaling technique for overcoming the trade-off and improving the performance even further in terms of both accuracies.
Experimental results verify the effectiveness of the proposed frameworks in both tasks.
I NTRODUCTION
Machine learning models have achieved remarkable performance in various tasks via empirical risk minimization (ERM).
However, they often suffer from spurious correlation and dataset bias, failing to learn proper knowledge about minority groups despite their high overall accuracies.
For instance, because digits and foreground colors have a strong correlation in the colored MNIST dataset (Arjovsky et al., 2019; Bahng et al., 2020), a trained model learns unintended patterns of input images and performs poorly in classifying the digits in minority groups, in other words, when the colors of the digits are rare in the training dataset.
Since spurious correlation leads to poor generalization performance in minority groups, group distributionally robust optimization (Sagawa et al., 2020) has been widely studied in the literature about algorithmic bias.
Numerous approaches (Huang et al., 2016; Sagawa et al., 2020; Seo et al., 2022a;
Nam et al., 2020; Sohoni et al., 2020; Levy et al., 2020; Liu et al., 2021) have presented high robust accuracies such as worst-group or unbiased accuracies in a variety of tasks and datasets, but, although they clearly sacriﬁce the average accuracy, comprehensive evaluation jointly with average accuracy has not been actively explored yet.
Refer to Figure 1 about the existing trade-offs of algorithms.
This paper addresses the limitations of the current research trends and starts with introducing a simple post-processing technique, robust scaling , which efﬁciently performs class-speciﬁc scaling on prediction scores and conveniently controls the trade-off between robust and average accuracies.
It allows us to identify any desired performance points, e .
g .
, for average accuracy, unbiased accuracy, worst-group accuracy, or balanced accuracy, on the accuracy trade-off curve using a single model with marginal computational overhead.
The proposed robust-scaling method can be easily plugged into various existing debiasing algorithms to improve the desired target objectives within the tradeoff.
One interesting observation is that, by adopting the proposed robust scaling, even the ERM baseline accomplishes competitive performance compared to the recent group distributionally robust optimization approaches (Liu et al., 2021;
Nam et al., 2020; Sagawa et al., 2020; Kim et al., 2022;
Seo et al., 2022a; Creager et al., 2021;
Levy et al., 2020; Kirichenko et al., 2022; Zhang et al., 2022)
[Figure]
without extra training, as illustrated in Figure 2.
We will present the results from other debiasing algorithms in the experiment section.
By taking advantage of the robust scaling technique, we develop a novel comprehensive evaluation metric that consolidates the trade-off of the algorithms for group robustness, leading to a unique perspective of group distributionally robust optimization.
To this end, we ﬁrst argue that comparing the robust accuracy without considering the average accuracy is incomplete and a uniﬁed evaluation of debiasing algorithms is required.
For a comprehensive performance evaluation, we introduce a convenient measurement referred to as robust coverage , which considers the trade-off between average and robust accuracies from the Pareto optimal perspective and summarizes the performance of each algorithm with a scalar value.
Furthermore, we propose a more advanced robust scaling algorithm that applies the robust scaling to each example adaptively based on its cluster membership at test time to maximize performance.
Our instance-wise adaptive scaling strategy is effective to overcome the trade-off between robust and average accuracies and achieve further performance gains in terms of both accuracies.
Contribution.
We present a simple but effective approach for group robustness by the analysis of trade-off between robust and average accuracies.
Our framework captures the full landscape of robust-average accuracy trade-offs, facilitates understanding the behavior of existing debiasing techniques, and provides a way for optimizing the arbitrary objectives along the trade-off using a single model without extra training.
Our main contributions are summarized as follows.
• We propose a training-free class-speciﬁc scaling strategy to capture and control the tradeoff between robust and average accuracy with marginal computational cost.
This approach allows us to optimize a debiasing algorithm for arbitrary objectives within the trade-off.
• We introduce a novel comprehensive performance evaluation metric via the robust scaling that summarizes the trade-off between robust and average accuracies as a scalar value from the Pareto optimal perspective.
• We develop an instance-wise robust scaling algorithm by extending the original classspeciﬁc scaling with joint consideration of feature clusters.
This technique is effective to overcome the trade-off and improve both robust and average accuracy further.
• The extensive experiments analyze the characteristics of existing methods and validate the effectiveness of our frameworks on the multiple standard benchmarks.
R ELATED W ORKS
Mitigating spurious correlation has been emerged as an important problem in a variety of areas in machine learning.
Sagawa et al .
(Sagawa et al., 2020) propose group distributionally robust opti-
[Figure]
mization (Group DRO) and provide a practical assumption; training examples are given in groups, and arbitrary test distribution is represented by a mixture of these groups.
Because models which rely on the spurious correlation yield poor worst-group performance, group distributionally robust optimization, which aims to maximize worst-group accuracy, is widely adopted to deal with spurious correlation, and the methods can be mainly categorized into three folds as follows.
Sample Reweighting The most popular approaches are assigning different training weights to each samples to focus on the minority groups, where the weights are based on the group frequency or loss.
Group DRO (Sagawa et al., 2020) minimizes the worst-group loss by reweighting based on the average loss per group.
Although Group DRO achieves robust results against group distribution shifts, it requires training examples with group supervision.
To handle this limitation, several unsupervised approaches have been proposed that do not exploit group annotations.
George (Sohoni et al., 2020) and BPA (Seo et al., 2022a) extend Group DRO in an unsupervised way, where they ﬁrst train the ERM model and use this model to infer pseudo-groups via feature clustering.
CVaR DRO (Levy et al., 2020) minimizes the worst loss over all α -sized subpopulations, which upperbounds the worst-group loss over the unknown groups.
LfF (Nam et al., 2020) simultaneously trains two models, one is with generalized cross-entropy and the other one is with standard crossentropy loss, and reweights the examples based on their relative difﬁculty score.
JTT (Liu et al., 2021) conducts a two-stage procedure, which upweights the examples that are misclassiﬁed by the ﬁrst-stage model.
Idrissi et al.
(2022) analyze simple data subsampling and reweighting baselines based on group or class frequency to handle dataset imbalance.
LWBC (Kim et al., 2022) employs an auxiliary module to identify bias-conﬂicted data and assigns large weights to them.
Representation Learning On the other hand, some approaches aim to learn debiased representations directly to avoid spurious correlation.
ReBias (Bahng et al., 2020) adopts Hilbert-Schmidt independence criterion (Gretton et al., 2005) to learn feature representations independent of the predeﬁned biased representations.
Cobias (Seo et al., 2022b) deﬁnes conditional mutual information between feature representations and group labels as a bias measurement, and employ it as a debiasing regularizer.
IRM (Arjovsky et al., 2019) learns invariant representations to diverse environments, where the environment variable can be interpreted as the group.
While IRM requires the supervision of the environment variable, EIIL (Creager et al., 2021) and PGI (Ahmed et al., 2020) are the unsupervised counterparts, which assign each training example to the environment that violates the IRM objective maximally.
Post-processing While most previous studies are in-processing approaches that perform feature representation learning or sample reweighting during training to improve group robustness, our framework does not fall into those categories; it deals with group robust optimization by simple post-processing with class-speciﬁc score scaling, which does not require any additional training.
Similar to our method, some post-processing techniques, including temperature (Guo et al., 2017) or Platt (Platt, 2000) scaling, are widely exploited in the literature of conﬁdence calibration, but it is
[Figure]
not applicable in our task because it scales the prediction scores equally for each class and does not change the label predictions.
Recently, DFR (Kirichenko et al., 2022) demonstrated that retraining only the last layer of the model with group-balanced dataset can match the performance of existing approaches, but they still require additional training different from our framework.
F RAMEWORK
This section ﬁrst presents a class-speciﬁc scaling technique, which captures the landscape of the trade-off and identiﬁes the optimal performance points for desired objectives along the trade-off curve.
Based on the scaling strategy, we introduce a novel uniﬁed metric for evaluating the group robustness of an algorithm with consideration of the trade-off.
Finally, we propose an instance-wise class-speciﬁc scaling approach to overcome the trade-off and further improve the performance.
3. P ROBLEM S ETUP
Let us consider a triplet ( x, y, a ) consisting of an input feature x ∈ X , a target label y ∈ Y , and an attribute a ∈ A .
We construct a group based on a pair of a target label and an attribute, g :=
( y, a ) ∈
Y ×
A =: G .
We are given n training examples without attribute annotations, e .
g .
, { ( x 1 , y 1 ) , ..., ( x n , y n ) } , while m validation examples have group annotations for model selection, e .
g .
, { ( x 1 , g 1 ) , ..., ( x m , g m ) }
= { ( x 1 , y 1 , a 1 ) , ..., ( x m , y m , a m ) } .
Our goal is to learn a model f θ ( · ) :
X → Y that is robust to group distribution shifts.
To measure the group robustness, we typically refer to the robust accuracy such as unbiased accuracy (UA) and worst-group accuracy (WA).
The deﬁnitions of UA and WA require the group-wise accuracy (GA), which is given by
[Equation]
where 1 ( · ) denotes an indicator function and GA ( r ) is the accuracy of the r th group samples.
Then, the robust accuracies are deﬁned by
[Equation]
The goal of the group robust optimization is to ensure robust performance by improving UA and
WA regardless of the group membership of a sample.
3. R OBUST S CALING : C LASS -S PECIFIC S CALING FOR G ROUP R OBUSTNESS
We perform a simple non-uniform class-speciﬁc scaling of the scores corresponding to individual class and potentially change the ﬁnal decision of the classiﬁer to achieve the robustness by improving [Figure] worst-group or unbiased accuracies while sacriﬁcing the average accuracy.
Formally, the prediction with the class-speciﬁc scaling is given by
[Equation]
where ˆy ∈ R C is a prediction score vector, C is the number of classes, s ∈ R C is a C -dimensional scaling coefﬁcient vector, and (cid:12) denotes the element-wise product operator.
Based on the ERM model, we obtain a set of the average and robust accuracy pairs using a wide range of the class-speciﬁc scaling factors and illustrate their relations in Figure 3.
The black markers indicate the point with a uniform scaling, i .
e ., s = (1 , . .
. , 1) ∈ R C .
The graphs show that a simple class-speciﬁc scaling effectively captures the full landscape of the trade-off of the two accuracies.
We also visualize the relationship between scaling factors and robust accuracies in Figure 4, where the curves constructed based on validation and test splits are sufﬁciently well-aligned to each other.
This validates that we can identify the desired optimal points between robust and average accuracies in the test set by following a simple strategy: 1) ﬁnding the optimal class-speciﬁc scaling factors that maximize the target objective (UA, WA, or AA) in the validation set, and 2) apply the scaling factors to the test set.
We refer to this scaling strategy for robust prediction as robust scaling .
To ﬁnd the optimal scaling factor s , we adopt a greedy search 1 and the entire process takes less than a second.
Note that the robust scaling is a post-processing method, so it can be easily applied to any kinds of existing robust optimization methods without extra training.
Moreover, our method can ﬁnd any desired performance points on the trade-off envelop using a single model.
For example, there may be scenarios in which multiple objectives are required to solve a problem, but the robust scaling approach is ﬂexible enough to handle the situation as we only need to apply a robust scaling for each target metric using a single model.
Meanwhile, other existing robust optimization methods have limited ﬂexibility and require training of separate models for each target objective.
3. R OBUST C OVERAGE FOR C OMPREHENSIVE P ERFORMANCE E VALUATION
Although the robust scaling identiﬁes the desired performance point on the trade-off curve, from the perspective of performance evaluation, it still reﬂects only a single point on the trade-off curve while ignoring all other possible Pareto optimums.
For a more comprehensive evaluation of an algorithm, we propose a convenient evaluation metric that yields a scalar summary of the robustaverage accuracy trade-off.
Formally, we deﬁne the robust coverage as
[Equation]
where WA s and AA s denote the worst-group and average accuracies given by the scaled prediction using (3) with the scaling factor s , and D = 1000 is the number of slices for discretization. The
[Table] robust coverage measures the area under the Pareto frontier of the robust-average accuracy tradeoff curve, where the maximum operation in (4) ﬁnds the Pareto optimum for each threshold, as visualized in Figure 5c and 5d.
Note that the robust accuracies such as WA and UA are two popular target metrics and we can adjust class-speciﬁc scaling factors depending on the objectives.
Please refer to Appendix B.1 for more discussions.
3. I NSTANCE - WISE R OBUST S CALING FOR I MPROVING G ROUP R OBUSTNESS
We claim that the optimal scaling factor can be applied adaptively to each test example and has the potential to overcome the trade-off and improve accuracy even further.
Previous approaches (Seo et al., 2022a; Sohoni et al., 2020) have shown the capability to identify hidden spurious attributes via clustering on the feature space for debiased representation learning.
Likewise, we take advantage of feature clustering for adaptive robust scaling; we obtain the optimal class-speciﬁc scaling factors based on the cluster membership for each sample.
The overall algorithm of instance-wise robust scaling (IRS) is described as follows.
Clustering the examples in the validation split on the feature space and store the centroids of the clusters.
Find the optimal scaling factors for each cluster in the validation split.
Assign the examples in the test split to the clusters by selecting their nearest centroids obtained from step 1. 4.
For each sample in the test split, apply the optimal scaling factor obtained in step 2 based on its cluster membership.
In step 1, we use the na¨ıve k -means algorithm for clustering.
The number of clusters K is a hyperparameter but it can be easily tuned by selecting the one that gives the highest robust coverage in the validation set.
Empirically, a sufﬁcient number of K > 10 gives stable and superior results, compared to the original robust scaling.
E XPERIMENTS
[Table] 4. E XPERIMENTAL S ETUP
Datasets CelebA (Liu et al., 2015) is a large-scale dataset for face image recognition, consisting of 202,599 celebrity images, with 40 attributes labeled on each image.
Among the attributes, we primarily examine hair color and gender attributes as a target and spurious attributes, respectively.
We follow the original train-validation-test split (Liu et al., 2015) for all experiments in the paper.
Waterbirds (Sagawa et al., 2020) is a synthesized dataset, which are created by combining bird images in the CUB dataset (Wah et al., 2011) and background images from the Places dataset (Zhou et al., 2017), consisting of 4,795 training examples.
The two attributes—one is the type of bird, { waterbird, landbird } and the other is background places, { water, land } , are used for the experiments with this dataset.
Implementation details We adopt a ResNet-18 and ResNet-50 (He et al., 2016), which is pretrained on ImageNet (Deng et al., 2009), as our backbone network for CelebA and Waterbirds datasets, respectively.
We train our models using the stochastic gradient descent method with the
Adam optimizer for 50 epoch, where the learning rate is 1 × 10 − 4 , the weight decay is 1 × 10 − 4 , and the batch size is 128.
We adopt the standard K-means clustering and set the number of clusters
K = 20 in Section 3.4 for all experiments.
We select the ﬁnal model which gives the best unbiased coverage in the validation split.
Our algorithms are implemented in the Pytorch (Paszke et al., 2019) framework and all experiments are conducted on a single unit of NVIDIA Titan XP GPU.
Following previous works (Sagawa et al., 2020; Liu et al., 2021), we report the adjusted average accuracy as the average accuracy for Waterbirds dataset; we ﬁrst calculate the accuracy for each group and then report the weighted average, where the weights corresponds to the relative portion of each group in training set.
Evaluation metrics Following prior works, we evaluate all the compared algorithms with the average, unbiased and worst-group accuracies, and also with the proposed unbiased and worst-group coverages for a comprehensive view.
4. R ESULTS
Plugging RS into the existing methods Table 1 and 2 present the experimental results of our original robust scaling (RS) on top of the existing approaches (CR, LfF, JTT, Group DRO, GR) 2 on the CelebA and Waterbirds datasets, respectively.
In these tables, RS is applied to maximize each [Table] target metric (worst-group, unbiased, and average accuracies) independently.
We conducted three experimental runs and reported the average and the standard deviation of the results.
Group supervision indicates that the method requires training examples with group supervision.
As shown in the tables, no matter what the backbone method is, our robust scaling strategy consistently improves the performance for all target metrics.
Based on the robust coverage and robust accuracy after scaling,
LfF and JTT are not superior to ERM on the CelebA dataset, though their initial robust accuracies without scaling are much higher than ERM.
As well, LfF gives inferior trade-off results compared to ERM on the Waterbirds dataset.
This supports our argument that we need to evaluate in a more comprehensive way beyond robust accuracy.
On the other hand, the methods that leverages group supervision (Group DRO, GR) achieve better robust coverage results than others on both datasets, which validates that group supervision helps to improve the trade-off itself.
For Group DRO and
GR, our scaling provides relatively small performance gains in robust accuracy, as the gaps between robust and average accuracies are already small and the original results are already close to the optimal for maximizing robust accuracy.
Instance-wise Robust Scaling We evaluate all the proposed methods on the CelebA and Waterbirds datasets and present the results in Table 3.
We employ ERM, a class reweighting scheme (CR), and Group DRO as baselines, and apply our robust scaling methods, including the standard robust scaling (RS) and instance-wise robust scaling (IRS), to them.
We test our robust scaling strategies with two scenarios, each aimed at maximizing unbiased or average accuracies, respectively, where each target metric is marked in blue in the tables.
Compared to RS, IRS improve the robust coverage itself as well as the accuracy of the target metric for each scenario.
In particular, although
Group DRO have already achieved high robust accuracy and coverage, IRS further improves their results on both datasets.
This validates that our instance-wise class-speciﬁc scaling strategy is effective to overcome the trade-off between robust and average accuracies and truly improve the group robustness of baseline models.
4. A NALYSIS
Visualization of the trade-off curve and its Pareto frontier We visualize the robust-average accuracy trade-off curve and its corresponding robust coverage curve in Fig.
5 on the CelebA dataset.
In Fig.
5a and 5b, the black markers indicate the points where the scaling factor is not applied, indicating that there is room for improvement in robust accuracy along the trade-off curve.
Fig.
5c and 5d present the corresponding robust coverage curves, which represents the Pareto frontiers of [Figure] [Figure]
Fig.
5a and 5b, respecitvely.
The area under the curve in Fig.
5c and 5d indicates the robust coverage, which is reported in the legend.
Sensitivity analysis on the number of clusters We conduct the ablation study on the number of clusters for feature clustering in our instance-wise robust scaling method on the Waterbirds dataset.
Fig.
6 shows that the worst-group and unbiased accuracies are stable with a sufﬁcient number of
K > 10 .
We also plot the robust coverage results in the validation split, which tends to almost consistent with the robust accuracy.
This presents that we can select the optimal K based on the robust coverage results of the validation split.
C ONCLUSION
We presented a simple but effective post-processing framework that provides a novel perspective of group robustness.
Our work started from the observation that there exists a clear trade-off between robust and average accuracies in existing works, and argued that comparing only the robust accuracy should be regarded as incomplete.
To deal with this issue, we ﬁrst proposed the robust scaling strategy, which can capture the full landscape of trade-off and identify the desired performance point on the trade-off curve.
Based on this strategy, we introduced a novel convenient measurement that summarizes the trade-off from a Pareto optimal perspective for the comprehensive evaluation of group robustness.
Moreover, we proposed an instance-wise robust scaling algorithm with adaptive scaling factors, which is effective to improve the trade-off itself.
We analyzed the characteristics of existing methods and demonstrated the effectiveness of our proposed frameworks and measurements with extensive experiments.
We believe that the proposed approaches are helpful for analyzing the exact behavior of existing debiasing techniques and paving the way in the future research direction.
Ethics Statement As model learning focuses unconditionally on improving the overall performance, there is room for risks such as fairness or bias issues caused by dataset or algorithmic bias.
With the careful and comprehensive consideration of robust performance such as worst-group or unbiased accuracies, we believe our framework can help to alleviate this potentially harmful risks in model use.
We also acknowledge that we have read and commit to adhering to the ICLR code of ethics.
Reproducibility Statement We provide the dataset usage, implementation details, and evaluation metric in Section 4.1.
We reported all experimental results in the main tables based on the average of three runs with standard deviation.
A C OMPARISONS
Below is a brief introduction of the comparisons used in our experiments.
ERM Given a loss function (cid:96) ( · ) , the objective of empirical risk minimization is optimizing the following loss over training data:
[Equation]
Class reweighting (CR)
To mitigate the class imbalance issue, we can simply reweight the samples based on the inverse of class frequency in the training split,
[Equation]
LfF Motivated by the observation that bias-aligned samples are more easily learned, LfF (Nam et al., 2020) simultaneously trains a pair of neural network ( f B , f D ) .
The biased model f B is trained with generalized cross-entropy loss which intends to amplify bias, while the debiased model f D is trained with a standard cross-entropy loss, where each sample ( x i , y i ) is reweighted by the following relative difﬁculty score:
[Equation]
JTT JTT (Liu et al., 2021) consists of two-stage procedures.
In the ﬁrst stage, JTT trains a standard
ERM model ˆ f ( · ) for several epochs and identiﬁes an error set E of training examples that are misclassiﬁed:
[Equation]
Next, they train a ﬁnal model f θ ( · ) by upweighting the examples in the error set E as
[Equation]
Group DRO Group DRO (Sagawa et al., 2020) aims to minimize the empirical worst-group loss formulated as:
[Equation]
where n g is the number of samples assigned to g th group.
Unlike previous approaches, group DRO requires group annotations g
=
( y, a ) on the training split.
Group reweighting (GR) Using group annotations, we can extend class reweighting method to group reweighting one based on the inverse of group frequency in the training split, i .
e .,
[Equation]
B C LARIFICATION B. R OBUST COVERAGE IN THE TEST SPLIT
In Sec.
4.3 of the main paper, we deﬁned robust coverage as
[Equation]
[Table]
The robust coverage can be directly calculated in the validation split
[Table]
but unfortunately, it is basically unavailable in the test split.
This is because we need to know the values of WA s in advance to conduct max operation in (12)
[Table]
but we cannot use the information in the test split.
To bypass this issue, we report the robust coverage of validation split in this paper, which tends to be similar to those of the test split.
We also validate the reliability of the robust coverage of the test split.
We ﬁrst obtain a set of optimal scaling factors for each threshold in the validation split S val as
[Equation]
then the realized robust coverage of test split is calculated by
[Equation]
Table A4 presents the original robust coverage and realized robust coverage results on the test splits of Waterbirds and CelebA datasets.
Both coverage results are almost similar, because the optimal scaling factors identiﬁed in the validation split are close to optimal in the test split as well.
C A TTRIBUTE - SPECIFIC R OBUST S CALING WITH G ROUP S UPERVISION
If the supervision of group (spurious-attribute) information can be utilized during our robust scaling, it will provide ﬂexibility to further improve the performance.
To this end, we ﬁrst partition the examples based on the values of spurious attributes and ﬁnd the optimal scaling factors for each partition separately.
Like as the original robust scaling procedure, we obtain the optimal scaling factors for each partition in the validation split and apply them to the test split.
However, this partition-wise scaling is basically unavailable because we do not know the spurious attribute values of the examples in the test split and thus cannot partition them, In other words, we need to estimate the spurious-attribute values in the test split for partitioning.
To conduct attribute-speciﬁc robust scaling (ARS), we follow a simple algorithm described below:
Partition the examples in the validation split by the values of the spurious attribute.
Find the optimal scaling factors for each partition in the validation split.
Train an independent estimator model to classify spurious attribute.
Estimate the spurious attribute values of the examples in the test split using the estimator, and partition the test samples according to their estimated spurious attribute values.
For each sample in the test split, apply the optimal scaling factors obtained in step 2 based on its
partition.
To ﬁnd a set of scale factors corresponding to each partition, we adopt a na¨ıve greedy algorithm that performed in one partition at a time.
This attribute-speciﬁc robust scaling further increases the robust accuracy compared to the original robust scaling, and also improves the robust coverage, as shown in Table A5.
Note that our attribute-speciﬁc scaling strategy allows ERM to match the supervised state-of-the-art approach, Group DRO (Sagawa et al., 2020). [Table] [Table]
One limitation is that it requires the supervision of spurious attribute information to train the estimator model in step 3.
However, we notice that only a very few examples with the supervision is enough to train the spurious-attribute estimator, because it is much easier to learn as the word “spurious correlation” suggests.
To determine how much the group-labeled data is needed, we train several spurious-attribute estimators by varying the number of group-labeled examples, and conduct
ARS using the estimators.
Table A6 validates that, compared to the overall training dataset size, a very small amount of group-labeled examples is enough to achieve high robust accuracy.
D E XPERIMENTAL D ETAILS D. C LASS - SPECIFIC S CALING
To identify the optimal points, we obtain a set of the average and robust accuracy pairs using a wide range of the class-speciﬁc scaling factors, i .
e ., s i =
(1 . 05) n for − 200 ≤ n ≤ 200 for i th class.
Note that we search for the scaling factor of each class in a greedy manner, as stated in Section 3.2.
D. H YPERPARAMETER T UNING
CelebA For LfF, we used 1 × 10 − 4 of learning rate, 1 × 10 − 4 of weight decay, and 0.5 of q .
For
JTT, we used 1 × 10 − 5 of learning rate, 0.1 of weight decay, and 50 of λ up , and updated the error set every epoch.
For Group DRO, we used 1 × 10 − 5 of learning rate, 0.1 of weight decay, 3 of C , and 0.1 of η .
Waterbirds For LfF, we used 1 × 10 − 4 of learning rate, 1 × 10 − 4 of weight decay, and 0.5 of q .
For JTT, we used 1 × 10 − 5 of learning rate, 1.0 of weight decay, and 100 of λ up , and updated the error set every 60 epochs.
For Group DRO, we used 1 × 10 − 5 of learning rate, 0.1 of weight decay, 2 of C , and 0.1 of η . [Table] [Table]
E A DDITIONAL A NALYSIS
Scalability As mentioned in Sec. 3.
[Table] we actually search for the scaling factor of each class in a greedy manner.
Hence, the time complexity increases linearly with respect to the number of classes instead of the exponential growth with the full grid search; even with 1000 classes, the whole process takes less than a few minutes in practice, which is negligible compared to the model training time.
Moreover, we can reduce the computational cost even further by introducing the superclass concept and allocating a single scaling factor for each superclass.
We compare three different options—greedy search, superclass-level search, and full grid search—on the FairFace dataset K ¨ arkk ¨ ainen & Joo (2021) with 9 classes.
Table A7 shows that our greedy search is as competitive as the full grid search despite the time complexity gap in several orders of magnitude in computational complexity and the superclass-level search is also effective to reduce cost.
Note that the superclasses are identiﬁed by the feature similarity of class signatures.
Ablative study on the size of validation set Our robust scaling strategies need a held-out validation set to identify the optimal scaling factors, like as other existing approaches for early stopping and hyperparameter tuning. To validate the robustness of our frameworks against the validation set, we conduct the ablation study by varying the size of validation set.
Table A8 presents the ablative results using ERM baseline on the CelebA dataset, where the size of validation set is varied by { 100% , 50% , 10% , 1% } . As shown in the table, with only 10% or 50% of the validation set, both our robust scaling (RS) and instance-wise robust scaling (IRS) achieves almost competitive performance with the results using the full size of validation set. Surprisingly, even only 1% of the validation set is enough for RS to achieve sufﬁciently high robust accuracy, but inevitably entails a large variance of results. On the other hand, IRS suffers from performance degradation when only 1% of the validation set is available.
This is mainly because IRS takes advantage of feature clustering on the validation set, which needs some validation samples. Nevertheless, our robust scaling strategies can achieve meaningful performance improvement with a limited number of validation samples for all cases, which validates the robustness of our method.