M ASSIVELY S CALING H ETEROSCEDASTIC C LASSIFIERS
Anonymous authors
Paper under double-blind review
A BSTRACT
Heteroscedastic classiﬁers, which learn a multivariate Gaussian distribution over prediction logits, have been shown to perform well on image classiﬁcation problems with hundreds to thousands of classes.
However, compared to standard classiﬁers, they introduce extra parameters that scale linearly with the number of classes.
This makes them infeasible to apply to larger-scale problems.
In addition heteroscedastic classiﬁers introduce a critical temperature hyperparameter which must be tuned.
We propose HET-XL , a heteroscedastic classiﬁer whose parameter count when compared to a standard classiﬁer scales independently of the number of classes.
In our large-scale settings, we show that we can remove the need to tune the temperature hyperparameter, by directly learning it on the training data.
On large image classiﬁcation datasets with up to 4B images and 30k classes our method requires 14 × fewer additional parameters, does not require tuning the temperature on a held-out set and performs consistently better than the baseline heteroscedastic classiﬁer.
HET-XL improves ImageNet 0-shot classiﬁcation in a multimodal contrastive learning setup which can be viewed as a 3.5 billion class classiﬁcation problem.
I NTRODUCTION
Heteroscedastic models learn an input-dependent noise term to capture uncertainty in their predictions.
In deep learning, they have been used successfully in large-scale image classiﬁcation (Collier et al., 2021), image segmentation (Kendall & Gal, 2017; Collier et al., 2020), regression (Lakshminarayanan et al., 2017), uncertainty quantiﬁcation (Tran et al., 2022;
Nado et al., 2021) and in bandit problems (Osband et al., 2021).
It is known from the economics literature that heteroscedastic classiﬁers are particularly suited to modelling classiﬁcation problems with many classes (Train, 2009) and this has been further observed in deep learning (Collier et al., 2021).
However, heteroscedastic classiﬁers add additional parameters to standard “deterministic” classiﬁers ( DET ) to deﬁne their K × K covariance matrix, with K the number of classes.
Even with low-rank approximations, the number of additional parameters scales linearly in K , thus imposing a significant cost in large-scale settings.
Also, these additional parameters must be stored in long-term storage and loaded in memory which can pose problems for both storage and memory bound applications.
For example, on JFT-4B, a dataset with 29,593 classes, the state-of-the-art and most scalable, to the best of our knowledge, heteroscedastic classiﬁcation method HET (Collier et al., 2021), does not ﬁt in memory on a large TPU slice (64 TPU v3 cells with 128 cores) when using a modest-sized ViT-L/32 base architecture.
In this paper, we propose HET-XL whose extra parameter count over DET scales independently of the number of classes.
In addition, HET requires tuning a temperature hyperparameter τ , which hinders the adoption of heteroscedastic classiﬁers in large-scale settings where hyperparameter sweeps are either very costly or not feasible at all.
HET-XL , in contrast, learns τ directly on the training set.
We argue and demonstrate empirically that this is feasible precisely in this very large-scale setting.
Despite the improved efﬁciency and ease of adoption, HET-XL performs consistently better across large-scale image classiﬁcation tasks compared to DET and HET and improves upon a DET baseline in the contrastive learning setting.
[Figure]
Contributions.
In summary, our contributions are: (1) We develop the HET-XL heteroscedastic classiﬁer, whose cost of deployment is signiﬁcantly reduced as compared to HET , the prior state-of-the-art.
In large-scale settings, HET-XL does not require tuning a temperature hyperparameter and has massively reduced parameter count compared to HET .
Moreover, HET-XL allows for a plug-in compatibility with existing large-scale classiﬁers, which is not the case for HET .
(2) On three image classiﬁcation benchmarks—JFT 300M, ImageNet-21k and JFT-4B—and for two different popular model classes, ResNet152 and ViT-L/32, HET-XL consistently outperforms HET and HET-H , a new hashing-based baseline we introduce.
For example, with a ResNet152 on JFT-300M, we increase precision@1 by 2.3% compared to HET , while adding about 9 times fewer parameters.
(3) We extend HET-XL to contrastive learning where the method improves ImageNet 0-shot classiﬁcation accuracy from 85.29% for a DET model to 85.56% on a LiT setup (Zhai et al., 2022).
B ACKGROUND ON H ETEROSCEDASTIC CLASSIFIERS
We now review the core prior work that our method builds on, a wider review of related work is provided in
Appendix A. We focus on classiﬁcation tasks where we learn classiﬁers of the form
[Equation]
based on some training data D = { ( x n , y n ) } Nn =1 .
A pair ( x n , y n ) corresponds to an input x n , e.g., an image, together with its label y n ∈ { 0 , 1 } K belonging to one, or multiple, of the K classes, in the multi-class and multi-label settings, respectively.
The model is parametrized by W ∈ R D × K and the D -dimensional representation φ ( · ; θ ) output by a neural network with parameters θ .
We have omitted the bias term to ease the presentation.
Throughtout the paper, we refer to W (cid:62) φ ( x ; θ ) ∈ R K as the logits , while we will use the term pre-logits for φ ( x ; θ ) ∈ R D .
We denote the elementwise product between tensors by ◦ .
Heteroscedastic classiﬁers learn an additional input-dependent noise distribution placed on the logits to capture uncertainty in the predictions of the model (Kendall & Gal, 2017; Collier et al., 2021; Train, 2009).
We consider the setting where this noise is modelled by a Gaussian, leading to the class predictions
[Equation]
(cid:15)
[Equation]
where σ can be either the softmax or the sigmoid transformation (see Fig.
1, right).
Above, we have introduced the covariance matrix Σ ( x ; θ cov ) of (cid:15) that is parametrized by θ cov ; we will describe Σ in more details in Section 2.2.
The resulting conditional probability p ( y | x ; { W , θ, θ cov } ) in Eq.
(2) is used to train the model on D by maximum likelihood and to make predictions at evaluation time.
2. E STIMATING THE HETEROSCEDASTIC PREDICTIONS
We will focus on the HET method from Collier et al.
(2021) as it obtains state-of-the-art performance on several benchmarks and operates at the largest scale.
As shown in Eq.
(2), heteroscedastic modelling requires marginalizing over the noise (cid:15) ( x ) .
The corresponding expectation cannot be solved analytically (Lu et al., 2020) and Collier et al.
(2021) use a Monte Carlo (MC) estimate by sampling from N ( 0 , Σ ( x ; θ cov )) , Fig. 1.
By relating Eq.
(2) to a generative process where σ approximates a discrete choice (Train, 2009), Collier et al.
(2020; 2021) further consider a temperature parameter τ > 0 to control this approximation.
More precisely, σ in Eq.
(2) is replaced by σ τ so that σ τ ( u ) =
σ (1 /τ · u ) .
We present more formally the construction of the HET classiﬁer in Appendix A.1.
Importantly, Collier et al.
(2020) show that τ is crucial to regulating a bias-variance trade-off between the bias with respect to the generative process and the variance of the MC estimate.
τ is tuned on a held-out set and the test performance is sensitive to its choice.
2. P ARAMETRIZING THE COVARIANCE MATRIX
A central component of heteroscedastic classiﬁers is the covariance matrix Σ ( x ; θ
cov ) ∈ R K × K .
It enables the model to learn which regions of the input space have noisy labels and what the correlations across classes are in those regions (Collier et al., 2021).
When clear from the context, we will omit the parameters θ cov .
Making Σ ( x ) dependent on the inputs is challenging.
Let us assume that Σ ( x )
=
L ( x ) (cid:62) L ( x ) is positive deﬁnite with the full-rank matrix L ( x
) ∈ R K × K that we vectorize as vec ( L ( x ))
∈ R K 2 .
Even simply using a linear transformation of the D -dimensional pre-logits to parameterize vec ( L ( x )) as
[Equation]
with C
[Equation]
(3) is not feasible due to the large number of elements in θ cov =
{ C } (for instance, K = 29 , 593 and D =in some of our settings in Section 6).
We could restrict Σ ( x ) to be a diagonal matrix (Kendall & Gal, 2017), scaling down C to R K × D , but this comes with a drop in performance (Collier et al., 2021).
Instead, a low-rank parametrization, with R (cid:28) K , of the form Σ ( x ) =
V ( x ) (cid:62) V ( x ) + diag ( d ( x )) with V ( x ) ∈ R R × K and d ( x ) ∈ R K
+ (4) offers a good trade-off between memory footprint and performance of the classiﬁer (Collier et al., 2021).
In that case, using a linear transformation of the pre-logits, as above, leads to θ cov of size O ( DKR + DK ) .
Collier et al.
(2021) consider a further optimized parametrization whereby V ( x ) =
J ◦ ( 1 R v ( x ) (cid:62) ) where
J ∈ R R × K and v ( x ) ∈ R K , with θ cov thus scaling in O
( DK + KR ) (in Appendix L, we discuss slightly more expressive variants of Eq.
(4) that do not increase the parameter count).
Despite these advances,
O ( DK + KR ) remains restrictive for modern large models and problems with a large number of classes.
HET-XL : S CALING HETEROSCEDASTIC CLASSIFIERS TO VERY LARGE K
Heteroscedastic classiﬁers have resulted in impressive performance gains across many tasks, see Section 1.
Empirically those improvements have been the biggest in large-scale classiﬁcation tasks with many classes (Tran et al., 2022; Collier et al., 2021).
However, their additional parameter count scales linearly in the number of classes K , see Section 2.
The increase in parameter count and corresponding memory use can be large relative to the performance gains.
For example, a DET ResNet152 applied to ImageNet-21k has 102.9M parameters, while a HET ResNet152 has 88% more parameters than DET .
HET provides a 1.4% increase in precision@1 for this task, however the additional cost may be considered too high for this gain.
In this section we will introduce our proposed solution, the HET-XL classiﬁer.
HET-XL has signiﬁcantly reduced deployment cost when K is large and still provides performance gains over HET , whose large parameter count can lead to overﬁtting, see Section 6.
On the above ImageNet-21k example, HET-XL provides a 2.4% performance gains with only 8% more parameters compared to DET .
3. HET-XL
The additional parameter count of HET compared to DET scales in O ( DK + KR ) because the noise term (cid:15) is directly parameterized in the logit space with dimension K .
We make the simple yet important observation: If we directly inject the noise term in the pre-logits φ ( x ; θ ) ∈ R D , and then reuse the existing linear
[Table]
[Equation]
transformation W ∈ R D × K from pre-logits to logits, we can remove this dependency on the number of classes K .
This core idea is illustrated in Fig.
We refer to the resulting extension of HET as HET-XL .
For
HET-XL , we thus replace Eq.
(2) with
[Equation]
with (cid:15) (cid:48) ( x ) ∈ R D ∼ N ( 0 , Σ (cid:48)
( x ; θ cov
[Equation] [Equation]
[Equation]
where crucially (cid:15) (cid:48) ∈ R D and the covariance matrix Σ (cid:48)
( x ; θ cov ) ∈ R D
× D apply to the pre-logits.
Therefore, when we parameterize Σ (cid:48) as per the HET parametrizations recalled in Section 2.2, the additional parameter count of θ cov compared to DET scales in O ( D 2 + DR ) and O ( D 2 R ) , respectively.
In large-scale settings
D is often small relative to K .
For example, for JFT-4B, K = 29 , 593 while D = 1024 for a ViT-L and
D = 2048 for a ResNet152, two representative large-scale image classiﬁcation models.
Because of the properties of Gaussian distributions under linear transformations, W
[Equation]
( φ ( x ; θ ) + (cid:15) (cid:48) ( x )) still deﬁnes a Gaussian distribution in logit space: N ( W (cid:62) φ ( x ; θ ) , W (cid:62) Σ (cid:48)
( x ) W ) .
However, the covariance matrix, or some decomposition thereof, is never explicitly computed in this space.
Interestingly, in Table(Appendix I), we show that the choice of sharing the W transformation between the pre-logits and the noise samples does not sacriﬁce performance compared to separate transformations W (cid:62) φ ( x ; θ )
+ ( W (cid:48) ) (cid:62) (cid:15) (cid:48) ( x ) .
Plug-in compatibility with existing large-scale classiﬁers.
In extreme classiﬁcation tasks, where K may be in the millions, the standard matrix-vector multiplication W (cid:62) φ ( x ; θ ) may have to be replaced by a more scalable logic, involving for instance a distributed lookup of the active classes (Zhang et al., 2018; Song et al., 2020).
Let us assume this logic is abstracted by an API of the form get logits ( φ ( x ; θ )) .
HET-XL can directly piggyback that functionality by using get logits ( φ ( x ; θ ) + (cid:15) (cid:48)
( x )) while HET cannot be easily adapted to this case.
Table 1 summarises the differentiating properties of HET and HET-XL .
L EARNING THE TEMPERATURE τ
As described in Section 2.1, the temperature τ of HET controls a bias-variance trade-off.
The resulting performance is sensitive to the value of τ whose choice is often dataset-dependent (Collier et al., 2020; 2021).
In practice, τ is included in the hyperparameter sweep which may become prohibitively expensive to run at scales considered here.
At the same time, bypassing this step or making the sweep too coarse may degrade performance (Collier et al., 2020).
We thus investigate strategies to automatically tune τ .
4. A REPRESENTATIVE BENCHMARK
As a working study, we consider the tuning of τ in HET-XL for a ResNet50x2 model on ImageNet-21k trained for 7 epochs (the dataset will be presented in more details in Section 6).“x2” refers to the factor multiplying the width of each layer (Szegedy et al., 2017).
This setting is representative of the large-scale tasks we deal with in our subsequent experiments, although slightly scaled down, both in terms of model size and training regime.
We do so to be able to compare with a wider spectrum of methods and assess the validity of the results with multiple replications (we will report the average and the standard error over three replications).
We provide further details of the benchmark in Appendix G.
Approaches with multiple trainings.
To obtain gold-standard references, we consider methods that tune τ based on multiple successive trainings.
In particular, we focus on grid search (GS) (assuming a grid of values for τ informed by an experienced user; see Appendix G) and Bayesian optimisation (BO) (Snoek
[Table]
et al., 2012) which we run for 30 full trainings; we use the implementation of Song et al.
Golovin et al.
None of those approaches would scale up to our largest experiments in Section 6.
Online gradient-based tuning.
Given that τ is a one-dimensional continuous hyperparameter, it is meaningful to consider approaches that optimize a validation objective by gradient descent, typically following a bi-level formulation (Maclaurin et al., 2015;
Luketina et al., 2016; Pedregosa, 2016; Franceschi et al., 2018;
Lorraine et al., 2020).
Those approaches need to approximate costly high-order derivatives that account for the dependency of the hyperparameters in the validation objective.
In our study, we will take Luketina et al.
as a representative gradient-based method that considers the hyperparameter dependency only through the current training step gradient (we formally describe their approach in Appendix G).
Moreover, because of the particular structure of τ —explicitly appearing both at training and validation time, unlike optimisation-related or regularisation-related hyperparameters that surface only at training time—it is feasible to consider and evaluate a simpler alternative gradient estimator, see Appendix G.
Do we need a validation set?
Simple training of τ .
The experiments we consider in Section 6 bring into play datasets with a large number of data points (from 12.8M up to 4B) over which training is limited to only a few epochs.
As a result, it is natural to wonder to what extent metrics collected on the training set are faithful to metrics computed on a proper held-out validation set, since overﬁtting seems unlikely to happen.
We thus consider an approach wherein τ is treated as a simple training variable, optimized via the training objective like { W , θ, θ cov } .
In the contrastive learning setting, Jia et al.
; Radford et al.
; Mustafa et al.
(2022) already successfully learned a temperature during training, although in a different context where τ was not responsible for a speciﬁc bias-variance trade-off like in HET-XL .
4. R ESULTS AND DISCUSSION
We summarise the results in Table 2.
The main conclusion is that there is no opportunity cost in using the simplest approach —tuning τ as a standard training parameter—even when compared to more advanced, e.g., Luketina et al.
(2016), and more expensive methods like GS and BO requiring multiple trainings.
Remarkably, we still observe the beneﬁt of “Simple training” in our larger-scale experiments, see Table 8.
In the perspective of having a plug-in deployment of HET-XL , “Simple training” has the advantage over
Luketina et al.
(2016) not to require an extra validation set to iterate over during training, which may be constraining in production pipelines.
In Appendix G, we try to replace the validation set of Luketina et al.
(2016) by some held-out subset, say 25%, of the (training) batches, but we observe some drop in performance (past the ﬁrst epoch, this held-out subset of the batches does not behave as actual held-out data anymore).
Let us consider the split of the entire training set D into D train ∪ D val .
We could hypothesise that GS and BO perform worse because their corresponding models are trained on less data, i.e., just D train (with D val being used to guide the tuning), as opposed to D train ∪ D val for “Simple training”.
In Appendix G, we check the effect of retraining on D train ∪D val the best models obtained by GS and BO, with no change in our conclusion.
Hence, from now on, we assume that the temperature τ in HET-XL is trained like any other model parameter.
C ONTRASTIVE LEARNING
Contrastive learning is a growing area of research (Radford et al., 2021;
Jia et al., 2021; Zhai et al., 2022;
Yu et al., 2022; Mustafa et al., 2022) where pairs of data, possibly of different modalities, e.g., image and text, are learned to be aligned.
Contrastive models have shown strong performance in zero-shot image classiﬁcation and retrieval, as well as when learning representations for downstream tasks.
5. H ETEROSCEDASTIC CONTRASTIVE LEARNING
Contrastive learning as classiﬁcation.
We can view contrastive learning as a massive classiﬁcation problem.
Assume a dataset of N image-text pairs D
= { ( a n , b n ) } Nn =1 .
We are trying to learn well-aligned representations of ( a n , b n ) that we denote by ( α n , β n ) , with α n , β n ∈ R D output by some neural network.
We want to push ( α n , β n ) to be similar while { ( α i , β n ) } i (cid:54) = n are encouraged to be dissimilar.
In this sense, we can see this setting as having two classiﬁcation tasks, one from image to text —given α n , identify the most similar β n —and one from text to image –given β n , identify the most similar α n —with K = N classes in both cases.
Since N (cid:29) 1 , those two “global” classiﬁcation tasks are approximated by “local”, batch-level classiﬁcation tasks.
Indeed, during training, given a batch B ⊂ { 1 , . . .
, N } of size B = |B| (cid:28) N , we focus on the contrastive loss L ( B )
=
12 B (cid:80) n ∈B {L image-text n ( B ) + L text-image n ( B ) } where we have deﬁned
L image-text n ( B ) = − log (cid:40)
[Equation]
(cid:80)
[Equation]
and L
[Equation]
n
[Equation]
Heteroscedastic classiﬁcation for contrastive learning.
Contrastive learning datasets have been primarily constructed automatically by web scraping (Radford et al., 2021;
Jia et al., 2021; Zhai et al., 2022; Yu et al., 2022).
This process leads to noisy image-text pairs (Jia et al., 2021).
This noise and the above view of contrastive learning as a massive classiﬁcation task suggests naturally the use of heteroscedastic models.
A naive application of Eq.
(2) would deﬁne two heteroscedastic classiﬁers with two covariance matrices Σ image-text ( a ) ∈ R N × N and Σ text-image ( b ) ∈ R N × N ( remember N = K ) (7) and for each batch B , the appropriate sub-matrices (with rows and columns indexed by B ) would be used for the sampling of (cid:15) , i.e., Σ image-text B ( a ) ∈ R B × B and Σ text-image B ( b ) ∈ R B × B .
Unfortunately, the scale of Σ image-text ( a ) and Σ text-image ( b ) is not manageable, e.g., N = 4B for some standard contrastive learning datasets (Zhai et al., 2022).
We next develop a HET-XL style contrastive learner where the noise is injected in the representation space (i.e., α n and β n ), enabling a scaling independent of the number of classes K = N .
5. C ONTRASTIVE LEARNING WITH HET-XL
Let us focus just on text-to-image classiﬁcation, as the image-to-text case is symmetric.
Looking at Eq.
(6), it is natural to think of the vector α n ∈ R D as being equivalent to the n -th column of W ∈ R D × K (remembering again that K = N ) in a standard classiﬁer like Eq.
Under this viewpoint, the image network producing the representations { α n } Nn =1 acts like a lookup function into the columns of W .
This perspective is especially natural in the case where the image tower is ﬁxed and not learned (Zhai et al., 2022).
In summary, we can thus mirror the standard classiﬁcation setup as follows.
Given a batch B of size B , we can collect the vectors { α n } n ∈B into a matrix A B ∈ R D × B , leading to the following (homoscedastic) classiﬁer for the input text b n , p ( a | b n ) = softmax (cid:0) A (cid:62)B β n (cid:1) , echoing the form of Eq.
We can now extend this reasoning to apply HET-XL to contrastive learning
[Equation]
with (cid:15) ( b n ) ∈
R D ∼ N ( 0 , Σ text-image ( b n )) , (8) where, as desired, Σ text-image ( b n ) remains of size R D
× D independent of K .
Table 6 Appendix A.2 shows the zero-shot results.
HET-XL improves ImageNet zero-shot performance from 85.29% to 85.56%.
[Table]
R ESULTS 6. A COMPETITIVE BASELINE HET-H : A HASHING APPROACH
The description of HET-XL (Section 3.1) has highlighted that we can improve HET by efﬁciently mapping a covariance deﬁned in a lower-dimensional space to the logit space.
Equipped with this insight, and to stress test our approach as competitively as possible, we design a baseline that retains the rich heteroscedastic modeling of HET without making the parameters θ cov scale with respect to K .
To this end, we take inspiration from the “hashing trick” (Weinberger et al., 2009;
Chen et al., 2015; Eban et al., 2020), notably popularised by its application to large-scale advertising problems (Chapelle et al., 2014).
The interested readers can ﬁnd more background about the hashing trick in Appendix A.3.
Let us consider a maximum covariance dimension H , with H (cid:28) K .
Moreover, analogously to the “hashing trick”, let h be a hashing function going from { 1 , . .
, K } to { 1 , . .
, H } .
Representing the hashing map via the matrix H ∈ { 0 , 1 } H × K with the ( j, k ) -th entry being non-zero when h ( k ) =
j , we obtain
E (cid:15) (cid:48)(cid:48) (cid:2) σ (cid:0) W (cid:62) φ ( x ; θ ) + H (cid:62) (cid:15) (cid:48)(cid:48)
( x ) (cid:1)(cid:3) with (cid:15) (cid:48)(cid:48)
( x ) ∈ R H ∼ N ( 0 , Σ (cid:48)(cid:48)
( x ; θ cov )) , (9) where, like in Section 3.1, the covariance Σ (cid:48)(cid:48)
( x ; θ cov ) ∈
R H
× H is in a lower-dimensional space.
The mapping induced by the hashing function h can lead to collisions, i.e., some different classes will be modeled by the same entry in the covariance matrix.
In advertising problems, the collisions in features have a regularizing effect (Chapelle et al., 2014).
Since H is deﬁned via the hashing function h , we only manipulate H through simple indexing operations.
To make a fair comparison with HET-XL , we will take H
= D , noting that if H = W , we fall back to HET-XL .
We name this method HET-H for heteroscedastic hashing.
6. L ARGE - SCALE IMAGE CLASSIFICATION
We evaluate HET-XL on three image classiﬁcation benchmarks: (i) Imagenet-21k, which is an expanded version of the ILSVRC2012 ImageNet benchmark (Deng et al., 2009; Beyer et al., 2020) with 12.8M training
[Figure]
l
[Figure]
( T r a i
[Figure]
s /i
[Figure]
g )
[Figure]
examples and 21,843 classes, (ii) JFT-300M (Hinton et al., 2015; Chollet, 2017; Sun et al., 2017; Kolesnikov et al., 2019) with over 300M training images and 18,291 classes and (iii) JFT-4B, an expanded version of the JFT dataset with over 4B training examples and 29,593 classes.
All these datasets have previously been used to benchmark the HET method (Collier et al., 2021;
Tran et al., 2022).
We evaluate on two performant large-scale image classiﬁcation architectures; ResNet152 (Szegedy et al., 2017) and ViT-L/32 (Dosovitskiy et al., 2020).
Further experimental details and hyperparameters are given in Appendix N. We build upon open-source implementations (Nado et al., 2021; Tran et al., 2022).
The code to implement HET-XL as a drop-in classiﬁer last-layer, and the scripts to replicate our ImageNet-21k results are already publicly available on GitHub ( url-withheld-to-preserve-anonymity ).
The
JFT and contrastive learning code is not publicly released as it makes use of proprietary datasets.
Analysis and discussion.
For both architectures on JFT-300M and ImageNet-21k, there is a consistent ranking of the methods, see Table 3.
HET outperforms DET .
HET-H outperforms HET , with one exception (ImageNet-21k ResNet152) and HET-XL outperforms or is on par with all other baselines.
It is also important to quantify the various costs of each method.
Each table shows the parameter count of the different methods.
Of course, the DET baseline always has the lowest parameter count.
We also choose the H hyperparameter of HET-H to equalize the number of parameters with the HET-XL method.
These two methods have signiﬁcantly reduced parameter count compared to the HET method.
This is an important consideration for real-world deployment which often has tight storage constraints (Song et al., 2020).
Parameters must be loaded into memory, impacting memory usage.
While it is more difﬁcult to quantify memory usage and latency considering interactions with XLA compilation (Sabne, 2020), we follow the best practices from the literature (Zhai et al., 2022).
To measure memory usage, we evaluate which models ﬁt into memory at varying batch sizes for a series of MC samples.
As it is demonstrated in Fig. 2 and Fig.(Appendix F), HET-XL has lower memory usage than HET and slightly lower memory usage to HET-H .
The conclusions about HET-XL ’s latency are more mixed.
The relative latency of the methods depends on the number of MC samples.
There is a trade-off between the cost of computing the samples from the Σ ( x ) matrix for HET and the cost of the W matrix multiplication in HET-XL .
For smaller numbers of MC samples, HET-XL is faster than HET and vice versa.
We provide a detailed analysis of this phenomenon in Appendix F.1.
When latency is a concern, the number of MC samples in the HET-XL method can be
[Table] [Table]
signiﬁcantly reduced with only a small impact on predictive performance, see Table 14 (Appendix H) for a sensitivity analysis.
In this regime, HET-XL is faster, uses less memory, has substantially reduced parameter count and still provides signiﬁcant performance gains over HET .
Model and data scaling ablations.
In Table 5, we see the results when we increase the model scale from a
ResNet152x1 to a ResNet152x2.
While both methods beneﬁt from model scaling, the relative gains between the DET and HET-XL methods remain roughly the same.
Similarly, we scale the number of training epochs for JFT-300M Table 4 and JFT-4B Table 10 (Appendix D).
Again all methods beneﬁt from more training examples and the relative differences between methods remain roughly the same.
Learning τ ablation.
In Table 8 (Appendix B), we run an ablation to separate the effect of learning τ from other features of the HET-XL method.
We see that learning τ accounts for part but not all of the gains over HET .
For example when we do not learn τ , HET-XL on JFT-300M still outperforms HET by 1.6% in precision@1, further increasing to 2.3% by learning τ .
Not only does removing the temperature hyperparameter ease the adoption of HET-XL , the performance gains also empirically conﬁrm the insight that we can learn τ in the large-scale setting (see Section 4).
Outside of that large-scale setting, i.e., where models are more prone to overﬁtting by training for further epochs, we demonstrate that learning τ becomes indeed less useful, see Table 9 in Appendix B.
How precisely we parameterize τ and the HET-XL ’s insensitivity to choices in this parameterization is set out in Appendix K.
C ONCLUSIONS AND FUTURE WORK
We have developed HET-XL that consistently outperforms the DET and HET approaches in image classiﬁcation and zero-shot classiﬁcation from a contrastively trained model.
In our large-scale settings, not only does HET-XL substantially reduce the parameter count compared to HET , it also removes the need to tune the extra temperature hyperparameter on a held-out set.
As a result, HET-XL signiﬁcantly eases the deployment of heteroscedastic classiﬁers in problems with many classes.
In future research, we would like to study approaches that can bypass Monte Carlo sampling, which can negatively impact the latency and memory of HET-XL , see Figure 2.
For example, we could exploit approaches based on some Taylor expansion of
Eq.
(2) (Collier et al., 2021) or based on mean-ﬁeld approximations (Lu et al., 2020).
One central question is how the simultaneous increase in bias introduced by those approximations together with a reduction in variance in the estimation of the integral of Eq.
(2) affect the training and end performance of the classiﬁers.
A R ELATED WORK
Our methodology connects with several lines of research, as described in the following paragraphs.
Uncertainty quantiﬁcation.
Total uncertainty can be divided into epistemic/model uncertainty and aleatoric/data uncertainty (Kendall & Gal, 2017).
The neural network uncertainty quantiﬁcation literature has primarily focused on epistemic uncertainty (Blundell et al., 2015; Gal & Ghahramani, 2016; Lakshminarayanan et al., 2017; Maddox et al., 2019).
Aleatoric uncertainty has the interesting property that it is irreducible, meaning that even in the large-scale settings such as those considered in this paper there may be considerable aleatoric uncertainty.
Heteroscedastic models are a popular method to model aleatoric uncertainty in regression (Bishop & Quazaz, 1997; Williams & Rasmussen, 2006), classiﬁcation (Kendall &
Gal, 2017; Collier et al., 2020; 2021; Osband et al., 2021; Fortuin et al., 2022; Tran et al., 2022) and image segmentation (Monteiro et al., 2020).
Prior work on heteroscedastic classiﬁcation has not been scaled up to problems of the size of JFT-4B and would require restricting the covariance matrix parameterization, for example to the diagonal, to enable scaling.
Additionally prior work, either ignores the temperature parameter leading to reduced predictive performance or requires an expensive grid search over the temperature.
Gaussian-sigmoid and Gaussian-softmax integrals.
A central component of our methodology lies in the computation of either Gaussian-sigmoid or Gaussian-softmax integrals (Daunizeau, 2017).
In both cases, no analytical forms exist for those integrals and we need to resort to approximations.
Those integrals play a central role in Bayesian inference (Bishop, 2006) and probabilistic machine learning (Murphy, 2012).
For heteroscedastic classiﬁers, Kendall & Gal (2017); Collier et al.
(2020; 2021) consider an estimation based on Monte Carlo sampling, which is feasible and practical for (say, with several hundreds to thousands samples) since the operation takes place at the ﬁnal layer, requiring only a single forward pass.
In a different context, for the modelling of ensembles from a single model, Lu et al.
(2020) propose to use mean-ﬁeld approximations that they benchmark against numerical approaches such as the unscented Kalman Filter (Wan & Van Der Merwe, 2000).
Variational bounds have also been proposed in the context of variational inference, see Bouchard (2007) and references therein.
Daunizeau (2017); Collier et al.
(2021) further consider approximations resulting from a Taylor expansion.
To the best of our knowledge, only the approaches based on Monte-Carlo sampling and Taylor expansion have been successfully exploited for heteroscedastic classiﬁers where the large-scale covariance is learned during training, unlike, e.g., Lu et al.
Extreme classiﬁcation.
Previous work has looked into classiﬁcation problems with millions of classes (often referred to as extreme classiﬁcation or massive classiﬁcation).
Zhang et al.
(2018) found empirically that the class probabilities concentrate on a few classes only, which are called “active classes”.
Motivated by this observation the authors propose an efﬁcient hashing-based implementation of “selective softmax”, which omits the non-active classes from the softmax computation.
Yuan et al.
(2020) proposed an efﬁcient training framework to handle extreme classiﬁcation tasks based on random projections.
The idea consists in training ﬁrst a random projected softmax classiﬁer and then recover the original classiﬁer.
Alonog the lines of approximating full softmax, Song et al.
(2020) introduce a large-scale training system for 100M classiﬁcation at Alibaba.
The proposed approach for accurately approximating the full softmax is pretty involved, including building a k -NN graph on W for fast retrieval of active classes, a specialized communication strategy (including gradient sparsiﬁcation) and a fast continuous convergence strategy for the end-to-end system.
Finally, there exist also frequency-based methods (see e.g., Grave et al.
(2017) and
references therein) assuming that the class distribution is imbalanced and focusing on the most frequently occurring classes.
Although this may be the case in language modeling context, these methods are not suitable for problems where all classes are important (e.g., in face recognition).
We emphasize that HET-XL can be easily combined with the methods above, unlike HET , which requires custom solutions to enable the matrices deﬁning Σ ( x ) to ﬁt in memory.
A. M ORE FORMAL BACKGROUND ABOUT HET
In this section, we derive the form of the HET classiﬁer, in particular, justifying why we introduce a temperature parameter and why we use MC sampling.
Our exposition follows that of Collier et al.
(2020; 2021), which we reproduce here for completeness.
Following the generative process typically employed in the econometric (Train, 2009), Gaussian-process (Williams & Rasmussen, 2006) and noisy-label (Kendall & Gal, 2017) literature, we consider a utility vector u ( x ) ∈ R K and (zero-mean) stochastic term (cid:15) ( x ) ∈ R K ∼ π ( x ) so that the probability p ( c | x ) for the class c ∈ { 1 , . .
, K } is deﬁned via
[Equation]
with e j ∈ { 0 , 1 } K denoting the one-hot vector with a one at the j -th entry and zeroes elsewhere.
In words, the probability for c corresponds to how often the utility, in expectation with respect to the stochastic perturbation, is maximal for c .
A classical, input-independent instantiation for π ( x ) =
π is an i.i.d.
Gumbel distribution, thus recovering the standard softmax with logits given by u ( x ) (Train, 2009).
HET considers instead π ( x ) =
N ( 0 , Σ ( x )) , in particular extending the “identical” and “independent” properties of the Gumbel distribution.
We have
[Equation]
The last two lines show how the temperature controls the approximation of the actual arg max while the
Monte Carlo sampling approximates the softmax -Gaussian integral with S samples.
A. C ONTRASTIVE LEARNING
We evaluate HET-XL added to a LiT style contrastive learner (Zhai et al., 2022).
During training, HET-XL takes just one MC sample.
At test time, the deterministic logits (using no MC samples) are used for zero-shot
[Table]
[Table] [Table]
classiﬁcation.
This test procedure combined with the single MC sample during training means the cost of adding a HET-XL head is negligible compared to the overall network.
In Appendix M, we run an ablation which justiﬁes this choice by demonstrating no change in the zero-shot accuracy of a HET-XL contrastive learner when using MC sampling versus a deterministic representation at test time.
For our experiments, we use a ViT-g text encoder network and ViT-G image encoder (Dosovitskiy et al., 2020).
The setup is trained on 256 v3 TPU cells (512 cores) for 18 billion examples with a batch size of 16,384, on the same data as the original LiT model.
Further experimental details are given in Appendix N.
In Table 6, we show the zero-shot ImageNet, CIFAR-100 and Oxford-IIIT Pets classiﬁcation accuracy for
HET-XL versus a baseline DET model.
We see a small but signiﬁcant gain on the primary ImageNet accuracy metric and no signiﬁcant difference in the CIFAR-100 and Oxford-IIIT Pets accuracies.
To contextualize the magnitude of the gains, we note that when the same DET model is trained for 4 billion rather thanbillion examples the zero-shot accuracy is 84.98/83.14/97.57 for ImageNet, CIFAR-100 and Oxford-IIIT
Pet respectively.
The gains we see from HET-XL on ImageNet are similar in magnitude to increasing the number of training examples shown to DET by a factor of 4.5.
In Table 7 we compare the effect of different placements of the normalization operations in HET-XL for contrastive learning.
Pre-normalization=
True, means that the normalization operation is applied to the deterministic representation outputted by the image or text tower.
Post-normalization=
True means that the normalization operation is applied after the sampled noise vector has been added.
We train with a ViT-L/ text tower for 2 billion examples.
We observe that it is crucial to add the noise term after normalization, however re-applying normalization after the noise has been added does not have a consistent effect.
In the full scale experiments, Table 6 we apply normalization before adding the noise but not after i.e. prenormalization=
True and post-normalization=
False.
A. B ACKGROUND ABOUT THE “ HASHING TRICK ”
It can be cumbersome to deal with the one-hot, or bag-of-word, encoding of features that have many categorical attributes.
A case in point is large-scale advertising problems (Chapelle et al., 2014) with categorical features describing the large sets of publishers and advertisers.
In such settings, we need to carefully bookkeep the different categories based on some associative data structures and it is difﬁcult to control the space taken by the resulting feature representations (i.e., (cid:80)
f ∈F C f where C f stands for the number of categories for the feature f
and F is the set of all the features).
The “hashing trick” (Weinberger et al., 2009; Chen et al., 2015; Eban et al., 2020) was developed to provide a simple-to-implement, robust 1 , fast and space-efﬁcient technique to deal with the above setting.
The “hashing trick” considers
• A user-deﬁned parameter H explicitly controlling the space of the representation, with possibly H (cid:28) (cid:80) f ∈F C f .
Here, H will correspond to the number of hash buckets.
• A hashing function hash
fn mapping a pair of feature-value ( f, v f ) to { 1 , . .
, H } .
[Table]
The H -dimensional feature representation ψ ∈ R H of the raw data { ( f, v f ) } f ∈F is obtained by the following simple procedure (see Section 4.3 in Chapelle et al.
• Initialize ψ = 0 .
• For f ∈ F , update ψ j = ψ j + 1 with j = hash
fn
(( f, v f )) .
Depending on the choice of H , the hashing trick operates as a dimensionality-reduction technique.
It leads to collisions wherein two different feature-value pairs ( f, v f ) and ( f (cid:48) , v f (cid:48) ) end up with the same entry in the feature representation.
In the example of large-scale advertising problems, the collisions generally act as a regularizer (Chapelle et al., 2014).
This technique works well in practice and has been widely adopted.
“Hashing trick” for HET .
Equipped with the previous insights, we can use the hashing trick to have a fast and space-efﬁcient mapping from the space of labels R K to R H .
We can then deﬁne the covariance matrix into the resulting lower-dimensional space R H , which is precisely what HET-H in Section 6.1 does.
Interestingly, in the context of HET-H , collisions have a different meaning: If two classes c and c (cid:48) are mapped to the same entry in R H , then they will share their covariance structure.
Our experiments with
H (cid:28) K showed that those collisions did not seem to be harmful in our settings.
B L EARNING τ
We ablate the effect of learning τ in the HET-XL method and also evaluate whether adding a learned temperature parameter to DET and HET makes up the gap with HET-XL , see Table 8.
We observe that on
JFT-300M and JFT-4B all methods beneﬁt from having a learned temperature parameter, however the gains from HET-XL can only be partially explained by learning τ .
On ImageNet-21k, where we train forepochs, only HET-XL sees a beneﬁt from learning τ , as opposed to applying a grid search based on the validation-set performance.
In the main paper, we argue that τ can be learned in the large-scale settings considered in the experiments.
By “large-scale” settings, we mean that we are in a regime whereby (i) the data scale is large relative to the model capacity and (ii) the training schedule, as typical at the scale, entails a few epochs.
Overﬁtting is therefore unlikely to happen.
Above, we observed on ImageNet-21k, with models trained for 90 epochs, that learning τ only has a positive effect for HET-XL and not the other methods.
We hypothesise that this may indicate that this setup is already at the limit of the large-scale setting we described.
[Table] [Table]
We evaluate our hypothesis that learning τ helps more when we can only train for a small number of epochs by comparing training on ImageNet-21k for 7 and 90 epochs, Table 9.
We observe, as expected, that as we train for longer the gains from learning
τ reduce.
C M ODEL SCALING ABLATION
We evaluate whether gains from the HET-XL method persist when the base model scale is doubled.
We see in Table 5 that when the base model scale is increased from a ResNet152x1 to a ResNet152x2 the relative gains from the HET-XL method on JFT-300M are similar to those observed earlier with a ResNet152x
Table 3.
D D ATA SCALING ABLATION
In Table 4 (main paper) and Table 10, we see that increasing the number of training epochs has little effect on the relative gains from the HET-XL method, while increasing the performance of all methods.
We scale training from 7 to 14 and 28 epochs on JFT-300M with the ViT-L/32 architecture, Table 4.
Similarly we scale the training epochs from 1 to 2 and 3 epochs on the JFT-4B dataset with a ResNet152x1 architecture,
Table 10.
E FLOP S METRIC
In the main paper, we report training and evaluation ms/img as the latency metric, Fig. 2.
FLOPs is another popular metric evaluating the computational cost of neural network models.
In Fig.
3 and Fig.
4, we report the training and evaluation FLOPs for a ViT-L/32 on JFT-4B and a ResNet152x1 on ImageNet-21k respectively.
We see a similar trend as for ms/img.
At high numbers of MC samples, HET-XL has a signiﬁcantly higher FLOPs versus the key baseline, HET .
However the trend is reversed at lower numbers of MC samples.
In Table 14 of Appendix H, we will see that the predictive performance of HET-XL is not highly sensitive to the number of MC samples.
[Figure] [Figure]
[Figure] [Figure]
F F URTHER LATENCY AND MEMORY RESULTS
In the main paper, we only report memory usage and latency metrics in the ResNet152x1 ImageNet-21k setting, see Fig. 2.
In Fig.
5 and Fig.
6, we additionally report memory usage and latency in the ViT-L/
JFT-4B setting.
We see similar trends as for the ImageNet-21k setting, with HET-XL memory usage less that HET and the ordering of the methods dependent on the number of MC samples.
F. A N ANALYSIS OF THE COMPUTATIONAL DEPENDENCY ON THE NUMBER OF MC SAMPLES
As previously observed, whether HET-XL has a better latency than HET depends on the number of MC samples used.
We next study this observation by deriving the time complexity for both HET-XL and HET , showing that the comparison depends on a trade-off with respect to K, D, R (as deﬁned in Section 2.2) and
S , which stands for the number of MC samples.
Let us deﬁne the dimension Q equal to K in the case of HET and equal to D , the dimension of the pre-logits, otherwise.
With the notation from Section 2.2, we recall that φ ( x ) ∈ R D and J ∈ R R × Q where R stands for the number of factors of the low-rank parametrization.
For both HET-XL and HET and a number S of
MC samples, the noise matrices (cid:15) S ( x ) ∈ R S
× K and (cid:15) (cid:48) S ( x ) ∈ R S
× D are generated according to (we omit all the bias terms for simplicity)
[Equation]
and
• z ∈ R S ∼ N ( 0 , I ) , • Z ∈ R S
× R ∼ N ( 0 , I ) , • K 1 ∈ R D × Q , • K 2 ∈ R D
×
Q .
Once the noise matrices (cid:15) S ( x ) and (cid:15) (cid:48) S ( x ) have been generated, the logits for the S MC samples are obtained by computing
[Equation]
for respectively HET and HET-XL .
In Table 11, we derive step by step the resulting time complexity for both HET and HET-XL , and show that we recover the experimental observation that HET-XL is more efﬁcient than HET for small numbers of MC samples.
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table] [Table]
We note that this time complexity analysis agrees with the experimentally observed training times computed in our proﬁling.
In particular Table 12 shows that on ImageNet-21k with ResNet152x1 the training time for
HET-XL is faster than HET up to 16 MC samples, with HET being faster from 64 MC samples on.
Note that there are several points at which HET-XL dominates HET e.g. HET-XL has better Prec@1 and NLL at
MC sample than HET at 1000 MC samples despite also being substantially faster to train.
Training times are computed from by multiplying the proﬁler train ms/img by the number of examples seen during training, as commonly done to benchmark large-scale vision models (Riquelme et al., 2021).
G T UNING OF τ
In this section, we discuss further details and results of Section 4.
G. D ETAILS ABOUT THE BENCHMARK
We consider the tuning of HET-XL for a ResNet50x2 model over ImageNet-21k with a training duration of 7 epochs.
The hyperparameters of the model are those from Table 3 in Dosovitskiy et al.
[Table]
To deﬁne our 3-fold split of the dataset, we take the standard validation set as the test set (containing 102, points), and extract from the training set a validation set (also with 102,400 points).
All the methods in the benchmark are tuned to minimize the validation negative log likelihood.
The grid search uses the following list of temperatures τ ∈ { 0 . 05 , 0 . 1 , 0 . 2 , 0 . 4 , 0 . 8 , 1 . 5 , 3 . 0 , 5 . 0 } which cover typical well-performing values mentioned in previous work (Collier et al., 2021).
The Bayesian optimization approach follows the default conﬁguration from Song et al.
We run a total of 30 training jobs, divided into 6 sequential steps of 5 parallel training jobs.
As far as the HET-XL -related hyperparameters are concerned, we set the range of τ as [0 . 05 , 5 . 0] , consider
R = 50 factors and use 1000 MC samples, as done in the rest of the paper.
G. T HE SPECIFIC STRUCTURE OF THE HYPERPARAMETER τ
The temperature τ has the property to explicitly appear both at training and validation time, unlike optimisation-related or regularisation-related hyperparameters that surface only at training time.
As we next see, this observation has implications about the way we can compute a gradient estimator to tune τ .
To ease the exposition, let us momentarily simplify our setup.
We consider a temperature-scaled model 1 /τ ·
f ( x ; Θ) ∈ R with a one-dimensional output, e.g., in a regression task.
The parameters of the model are summarised in Θ ∈ R P .
Moreover, let L train ( · , · ) and L val ( · , · ) be two loss functions, deﬁned respectively for training data ( x , y ) ∼ p train and validation data ( x , y ) ∼ p val .
We typically seek a temperature parameter that minimises some validation objective in a bi-level optimisation formulation (Franceschi et al., 2018)
[Equation]
for some parameters Θ ∗ ( τ ) deﬁned as a solution of the training problem
[Equation]
By applying the chain rule
[Equation]
we can compute the gradient of the objective in Eq.
(11) for a given pair ( x , y ) of the expectation, leading to:
[Equation] [Equation]
In the expression above, the most complex term to handle is ∇ τ Θ ∗ ( τ ) since it requires to differentiate through the solution of another optmization problem, notably involving higher-order derivatives (Maclaurin et al., 2015;
Luketina et al., 2016; Pedregosa, 2016; Franceschi et al., 2018; Lorraine et al., 2020).
Several approaches have been proposed to approximate this term.
For example, Luketina et al.
(2016) only consider the hyperparameter inﬂuence through the current gradient step solving Eq.
This formally translates into ∇ τ Θ ∗ ( τ ) ≈ − s t · ∇ τ [ ∇ Θ F train ( τ, Θ t )] with s t and Θ t being respectively the learning rate and iterate produced at step t by an iterative algorithm solving Eq.
(12), e.g., SGD.
In our comparison, we will take Luketina et al.
as a representative approach for efﬁcient gradient-based hyperparameter tuning.
A simple gradient estimator.
A remarkable property of the temperature is that F val in Eq.
(11) depends on τ not only through Θ ∗ ( τ ) —as it would be for example the case for weight decay—but also directly via 1 /τ .
While in absence of this property, the gradient of F val would solely rely on ∇ τ Θ ∗ ( τ ) , in the case of τ , we can assume that ∇ τ Θ ∗ ( τ ) =
(i.e., the optimal Θ ∗ ( τ ) mildly varies with τ ) and focus on − 1 τ 2 f ( x ; Θ ∗ ( τ )) for the gradient.
Interestingly, further approximating Θ ∗ ( τ ) ≈ Θ t , the resulting estimator is extremely simple and cheap to compute, e.g., no higher-order derivatives to compute (in Table 13, we refer to this approach as “Simple gradient”).
Moreover, we can notice that, provided that L train =
L val (in our comparison, both are set to the negative log likelihood) and the training and validation sets are identical, − 1 τ 2 f ( x ; Θ t ) falls back to the gradient we would take by treating τ as a standard training parameter by directly solving min τ> 0 , Θ ∈ R P F train ( τ, Θ) .
G. A DDITIONAL OBSERVATIONS
In addition to the results reported and discussed in Section 4, we make the following observations from
Table 13:
• In the training regime we are focusing on, it appears that applying grid search and Bayesian optimization to directly optimize the test likelihood (“2 fold”) does not lead to signiﬁcantly better performances.
• Retraining the best models obtained by grid search and Bayesian optimization (“+retrain”) typically comes with a drop in performance, which can be explained by the mismatch of the selected temperature when the training set is enlarged.
• The coarser approximation made by “Simple gradient” compared with Luketina et al.
(2016) leads to a worse likelihood.
• The approach of Luketina et al.
(2016) suffers more than “Simple gradient” when we approximate the true validation set by a fraction of the training batch (here, 12 . 5% and 25% ).
It may be explained by the fact that “Simple gradient” reduces to “Simple training” in the case where the validation and training sets coincide.
Note that, when 12 . 5% and 25% of the training batch are held-out as validation data, the model effectively sees fewer training points.
We account for this effect by running for respectively 12 .
5% and 25% more epochs.
H HET-XL SENSITIVITY TO THE NUMBER OF MC SAMPLES
We have seen above that the latency of the HET-XL method is sensitive to the number of MC samples used at training and eval time.
In Table 14, we conduct a sensitivity analysis of the method’s predictive performance to the number of MC samples.
We see that while, as expected, more MC samples results in broadly better predictive performance, the number of training and evaluation samples can even be reduced to 1 for HET-XL and still outperform HET with 1,000 MC samples.
[Table] [Table]
ImageNet-21k with ResNet152x architecture.
[Table]
I E FFECT OF SHARING W PROJECTION WITH NOISE SAMPLES
Three possible explanations for HET-XL ’s outperformance of HET are (i) learning τ , (ii) knowledge sharing due to the use of W to project both the pre-logits and the noise to logit space and (iii) the regularizing effect of vastly reducing the parameter count.
We have already seen, Table 8 Appendix B, that learning the temperature only accounts for part of the gains.
Below, Table 15, we run an ablation to test (ii) whether the
W sharing has a signiﬁcant effect on HET-XL ’s performance.
When we do not share the W , we instantiate a separate independent randomly initialized matrix W (cid:48) which is used solely to transform the noise samples to logit space; formally,
[Equation]
with (cid:15) (cid:48) ( x ) ∈ R M and W (cid:
) ∈ R M × K , (14) and M (cid:54) =
D .
In the setting with a ResNet152x1 on ImageNet-21k, we can see that sharing W has a small, if anything slightly negative effect on performance.
Hence, we conclude that the primary drivers of HET-XL ’s improved performance are learning τ and the regularization due to HET-XL ’s reduced parameter count.
For the HET-XL method presented in the other experiments throughout this paper, we opt to share W due to the minimal performance difference compared to not sharing W as well as the added simplicity and efﬁciency of the method as a result.
[Table] [Table]
HET-XL ties the dimensionality of (cid:15) (cid:48)
( x ) to the dimensionality of the last layer of the base network, D .
Following Eq.
(14), this is not strictly necessary and we could allow the dimension of (cid:15) (cid:48)
( x ) to be independent of D .
In Table 16 we vary precisely M .
Note that M is different from R , the rank of Σ (cid:48)
( x ; θ cov ) .
We observe that indeed as we increase M to D we see improved Prec@1 and NLL.
Note however that we can decrease
M by a factor of 8 from D down to M = 256 , and still have performance better than HET .
I. A NOTHER MOTIVATION FOR THE SHARING OF W
We provide another observation that further motivates why sharing the same matrix W for both φ ( x ; θ ) and (cid:15) (cid:48) ( x ) , as done by HET-XL in Eq.
(5), is a natural design decision
Let us write the rank- R covariance matrices for both HET and HET-XL Σ HET ( x )
=
Q ( x ) (cid:62) Q ( x ) with Q ( x ) ∈ R R
× K
and
[Equation]
A sufﬁcient condition for HET-XL to be able to express a covariance similar to that of HET is to have
[Equation]
In other words, if the span of the rows of W —a subspace of R K also referred to as row space of W or rowsp ( W ) for short—is well aligned with rowsp ( Q ( x )) , we can ﬁnd a matrix P ( x ) to satisfy the above relationship.
We test the hypothesis that the W learned by HET naturally aligns with rowsp ( Q ( x )) , which would justify our design choice for HET-XL .
To this end, we consider the HET ResNet152x1 model trained on ImageNet21k.
To quantitatively measure the alignment of rowsp ( W ) and rowsp ( Q ( x )) , we use the smallest principal angle (SPA) between those two subspaces (Bj¨orck & Golub, 1973).
We will manipulate the SPA via its cosine, i.e., cos( a SPA ( x )) .
Computing the SPA requires to compute the SVD of B (cid:62) W B Q ( x ) with B ∗ denoting orthonormal basis for rowsp ( W ) and rowsp ( Q ( x ))
(Bj¨orck & Golub, 1973).
We compute cos( a SPA ( x )) for each image x of the validation set and report in Table 17 the resulting mean and standard deviation.
To put in perspective the value obtained in the case of the learned W by HET , we also compute the same quantities in the case of randomly generated Gaussian W ∼ N ( 0 , I ) .
We can see that in the case of HET , the SPA is signiﬁcantly smaller (i.e., its cosine signiﬁcantly larger) than in the case of a random W , with arccos(0 .
≈ 0 .
593 < arccos(0 .
≈ 1 . 213 .
Compared with the random case, the learned W is thus such that rowsp ( W ) and rowsp ( Q ( x )) are well aligned, as required by Eq.
[Table] [Table]
J τ DYNAMICS
Fig.
7 shows the evolution of τ during training on ImageNet-21k with a ResNet152x1.
It is interesting to note the non-monotonic dynamics of τ .
In Table 18, we take the temperature at the end of this training run, τ = 0 .
50940 and re-run training from scratch with this ﬁxed temperature value.
The performance of the methods are similar, suggesting that the beneﬁts from learning τ come primarily from ﬁnding a very ﬁne-grained value of τ to train with and not that τ can take different values over time.
Finding such speciﬁc values of τ would only be possible with an expensive ﬁne-grained hyperparameter search, which is infeasible in the settings considered in this paper.
[Figure]
m p
[Figure]
[Table] [Table]
K τ PARAMETERIZATION AND SENSITIVITY TO τ STARTING POINT AND RANGE
When learning the temperature parameter
[Table]
we parameterize τ as
[Equation]
(16) where t is an unbounded trainable parameter to be learned and τ min and τ max are hyperparameters deﬁning the valid range of minimumn and maximum possible temperatures.
For all experiments in the main paper
[Table]
we use τ min = 0 .
05 , τ max = 5 .
and initialize t such that the initial τ 0 is set to the midpoint of [0 . 05 , 5 . 0] , i.e., 2.525.
In Table 19 and Table 20 we evaluate the effect of the choice of τ min and τ max and the initialization point along this range.
We see that the ﬁnal performance in the ResNet152x1 ImageNet-21k setting is not sensitive to these choices and that, if anything, further small improvements to the results in the paper would be possible by tuning these hyperparameters.
Since the removal of the need to tune the temperature hyperparameter in the HET method is the primary motivation for learning τ , we are satisﬁed with the insensitivity in performance to the temperature range and starting point and simply use this good default of τ min = 0 .
05 , τ max = 5 .
for all experiments.
L D IAGONAL COMPONENT PARAMETERIZATION
We recall that Collier et al.
(2021) parameterize the covariance matrix as
[Equation]
diag
[Equation]
d
[Equation]
x )) with V
[Equation]
x
[Equation]
K
[Equation]
However, we observe that, for the same parameter count, we can increase the expressiveness of Σ ( x ) while also reducing (marginally) the cost of MC sampling (cid:15) ( x ) by replacing the diagonal component with a rankcomponent
[Equation]
The marginally reduced cost of MC sampling is a consequence of the shape of underlying standard Normal samples N ( 0 , I ) required to sample from diag ( d ( x )) versus d ( x ) d ( x ) (cid:62) .
Let us denote by S the number
[Table]
of MC samples.
In the diagonal case, we must sample a tensor of standard Normal values of shape [ S, D ] , whereas similar to Monteiro et al.
(2020), to induce the non-diagonal covariance terms only a tensor of shape [1 , D ] is required.
This represents a saving of ( S − 1) × D standard Normal samples per example.
In
Table 21 we empirically evaluate these choices.
We see that the choice of this rank-1 vs. diagonal component parameterization has little effect on the predictive performance.
Hence, due to the marginal efﬁciency savings from the rank-1 parameterization, we choose to parametertize HET-XL accordingly.
To ensure a fair comparison, we also modify the Collier et al.
(2021) method parameterization to use this rank-1 approach.
This is the HET method reported throughout the paper.
M D ETERMINISTIC VERSUS STOCHASTIC HETEROSCEDASTIC CONTRASTIVE LEARNING AT TEST TIME
In our contrastive learning setup, we use only 1 MC sample at training time.
At test time we use the deterministic representations to perform zero-shot classiﬁcation, despite having added heteroscedastic noise at training time.
This is similar to the original HET paper, (Collier et al., 2021) which ﬁne-tunes deterministic representations from the HET model downstream on the VTAB (Zhai et al., 2019) benchmark.
Therefore, at test time the computational cost of HET-XL is equal to that of DET .
However we could also perform
MC sampling at test time.
Here we ablate our choice by performing test time MC sampling with 22 MC samples (the maximum that ﬁts in memory) and comparing the results to using the non-stochastic representations.
We use a smaller scale setup with a ViT-L/32 text encoder and 8 billion training examples (all other hyperparameters as per the contrastive experiment in the main paper).
We observe exactly the same zeroshot ImageNet accuracy of 84.35% regardless of whether we perform MC sampling or use the deterministic representation at test time.
N E XPERIMENTAL DETAILS AND HYPERPARAMETERS
All hyperparameters are as follows unless otherwise stated
. N. I MAGE CLASSIFICATION
All image classiﬁcation experiments are trained on 64 TPU v3 cells with 128 cores.
Heteroscedastic methods use 1,000 MC samples and the parameter efﬁcient covariance parameterization with R = 50 is used.
The temperature parameter for HET-XL is parameterized as per Appendix K.
JFT-300M. All methods and models are trained for 7 epochs with the Adam optimizer with β 1 = 0 .
9 , β 2 = 0 .
999 and weight decay of 0.1 and otherwise default JAX hyperparameters.
The learning rate un- dergoes a 10,000 linear warm-up phase starting at 10 − 5 and reaching 6 × 10 − 4 .
A batch size of 4096 is used.
ImageNet-21k.
All methods and models are trained for 90 epochs with the Adam optimizer with β 1 = 0 .
9 , β 2 = 0 .
999 and weight decay of 0.03 for ResNet152 and 0.1 for ViT-L/32 and otherwise default JAX hyperparameters.
The learning rate undergoes a 10,000 linear warm-up phase starting at 10 − 5 and reaching 10 − 3 .
A batch size of 1024 is used for ResNet152 and 4096 for ViT-L/32.
JFT-4B. All methods and models are trained for 1 epoch with the Adam optimizer with β 1 = 0 .
9 , β 2 = 0 .
999 and weight decay of 0.1 and otherwise default JAX hyperparameters.
The learning rate undergoes a 10,000 linear warm-up phase starting at 10 − 5 and reaching 6 × 10 − 4 .
A batch size of 4096 is used.
N.
C ONTRASTIVE LEARNING
All hyperparameters are taken from the original LiT paper Zhai et al.
(2022) unless otherwise speciﬁed.
We use a JFT pre-trained ViT-G image encoder and a ViT-g text encoder with a vocabulary size of 32,000.
We train with a batch size of 16,384 for 18B examples on 256 v3 TPU cells (512 cores).
A cosine learning rate schedule is used with a base learning rate of 10 − 3 and 10,000 warm-up steps.
Weight decay of 10 − 4 is used.
For HET-XL , the learned temperature is initialized to 3.0 and for DET it is initialized to 10.0.
R = 15 for the non parameter-efﬁcient covariance parameterization in HET-XL , which is trained with 1 MC sample but evaluated using the deterministic representations.
O F EW - SHOT PERFORMANCE
We follow Tran et al.
(2022) in evaluating the representations learned by HET-XL with a linear evaluation protocol on 9 few-shot learning datasets; birds, caltech, cars, cifar100, col hist, dtd, imagenet, pets, and uc merced; see Tran et al.
for further details about the datasets.
We evaluate 1-shot, 5-shot, 10-shot and 25-shot performance.
We evaluate 9 upstream settings
• ViT-L/32 trained on JFT-4B for 1 epoch, • ViT-L/32 trained on JFT-300M for 7, 14 and 28 epochs, • ResNet152x1 trained on JFT-4B for 1, 2 and 3 epochs, • ResNet152x1 trained on JFT-300M for 7 epochs and • ResNet152x2 trained on JFT-300M for 7 epochs.
Table 22 shows the performance for each number of shot(s), aggregated over the downstream datasets and the upstream settings.
We can observe that in all settings HET-XL yields representations that transfer to downstream tasks better than DET .
error.
An upstream setting is deﬁned by an upstream dataset, a base architecture and a number of epochs.
Please note that the standard errors are only equal after rounding and the reported standard errors are correct.
[Table]