R EDUCING I MPLICIT B IAS IN L ATENT D OMAIN L
EARNING
Anonymous authors
Paper under double-blind review
A BSTRACT
A fundamental shortcoming of deep neural networks is their specialization to a single task and domain.
While recent techniques in multi-domain learning enable the learning of more domain-agnostic features, their success relies ﬁrmly on the presence of domain labels, typically requiring manual annotation and careful curation of datasets.
Here we focus on latent domain learning , a highly realistic, yet less explored scenario: learning from data from different domains, without access to domain annotations.
This is a particularly challenging problem, since standard models exhibit an implicit bias toward learning only the large domains in data, while disregarding smaller ones.
To address this issue, we propose dynamic residual adapters that adaptively account for latent domains, and weighted domain transfer — a novel augmentation strategy designed speciﬁcally for this setting.
Our techniques are evaluated on image classiﬁcation tasks containing multiple unannotated domains, and we demonstrate they enhance performance, in particular, on the smallest of these.
I NTRODUCTION
While the performance of deep learning has surpassed that of humans in a range of tasks (He et al., 2016; Silver et al., 2017), machine learning models perform best when the learning objective is narrowly deﬁned.
Practical realities however often require the learning of joint models over semantically different examples.
In this case, best performances are usually obtained by ﬁtting a collection of models, with each model solving an individual subproblem.
This is somewhat disappointing seeing how humans and other biological systems are capable of ﬂexibly adapting to a large number of scenarios (Kaiser et al., 2017).
Past solutions that address this problem tend to fall into some category of multi-domain learning (Nam & Han, 2016;
Bulat et al., 2019; Schoenauer-Sebag et al., 2019).
In this setting, models are learned over diverse datasets each associated with an underlying distribution.
Multi-domain learning however relies ﬁrmly on the availability of domain annotations, for example to control domainspeciﬁc architectural elements (Rebufﬁ et al., 2017; 2018; Liu et al., 2019; Guo et al., 2019).
Reliance on domain annotations is not limited to the multi-domain scenario, their presence is also required in domain adaptation where models transfer between related tasks (Ganin et al., 2016;
Tzeng et al., 2017; Hoffman et al., 2018; Xu et al., 2018; Peng et al., 2019a; Sun et al., 2019b), continual learning (Kirkpatrick et al., 2017; Lopez-Paz & Ranzato, 2017; Riemer et al., 2019), meta learning over multiple tasks (Finn et al., 2017; Li et al., 2018a), or the generalization to previously unseen domains (Li et al., 2018b; 2019b;a; Gulrajani & Lopez-Paz, 2020).
The above approaches have established the notion that the presence of domain labels improves generalization.
In the real world however, these can often be difﬁcult or expensive to obtain.
Consider images that were scraped from the web.
Most image datasets such as Pascal VOC (Li et al., 2018a) or ImageNet (Deng et al., 2009) already rely on expensive manual ﬁltering and the removal of different looking images.
Existing multi-domain approaches require that the scraped images are further annotated for the mixture of content types they will contain, such as real world images or studio photos (Saenko et al., 2010), clipart or sketches (Li et al., 2017).
This can be an expensive process, moreover it is not clear which variations (indoor/outdoor, urban/rural, etc.) should be grouped.
A i r c r a ft
C i f a rD a
i m l e r
P ed .
D t d
G t s r b
O m n i g l o t
S v hn
U c f
V gg - F l o w e r s
R e l a t i v e P
e
r
f
o r m an c e
[Figure] [Figure]
ResNet
Ours
Here we consider the task of learning in absence of domain labels, or latent domain learning .
This scenario encompasses any task where we have inadequate resources to assign domain labels to all data, but have reason to believe that such a partitioning of the data would in principle make sense.
And as our experiments show, even when domain labels already exist, there is no guarantee that these are optimal for a given model.
In this paper, we therefore argue and demonstrate that learning implicit domain assignments, end-to-end alongside the rest of the network, is the superior option.
In Figure 1 we display accuracy for latent domain learning by jointly learning a single model over datasets from the Visual Decathlon benchmark that contains images from distinct domains with mutually exclusive classes.
Per-domain performance is measured relative to that of 9× models learned individually on each domain — a common baseline in the multi-domain setting (Rebufﬁ et al., 2018;
Liu et al., 2019).
This highlights the central challenge of latent domain learning: a signiﬁcant loss of performance for the joint model (•) on small domains.
While the performance drop is not signiﬁcant on large domains, relative accuracy is reduced by 15-20% on Aircraft and Ucf101, for example.
Latent domain learning therefore requires customized solutions, because standard models have an implicit bias through which they disregard the smallest domains in data .
The mechanisms we propose throughout this paper (shown in •) help overcome this: dynamic residual adapters (Section 3.3), which we couple with weighted domain transfer (Section 3.4) obtain robust performance on small domains, without trading performance on larger ones.
Our proposed solutions can be incorporated and trained seamlessly with existing architectures, and are able to surpass the performance of domain-supervised approaches that have access to human-annotated domain labels (Section 4.2).
Moreover, qualitative analysis demonstrates that they partition latent domains in a highly intuitive way (Figures 2 and 3).
R ELATED WORK
Multi-domain learning relates most closely to our paper.
The state-of-the-art introduces small convolutional corrections in residual networks to account for individual domains (Rebufﬁ et al., 2017; 2018).
Stickland & Murray (2019) extend this approach to obtain efﬁcient multi-task models for related language tasks.
Other recent work makes use of task-speciﬁc attention mechanisms (Liu et al., 2019), attempts to scale task-speciﬁc losses (Kendall et al., 2018), or addresses tasks at the level of gradients (Chen et al., 2017).
Crucially, these approaches all rely ﬁrmly on domain labels.
A lack of domain labels has previously attracted interest in domain adaptation, Hoffman et al.
(2012) use hierarchical clustering to uncover latent domains, other work investigates the use of kernel-based clustering (Gong et al., 2013), via exemplar SVMs (Xu et al., 2014), or mutual information (Xiong et al., 2014).
Different from these works, we propose tackling latent domains in an end-to-end fashion, which no longer requires a clustering ansatz.
In another line of work Mancini et al.
(2018) estimate batch statistics of domain adaptation layers with Gaussian mixture models using only few domain labels.
Peng et al.
(2019b) study the shift from some source domain to a target distribution that contains multiple latent domains.
In our setting, there is no signiﬁcant shift between source and target distributions, instead the focus lies on learning parameter efﬁcient models that generalize well across multiple latent domains.
Furthermore, our work is loosely related to learning universal representations (Bilen & Vedaldi, 2017), which Tamaazousti et al.
(2019) use as a guiding principle in designing more transferable models.
However, these works also assume the presence of domain labels.
Multi-modal learning does not make this assumption:
Deecke et al.
(2018) normalize data in separate batches to account for differences in feature distributions, while Chang et al.
(2018) propose an architecture that accounts for latent semantic factors to match images.
As we show in our experiments, latent domain learning beneﬁts from more customized solutions than these.
Our module gives rise to a differentiable dynamic network architecture, studied e.g. in the context of reinforcement learning (Zoph & Le, 2016; Pham et al., 2018), Bayesian optimization (Kandasamy et al., 2018), when adapting to new tasks (Mallya et al., 2018; Rosenfeld & Tsotsos, 2018), or in universal object detection (Wang et al., 2019).
For such architectures, two components are commonly used: Gumbel-softmax sampling (Jang et al., 2016), e.g. leveraged in dynamic computer vision architectures (Veit & Belongie, 2018; Sun et al., 2019a), or mixtures of experts (Jacobs et al., 1991;
Jordan & Jacobs, 1994), used to scale models to large problem spaces (Shazeer et al., 2017).
From the perspective of algorithmic fairness, a desirable property for models is to ensure consistent predictive equality across different identiﬁable subgroups in the data (Zemel et al., 2013;
Hardt et al., 2016; Fish et al., 2016; Corbett-Davies et al., 2017).
This relates to the central goal in latent domain learning: to limit the implicit model bias toward large domains, and improve robustness on small domains.
Wang et al.
(2020) explore this connection for visual recognition problems, different from our work they focus their analysis on a setting in which domain annotations are available.
M ETHOD 3. P ROBLEM SETTING
In multi-domain learning (Nam & Han, 2016;
Rebufﬁ et al., 2017; 2018;
Bulat et al., 2019;
Schoenauer-Sebag et al., 2019), it is assumed that data is sampled i.i.d.
from some mixture of domain distributions P d with domain labels d = 1 , . . .
, D .
Together, they constitute the underlying distribution as P =
(cid:80) d π d P d , where each domain is associated with a relative share π d = N d /N , with N the total number of samples, and N d those belonging to the d ’th domain.
In multi-domain learning, the domain label d is always available.
While the two are closely related, in the broader multi-task scenario (He et al., 2017; Kokkinos, 2017; Vandenhende et al., 2020) the nature of underlying tasks t = 1 , . .
, T is inherently different, and learning on each task distribution P t is associated with an individual loss function L t (for example, one task may be object classiﬁcation, the other semantic segmentation).
In multi-domain learning on the other hand, all the L t are associated with an equivalent problem type, but can vary substantially depending on domain membership.
1 This is also the case for latent domain learning, with the important distinction that learning occurs over non-annotated domains.
In latent domain learning the information that associates each sample with a domain d is no longer available.
As such, we cannot infer domain-speciﬁc labels y d from sample-domain pairs ( x , d ) and are instead forced to learn a single model f θ over the entire P .
We study two potential cases for latent domain learning. The ﬁrst setting (Section 4.1) includes mutually exclusive classes (as in Visual Decathlon) and a disjoint label space Y 1 ∪ · · · ∪ Y D that encompasses all domains.
This is a challenging setting, as models do not have a priori information about each domain’s label space Y d , and may therefore assign samples to false ones.
For the second one (Section 4.2), we focus on a setting in which label spaces are shared (for example, elephants can appear as a photo or painting) and Y d = Y d (cid:48) for all domains.
A standard baseline in multi-domain learning is to ﬁnetune D individual models, one for each domain (Rebufﬁ et al., 2018;
Liu et al., 2019).
Doing so requires learning a large number of parameters and shares no parameters across domains, but can serve as an upper guide on performance.
We show that in some cases, even when domain annotations were assigned carefully, a latent domain approach can surpass the performance of such strong domain-supervised baselines, see Section 4.2.
3. R ESIDUAL ADAPTATION
Residual adaptation builds on the observation that features from large pretraining tasks are universally applicable (Bilen & Vedaldi, 2017), and require only small modiﬁcations to correct for domainspeciﬁc differences.
Rebufﬁ et al.
(2017) use this insight to extend the layer-wise transformation of the widely adopted residual architecture (He et al., 2016):
[Equation]
where f θ denotes the main convolutions of the residual network (with parameters θ ), and h α ,d are small domain-speciﬁc convolutional corrections, i.e. dim( α ) (cid:28) dim( θ ) .
While several concepts can in principle be incorporated with latent domains (Perez et al., 2018; Park et al., 2019), residual adaptation stands out due to its methodological simplicity and is a well-established method in the multi-domain literature.
In this work access to d is removed, resulting in two new challenges: we have no a priori information about the right number of corrections { h α ,d } , and we cannot use d to decide which one of these to apply.
Throughout the next section, we present an alternative strategy of inspecting x and choosing relevant corrections
h α on the ﬂy.
3. D YNAMIC RESIDUAL ADAPTERS
While there is no access to domain labels d in latent domain learning, we still assume P is constituted by several domain distributions P d .
To account for these in a domain-unsupervised fashion, we propose the use of dynamic residual adapters (DRA): each incoming sample x is ﬁrst processed by K corrections { h α k } k =1 ,...,K , which we parametrize with light-weight 1x1 convolutions.
Next, a gating mechanism g k is responsible for weighing each correction h
α k , under which x is then transformed.
In the l ’th layer of the network, the subsequent feature representation computes as
[Equation]
with g lk ( x ) the k ’th component of the l ’th gating function.
For an illustration, see Figure 4.
While we motivate DRA from learning on latent domains, there is no guarantee that each gate will correspond to a single domain and many additional factors (shape, pose, color, etc.) may enter the gate assignments as well.
We parametrize the gating units using a self-attention mechanism (Lin et al., 2017).
The only learnable parameters are a small linear transformation W : C
→ R K s.t.
g ( x ) =
Softmax { W (cid:124) φ ( x )+ ε } .
Here φ ( x ) is a projection onto the channel dimension C that averages out height and width (average pooling), and ε ∼ N (0 , Σ ε ) a channel-wise noise that encourages gate exploration (Shazeer et al., 2017).
The gating mechanism corresponds to a categorical distribution over K categories, i.e. 0 ≤ g k ≤ 1 and (cid:80) k
g k
= 1 .
How to choose K is discussed in more detail in Section 4.1.
While many other parametrizations of the gating function g k are possible, self-attention enables assignments and thus allows for the weighted combination of different h α k .
Though discrete assignments can also be enforced through Gumbel-Softmax sampling (Jang et al., 2016), we found this approach to be too restrictive and underperforming.
We compare different gate parametrizations in Table 5 of the Appendix.
3. W EIGHTED DOMAIN TRANSFER
The central challenge in latent domain learning is the tendency of models to overaccount for large domains in P .
Besides accounting for this via dynamic residual adapters, we introduce an augmentation technique that encourages information exchange between latent domains.
We are motivated by the following example: assume two classes (say, cats and dogs) each with two latent domains (sketches and photos).
Ideally, we would want to encourage the model to learn a domain-agnostic representation of x , from which it may infer y , invariant of its latent domain d .
We achieve this here by augmenting x with the style information of a second sample x (cid:48) , drawn at random from P (so potentially, but not necessarily crossing domains).
A central challenge in latent domain learning is that we need to limit the transfer of information between highly similar samples, as this may restrict the model’s access to discriminative features. For example, within the same domain we can often associate particular visual information with individual classes, e.g. aircraft tend to appear in front of a blue sky, while dogs appear in natural scenes. Conceptually speaking, if we transfer between these two samples too aggressively, we may change the background scene of the dog to sky, whereby the model will learn it can no longer correlate sky and aircraft. To stop this from happening, our methodology limits the transfer between samples that are too similar, but transfers when the visual information in them appears different.
In weighted domain transfer (WDT) we randomly pair each sample x i with a second sample x j from the mini batch.
After average pooling samples onto channel dimensions s.t.
( µ i , µ j ) ∈ C , we compute their pairwise similarity in terms of the Bhattacharyya distance δ i =
( µ i − µ j ) (cid:124) σ − 1 ( µ i − µ j ) + 0 .
5 ln(det σ / (cid:112) det σ i σ j ) .
Here σ = ( σ i + σ j ) / 2 denotes the average of the channel-wise variances associated with each sample.
Note distances here are scalar values, i.e. δ ∈ R + .
Before exchanging information, distances have to be constrained to a suitable range.
To achieve this, we normalize them with their associated mean µ δ = (cid:80) i
δ i
/n (where n denotes the batch size) and standard deviation σ δ , squash them with a sigmoid S , and ﬁnally scale them with an exchange strength η , i.e. δ ηi = ηS [( δ i − µ δ ) /σ δ ] .
This yields a single exchange strength δ ηi ∈ [0 , η ] for each sample in the mini batch, which WDT uses to transfer information from x j to x i :
[Equation]
In practice, this combines the statistics of x i and x j with dynamic strength δ ηi depending on their pairwise similarity.
Crucially for latent domain learning we do not want to transfer between samples that are very similar, so if their pairwise distance is small, then δ ηj ≈ 0 ⇒ x i, new ≈ x i .
Figure 2 (right) shows that δ ηi can vary substantially, and does so depending on the domain associated with x i .
In line with style exchange approaches (Gatys et al., 2016; Huang & Belongie, 2017), we ﬁnd that applying WDT in early layers of the network is the most effective (see Table 7).
Further ablations in Tables 5-6 show that WDT is stable under various choices of η and signiﬁcantly outperforms a competitive augmentation strategy MixUp (Zhang et al., 2017), which does not consider the similarity between samples and less suited for latent domains.
E XPERIMENTS
We consider two experimental settings to evaluate our proposed approaches: Visual Decathlon for a traditional multi-domain setting but without access to domain labels (Section 4.1), and a dataset that contains equivalent classes for multiple latent domains (Section 4.2).
While not the focus of our paper, DRA also increases performance for single datasets and signiﬁcantly improves robustness to class imbalance, see Tables 3 and 4 in the Appendix.
All experiments were implemented in PyTorch (Paszke et al., 2017), and code will be made available alongside the camera ready version.
4. L ATENT V ISUAL D ECATHLON
The ﬁrst experiment combines nine datasets from the Visual Decathlon challenge (Rebufﬁ et al., 2017) that contain a variety of different images, with mutually exclusive labels, i.e.
[Equation]
Note the goal here is not to compare to the performance of existing multi-domain approaches that multi spaces Y d prevent this.
[Table] [Table]
[Table] [Table] [Table]
[Table]
[Table]
[Table]
Visual Decathlon was designed for, but to show that deep networks struggle with learning small latent domains when no domain annotations are provided.
For latent domain learning, domain labels are never used in training, and only serve to a posteriori decompose the weighted accuracy (denoted as W-Acc) reported in tables into domain-conditional metrics.
Optimization Initial ResNet parameters were obtained from ImageNet (Deng et al., 2009).
For dynamic residual adapters, only gates and corrections are learned, the ResNet26 backbone remains ﬁxed at its initial parameters.
As Rebufﬁ et al.
(2018) showed, this implicitly regularizes the network, while also beneﬁting performance (c.f.
our ablation in Table 5).
The exact same optimization routine is applied across all experiments: we trained for 120 epochs using stochastic gradient descent (momentum parameter of 0.9), batch size of 128, weight decay of 10 −4 , and initial learning rate of 0.1 (reduced by 1/10 at epochs 80, 100).
We use the ofﬁcial splits for Visual Decathlon, and report average accuracies over ﬁve random initializations.
All experiments use standard augmentation techniques: random cropping and ﬂipping, as well as normalization.
For WDT, we experimented with different exchange amounts η .
A range of values improve over having no augmentation, best results were obtained for η = 0 . 2 , see Table 6.
When increasing the number of residual adapters this also increases performance, however K = 2 already represents a good trade-off between learnable parameters and increase in modeling power.
Results In Table 1 we show results for a domain-supervised baseline of 9×ResNet26, one individual model for each domain d .
We then learn a single ResNet26, this time as a latent domain model over all nine domains.
Next, we couple DRA+WDT with the very same ResNet26.
For further comparison, we also include a signiﬁcantly deeper ResNet56.
Learning a single ResNet26 over latent domains with no access to labels signiﬁcantly harms performance, with accuracy dropping signiﬁcantly on the smaller domains.
This problem is not addressed by simply increasing the depth of the network: while weighted accuracy improves slightly, ResNet exhibits the same implicit bias against small domains, leaking performance there.
DRA+WDT close a large portion of the gap to domain-supervision and on four domains (Aircraft, Cifar-100, Dtd, VggFlowers) even surpasses the performance of the domain-supervised baseline.
Qualitative analysis To understand better how DRA processes samples from different latent domains, it is helpful to inspect which gates activate across the entirety of the network.
For a given sample, we follow its activation path across the L -layered network as Ψ k ( x ) (cid:44) ( g k 1 ( x ) , . .
. , g kL ( x )) .
When two samples have similar paths, this means they share similar residual corrections
h α k .
For simplicity, we set K = 2 in our analysis, s.t.
Ψ 1 ( x ) = 1 − Ψ 2 ( x ) .
We collected 26-dimensional gate activation paths for samples from all domains in Visual Decathlon, and visualize their principal components in Figure 2 (left).
This reveals a highly intuitive clustering of domains: Svhn (•) and Gtsrb (•) both show real-world, yet strictly deﬁned content (numbers and street signs).
CIFAR-100 (•) is known to exhibit a large amount of variation, and correspondingly maps to a relatively large region – compare this to Omniglot (•) which is a visually much simpler [Figure] dataset, and occupies a more primitive manifold.
Real-world datasets such as Ucf101 (•), Aircraft (•) and Dtd (•) share another common region.
These observations align with the exchange strength δ η for WDT recorded in Figure 2 (right).
There is little average exchange for Omniglot (•).
Information exchange for Dtd (•) on the other hand is substantial, in correspondence with its gate activations that place it in the close proximity of other latent domains.
4. L ATENT PACS
The second experiment examines performance on a dataset called PACS (Li et al., 2017), standing for its four constituting domains ( art painting, cartoon, photo, sketch ).
Each domain contains samples of equivalent classes (“elephant”, “giraffe”, etc.).
The domains are unbalanced (see π d in
Table 2).
We reserved 20% of samples for evaluation, leaving the remainder for training; we use random splits of the entire dataset, as the ofﬁcial splits are balanced for domains, whereas in the latent domain setting we assume no a priori knowledge of domain memberships.
We make no changes to the optimization described in Section 4.1.
Results Table 2 shows that dynamic residual adapters improve considerably over the latent domain baseline of a joint ResNet26, with the largest gains on smaller domains (91.67% versus 85.27% on art painting ).
Notably, DRA surpasses the weighted accuracy of 4x domain-supervised ResNet26, while requiring a much smaller number of learnable parameters (3.5mil versus 24.8mil).
Performance again increases with larger K in DRA.
To the best of our knowledge, latent domain learning has not been targeted through customized deep learning architectures.
A related baseline is MLFN (Chang et al., 2018), which builds on ResNeXt (Xie et al., 2017) to deﬁne a latent-factor architecture that accounts for multi-modality in data.
Crucially, where we share small convolutional corrections at every layer, MLFN instead enables and disables entire network blocks, allowing us to outperform MLFN.
While domain-supervised residual adapters (Rebufﬁ et al., 2018) have been shown to work extremely well in the multi-domain scenario, their performance here is sub-par.
This is likely because they exhibit no cross-domain sharing of parameters, which DRA does natively.
As k-means (using D = 4 centers) with subsequent ﬁnetuning shows, obtaining ﬁxed assignments across the depth of the network is suboptimal.
In DRA we learn gates in an end-to-end fashion and ﬂexibly share or separate features at every layer, thereby obtaining domain assignments that synergize with the overall model.
Memory requirements Adding DRA to the residual network results in additional memory requirements, since every layer requires O ( K |C| + K |C| 2 ) learnable parameters to parametrize gates and corrections, respectively. As we outline in Table 2 this is an extremely modest increase, in par- [Table] 94.72 DRA+WDT ( K = 5) (cid:51) 3.5 mil 90.
[Figure] CartoonPhotoSketch ticular as only a small subset of the parameters are learned (gates and residual corrections), while the convolutions of the residual backbone remain ﬁxed.
Qualitative analysis As Figure 3 (left) shows, DRA exhibits an intuitive clustering of PACS domains: visually similar domains art painting and photo (•,•) cluster together.
The manifold describing sketches (•) is arguably more primitive than those of the other domains, and indeed only maps to a small region.
Cartoon (•) lies somewhere between sketches and real world imagery.
This matches well with our intuition: a cartoon is, more or less, just a colored sketch.
We highlight one particular elephant that is placed amongst the cartoon domain, but has been assigned a ground-truth domain label of photo in the PACS dataset.
The ground-truth label was assigned in error, but different from approaches that use domain-supervision, dynamic residual adapters are not irritated by this.
Exchange strengths in Figure 3 (middle) again conﬁrms that WDT is more active for latent domains such as art painting and photo (•,•) that share parameters with each other.
As we demonstrate through samples from PACS in Figure 3 (right), similar activation paths Ψ k are indicative of additional visual similarities, not just domain membership: pose, color or edges of the shown samples are all closely related, compare in particular the poses of the elephants (second row) [Table] [Table] [Table]
[Table]
S INGLE DATASETS
Dynamic residual adapters require no domain annotations, and can therefore be used for learning on single datasets. Table 3 contains test accuracies on CIFAR-10 and CIFAR-100 (Krizhevsky & Hinton, 2009) for DRA ( K = 2 ).
We compare this to standard ﬁnetuning of the residual backbone as well as residual adapters Rebufﬁ et al.
DRA can be inserted seamlessly into the network, and we make no changes to the optimization outlined in Section 4.
[Table]
On both datasets, dynamic residual adapters outperform traditional ﬁnetuning and residual adapters.
We use no WDT here, which is speciﬁcally designed for the latent domain setting, but show that
DRA can be used as a general purpose module to increase performance on benchmark datasets.
Note the larger performance gap on CIFAR-100.
In all likelihood DRA has a special advantage there, as
CIFAR-100 is known to have small modes, which can be identiﬁed as small latent domains.
4. R OBUSTNESS
The beneﬁts of DRA are not restricted to the case of learning over multiple potentially unbalanced domains, but also extend to learning problems in which some classes are signiﬁcantly underrepresented, i.e. the marginals p ( y )
= (cid:82) X p ( y | x ) p ( x ) are heavily skewed.
We construct the following experiment for CIFAR-10: samples x that belong to one of the ﬁrst ﬁve classes (airplane, automobile, bird, cat, deer) are excluded from the dataset if u < 0 .
25 for u ∼ U [0 , 1] , so that around 75% of them are removed.
We learn models on this dataset using the standard optimization routine outlined in Section 4.1.
Results are shown in Table 4.
Measured in uniform accuracy (which weighs performance equivalently for all classes), ResNet drops from 95.20% (c.f. Table 3) to 91.14%, because the model – similar to what was observed for latent domains – suppresses the underrepresented classes 1-5.
Opposed to this, DRA performs as well as it does on standard CIFAR-10 classiﬁcation .
In other words, in the same way DRA raises the robustness for small latent domains, it also enhances models to have better performance on object classes for which less examples exist in the dataset.
We also display performance for ResNet56 (which has around 40% more parameters than DRA).
Its poor performance highlights that DRA addresses a fundamental issue that off-the-shelf deep learning models exhibit when dealing with imbalanced distributions, and which cannot be resolved by simply learning a deeper network.
C ONCLUSION
Recent work in multi-domain learning has been chieﬂy focused on a setting where domain annotations are assumed to be routinely available.
As this requires careful curation of datasets, in real world scenarios this assumption is often of limited merit.
Dynamic residual adapters inject adaptivity into networks, preventing them from overﬁtting to the largest domains in distributions, a failure mode of traditional models that is exposed in latent domain learning.
Not only does our approach close a large amount of the performance gap to domain-supervised solutions, but in some scenarios – even when domains have been assigned very carefully by human annotators – exceeds their performance.
In the future, we hope to extend the mechanisms described here to the regime of extremely small domains, and examine additional research questions that arise there, e.g. whether they can help defend against adversarial attacks.
A A PPENDIX I LLUSTRATIONS
Figure 4 visualizes the difference between (a) multi-domain learning and (b) latent domain learning, in which domain labels d remain hidden from the model.
In (c) we visualize the routing within our proposed dynamic residual adapters.
A BLATION
[Table]
Our ablations show that latent domain learning beneﬁts from both the addition of multiple dynamic residual adapters (i.e. K > 1 ) as well as WDT augmentation between feature maps of samples.
Each row in Table 5 corresponds to changing a single parameter or design element for DRA or WDT, and is compared to the baseline conﬁguration used in Table 1.
Removing the dynamic element of DRA by ﬁxing a single residual adapter ( K = 1 ) registers a signiﬁcant performance loss relative to K = 2 .
In line with what Rebufﬁ et al.
(2017) report, when not ﬁxing parameters θ of the ResNet convolutions, this leads to problems with overﬁtting.
Replacing mixtures of experts with Gumbel-softmax sampling negatively impacted performance, as smooth interpolations between residual corrections are beneﬁcial for sharing information between latent domains.
Performances for soft and straight-through Gumbel-softmax sampling were on par, and we report straight-through sampling here.
Having no augmentation from WDT ( η = 0 ) does not impact weighted accuracy much (-0.23%), but drastically reduces performance on small domains: accuracy drops from 40.83% to 37.50% for
Aircraft (-8.16%), as well as for Dtd (-2.23%), Ucf101 (-3.91%), and Vgg-Flowers (-2.99%).
[Table] [Table]
MixUp (Zhang et al., 2017), an alternative augmentation that interpolates between samples, is not equally well suited for latent domain learning.
Results for additional choices of η are shown in
Table 6: most values for η increase performance, when augmenting too little this however prevents a sufﬁcient amount of exchange, whereas too strong an augmentation impairs the relationship between latent domains and their associated labels.