---
title: Debiased Feature Augmentation (DeFA)
url: https://www.emergentmind.com/topics/debiased-feature-augmentation-defa
type: topic
---

# Debiased Feature Augmentation (DeFA)

Debiased Feature Augmentation (DeFA) most commonly denotes the feature-level debiasing framework introduced for image classification in "Learning Debiased Representation via Disentangled Feature Augmentation" [2107.01372]. It addresses dataset bias by synthesizing diverse bias-conflicting samples in feature space rather than relying only on naturally occurring bias-conflicting examples, which are described as significantly scarce in biased datasets. The method learns disentangled representations of intrinsic attributes and bias attributes, then generates augmented features by swapping latent bias features while preserving class-relevant intrinsic features. In the supplied literature, the acronym "DeFA" is also reused for later feature-augmentation methods in other domains, including compositional zero-shot learning [2509.12711]; unless otherwise specified, however, DeFA usually refers to the 2021 debiasing method for biased visual classification [2107.01372].

## 1. Problem setting and motivating observation

DeFA is situated in the standard dataset-bias setting in which image classification models rely on peripheral attributes of data items that have strong correlation with a target variable, causing poor generalization on unbiased datasets [2107.01372]. The framework is motivated by two observations stated explicitly in the source material. First, existing debiasing approaches often identify and emphasize samples with no such correlation, namely bias-conflicting samples, without defining the bias type in advance. Second, these bias-conflicting samples are significantly scarce in biased datasets, which limits the debiasing capability of such approaches [2107.01372].

The central empirical claim behind DeFA is that the diversity of bias-conflicting samples, not just their quantity, is crucial for debiasing as well as the generalization capability [2107.01372]. This reframes the problem: rather than only reweighting or isolating rare bias-conflicting samples, DeFA seeks to synthesize diverse bias-conflicting features from the much larger pool of bias-aligned samples. A plausible implication is that DeFA shifts the bottleneck from sample selection to representation manipulation.

This perspective is consistent with the broader argument that data augmentation can alter the relative importance of various features, effectively making certain informative but hard to learn features more likely to be captured in the learning process, and that this effect is more pronounced for non-linear models, such as neural networks [2203.01572]. In that sense, DeFA can be read as a targeted feature-manipulation strategy designed specifically for debiasing.

## 2. Disentangled representation learning

DeFA is built around a disentanglement module with two encoders and two linear classifiers [2107.01372]. The encoder \(E_i\) extracts intrinsic features \(z_i\) from image \(x\), and the encoder \(E_b\) extracts bias features \(z_b\) from the same image. The classifier \(C_i\) predicts the target label from concatenated features, while \(C_b\) predicts the bias label from concatenated features. The training protocol deliberately separates the two streams: gradient backpropagation is not shared between them, keeping bias and intrinsic representations independent [2107.01372].

The bias stream is trained to overfit to bias attributes using Generalized Cross-Entropy Loss (GCE), whereas the intrinsic stream uses standard Cross-Entropy Loss (CE) [2107.01372]. DeFA further adopts the relative difficulty score
\[
W(z) = \frac{CE(C_b(z), y)}{CE(C_i(z), y) + CE(C_b(z), y)},
\]
where high \(W(z)\) indicates that the sample is likely bias-conflicting because it is difficult for the bias-based classifier [2107.01372]. These high-\(W\) samples receive more emphasis when updating \(E_i\) and \(C_i\).

The overall disentanglement loss is
\[
\mathcal{L}_{\text{dis}} = W(z) \cdot CE(C_i(z), y) + \lambda_{\text{dis}} \cdot GCE(C_b(z), y),
\]
with the additional constraint that \(C_i\)'s loss is not backpropagated to \(E_b\), and vice versa [2107.01372]. This design is intended to separate class-defining information from spuriously correlated bias information while still using the biased stream to identify hard examples.

## 3. Feature augmentation by latent swapping

Once the two encoders are sufficiently disentangled, DeFA performs feature-level data augmentation by in-batch swapping [2107.01372]. For each sample in a mini-batch, the intrinsic feature \(z_i\) is retained, while the bias feature \(z_b\) is randomly replaced with \(\tilde{z}_b\) from another sample. The resulting augmented feature is
\[
z_{\text{swap}} = [z_i; \tilde{z}_b].
\]

This operation is designed to break the label-bias correlation: the intrinsic part remains associated with the original class, but the bias part is taken from a different image [2107.01372]. The source material states that the synthesized samples are diverse bias-conflicting features derived from the diversity of the majority bias-aligned samples. This suggests that DeFA treats the abundance of bias-aligned data not as a nuisance alone, but also as a reservoir from which diverse intrinsic attributes can be recombined into more informative training signals.

The augmentation objective is
\[
\mathcal{L}_{\text{swap}} = W(z) \cdot CE(C_i(z_{\text{swap}}), y) + \lambda_{\text{swap}_b} \cdot GCE(C_b(z_{\text{swap}}), \tilde{y}),
\]
where \(\tilde{y}\) is the swapped sample's bias label [2107.01372]. The full training objective is
\[
\mathcal{L}_{\text{total}} = \mathcal{L}_{\text{dis}} + \lambda_{\text{swap}} \mathcal{L}_{\text{swap}}.
\]

A critical implementation detail is scheduling. Swapping is introduced only after a certain point in training, when representations are already at least partially disentangled; early swapping injects noise and can harm learning [2107.01372]. This is not a minor optimization detail but part of the method definition, because the usefulness of swapping depends on the quality of the learned factorization.

## 4. Empirical behavior and reported results

The reported experiments use Colored MNIST, Corrupted CIFAR-10, and BFFHQ [2107.01372]. The paper first argues that models trained with diverse bias-conflicting samples, even in small numbers, outperform those with many but less diverse ones. That claim is central because it justifies feature synthesis as a debiasing mechanism rather than a mere data-expansion heuristic [2107.01372].

Against baseline methods, the reported scores are as follows on the stated biased settings: Vanilla achieves \(52.09\) on MNIST (1%), \(25.82\) on CIFAR-10 (1%), and \(56.87\) on BFFHQ (0.5%); LfF achieves \(61.89\), \(33.07\), and \(62.2\); ReBias achieves \(87.4\), \(25.72\), and \(59.46\); DeFA achieves \(81.73\), \(36.49\), and \(63.87\) [2107.01372]. The source text summarizes these results by stating that DeFA routinely outperforms existing baselines, especially those not reliant on bias type specification, and that for real-world data BFFHQ it leads over all methods, including those with access to bias labels or specifically tailored architectures [2107.01372].

The ablation study further isolates the contribution of the main components. With disentanglement only, the reported scores are \(74.03\), \(27.73\), and \(59.4\); adding augmentation without scheduling yields \(72.29\), \(32.81\), and \(61.27\); adding scheduled augmentation yields \(81.73\), \(52.31\), and \(63.87\) [2107.01372]. The accompanying interpretation is explicit: all components are crucial, especially scheduled augmentation.

The qualitative evidence is also part of the method’s empirical support. The source material reports that \(z_i\) and \(z_b\) cluster according to target and bias labels, respectively, in 2D t-SNE projections, and that reconstruction experiments show that swapping \(z_b\) changes the image’s color in MNIST or changes gender while preserving age in BFFHQ [2107.01372]. These observations are used to support the claim that the representation is meaningfully disentangled rather than only operationally separated by the losses.

## 5. Relation to adjacent debiasing methods

DeFA belongs to a larger family of feature-space debiasing methods, but its mechanism is distinct. In contrast to approaches that require bias types or explicit bias labels, the source text characterizes DeFA as requiring no bias type labels or pre-defined bias type [2107.01372]. In contrast to reweighting-only methods, it augments bias-conflicting sample diversity from the start by synthesizing new features [2107.01372].

A later image-classification method based on bias-contrastive pairs makes this contrast explicit. That work states that DeFA or disentangled feature augmentation increases the diversity of synthetic bias-conflicting data in feature space, but does not provide spatially explicit supervision or guidance regarding which features to focus on for debiasing [2404.19250]. The criticism is methodological rather than dismissive: DeFA addresses scarcity and diversity, whereas the later method addresses the separate question of where intrinsic features are located.

The acronym also appears in other domains with different meanings. In semantic segmentation, the supplied material summarizes a model-agnostic and stochastic training scheme, denoted there as "DropClass / DeFA," in which information related to a randomly sampled class is suppressed by a feature selection process in the feature space, reducing feature dependencies among classes and improving results especially for under-represented classes [2111.00531]. In compositional zero-shot learning, a later method also called DeFA integrates a disentangle-and-reconstruct framework for feature augmentation with a debiasing strategy, using frequency-aware weighting to address long-tailed distributions of attributes, objects, and compositions [2509.12711]. These later usages indicate that "DeFA" has become an umbrella acronym for debiasing through feature augmentation, even though the concrete architectures and objectives differ substantially.

## 6. Conceptual significance and limitations

DeFA’s main conceptual contribution is to shift debiasing from sample mining toward feature synthesis. The source material describes this as a move from increasing the number of bias-conflicting samples, which is impractical in real-world rare settings, to increasing their diversity via synthetic augmentation in feature space [2107.01372]. This is a precise claim about what the method changes in the debiasing pipeline.

A common misconception is to treat DeFA as ordinary data augmentation performed later in the pipeline. The 2021 method is more specific: it learns disentangled intrinsic and bias representations and then uses latent swapping to construct bias-conflicting features [2107.01372]. Another misconception is that the method works simply because it adds more training instances. The motivating experiments instead emphasize that diversity of bias-conflicting samples is crucial, and the broader theory of augmentation as feature manipulation supports the view that augmentation changes which features are likely to be learned by the model rather than only enlarging the dataset [2203.01572].

The limitations described in the supplied material are also concrete. DeFA depends on sufficient disentanglement before swapping; early swapping injects noise and can harm learning [2107.01372]. Moreover, later work argues that DeFA does not directly guide models where to focus for learning intrinsic features, because it lacks spatially explicit guidance [2404.19250]. This suggests that DeFA is strongest as a diversity-generation mechanism and weaker as an explicit localization mechanism.

Taken together, the supplied literature presents DeFA as a foundational feature-space debiasing strategy: it formalizes the synthesis of diverse bias-conflicting features from bias-aligned data, demonstrates competitive debiasing performance without bias type specification, and helped establish feature augmentation as a central instrument for robust representation learning under spurious correlation [2107.01372].

Source: https://www.emergentmind.com/topics/debiased-feature-augmentation-defa