G ENERATIVE L OW -S HOT N ETWORK E XPANSION
Anonymous authors
Paper under double-blind review
A BSTRACT
Conventional deep learning classiﬁers are static in the sense that they are trained on a predeﬁned set of classes and learning to classify a novel class typically requires re-training.
In this work, we address the problem of low-shot network-expansion learning.
We introduce a learning framework which enables expanding a pre-trained ( base ) deep network to classify novel classes when the number of examples for the novel classes is particularly small.
We present a simple yet powerful distillation method where the base network is augmented with additional weights to classify the novel classes, while keeping the weights of the base network unchanged.
We term this learning hard distillation , since we preserve the response of the network on the old classes to be equal in both the base and the expanded network.
We show that since only a small number of weights needs to be trained, the hard distillation excels for low-shot training scenarios.
Furthermore, hard distillation avoids detriment to classiﬁcation performance on the base classes.
Finally, we show that low-shot network expansion can be done with a very small memory footprint by using a compact generative model of the base classes training data with only a negligible degradation relative to learning with the full training set.
I NTRODUCTION
In many real life scenarios, a fast and simple classiﬁer expansion is required to extend the set of classes that a deep network can classify.
For example, consider a cleaning robot trained to recognize a number of objects in a certain environment.
If the environment is modiﬁed with an additional novel object, it is desired to be able to update the classiﬁer by taking only a few images of that object and expand the robot classiﬁer.
In such a scenario, the update should be a simple procedure, based on a small collection of images captured in a non-controlled setting.
Furthermore, such a low-shot network update should be fast and without access the entire training set of previously learned data.
A common solution to classiﬁer expansion is ﬁne-tuning the network Kading et al.
However ﬁne-tuning requires keeping a large amount of base training data in memory, in addition to collecting sufﬁcient examples of the novel classes.
Otherwise, ﬁne-tuning can lead to degradation of the network accuracy on the base classes, also known as catastrophic forgetting French (1999).
In striking contrast, for some tasks, humans are capable of instantly learning novel categories.
Using one or only a few training examples humans are able to learn a novel class, without compromising previously learned abilities or having access to training examples from all previously learned classes.
We consider the classiﬁer expansion problem under the following constraints:
Low-shot: very few samples of the novel classes are available.
No forgetting: preserving classiﬁcation performance on the base classes.
Small memory footprint: no access to the base classes training data.
In this work we introduce a low-shot network expansion technique, augmenting the capability of an existing (base) network trained on base classes by training additional parameters that enables to classify novel classes.
The expansion of the base network with additional parameters is performed in the last layers of the network.
To satisfy low-shot along with no-forgetting constraints, we present a hard distillation framework.
Distillation in neural networks Hinton et al.
(2014) is a process for training a target network to imitate another network.
A loss function is added to the target network so that its output matches the output of the mimicked network.
In standard soft distillation the trained network is allowed to deviate from the mimicked network.
Whereas hard distillation enforces that the output of the trained network for base classes matches the output of the mimicked network as a hard constraint.
We achieve hard distillation by keeping the weights of the base network intact, and learn only the newly added weights.
Network expansion with hard distillation yields a larger network, distilling the knowledge of the base network in addition to augmented capacity to classify novel classes.
We show that in the case of low-shot (only 1–15 examples of a novel class), hard distillation outperforms soft distillation.
Moreover, since the number of additional parameters in the expanded network is small, the inference time of the new network is nearly identical to the base network.
To maintain a small memory footprint, we refrain from saving the entire training set.
Instead, we present a compact generative model, consisting of a collection of generative models ﬁtted in the feature space to each of the base classes.
We use a Gaussian Mixture Model (GMM) with small number of mixtures, and show it inﬂicts a minimal degradation in classiﬁcation accuracy.
Sampling from the generative GMM model is fast, reducing the low-shot training time and allowing fast expansion of the network.
We deﬁne a benchmark for low-shot network expansion.
The benchmark is composed of a series of tests of increasing complexity, ranging from simple tasks where base and novel classes are from different domains and to difﬁcult tasks where base and novel classes are from the same domain and shares objective visual similarities.
We perform a comprehensive set of experiments on this challenging benchmark, comparing the performance of the proposed to alternative methods.
To summarize, the main contributions of the paper are:
A novel hard-distillation solution to a low-shot classiﬁer expansion problem 2.
GMM as a sufﬁcient generative model to represent base classes in a feature space 3.
A new benchmark for the low-shot classiﬁer expansion problem
R ELATED W ORKS
A common solution to the class-incremental learning problem is to use a Nearest-Neighbors (NN) based classiﬁer in feature space.
A signiﬁcant advantage of a NN-based classiﬁer is that it can be easily extended to classify a novel class, even when only a single example of the class is available ( one-shot learning ).
However NN-based classiﬁers require keeping in the memory signiﬁcant amount of training data from the base classes.
Mensink et al.
(2013) proposed to use Nearest Class Mean (NCM) classiﬁer, where each class is represented by a single prototype example which is the mean feature vector of all class examples.
One major disadvantage of NCM and NN-based methods is that they are based on a ﬁxed feature representation of the data.
To overcome this problem Mensink et al.
(2013) proposed to learn a new distance function in the feature space using metric learning.
The ideas of metric learning combined with the NN classiﬁer resonate with recent work by Vinyals et al.
(2016) on Matching Networks for one-shot learning, where both feature representation and the distance function are learned end-to-end with attention and memory augmented networks.
The problem we consider in this paper is different from the one discussed by Vinyals et al.
We aim to expand existing deep classiﬁer trained on large dataset to classify novel classes, rather than to create a general mechanism for one-shot learning.
Hariharan & Girshick (2016) presented an innovative low-shot learning mechanism, where they proposed a Squared Gradient Magnitude regularization technique for an improved ﬁxed feature representation learning designed for low-shot scenarios.
They also introduced techniques to hallucinate additional training examples for novel data classes.
In contrast, we present a method which aims to maximize performance in low-shot network expansion given a ﬁxed representation, allowing expanding the representation based on novel low-shot data.
Furthermore, in our work, we demonstrate the ability to expand the network without storing the entire base classes training data.
Recently, Rebufﬁ et al.
(2016) proposed iCaRL – (Incremental Classiﬁer and Representation Learning), to solve the class-incremental learning problem.
iCaRL is based on Nearest-Mean-of-Exemplars classiﬁer, similar to the NCM classiﬁer of Mensink et al.
In the iCaRL method, the feature representation is updated and the class means are recomputed from a small stored number of representative examples of the base classes.
During the feature representation update, the network parameters are updated by minimizing a combined classiﬁcation and distillation loss.
The iCaRL method was introduced as a class-incremental learning method for large training sets.
In Section 4 we discuss its adaptation to low-shot network expansion and compare it to our method.
Rusu et al.
(2016) proposed the Progressive Network for adding new tasks without affecting the performance of old tasks.
They propose freezing the parameters that were trained on old tasks and expand the network with a additional layers when training a new task.
Venkatesan & Er (2016) proposed the Progressive learning technique which solves the problem of online sequential learning in extreme learning machines paradigm (OS-ELM).
The purpose of their work is to incrementally learn the last fully-connected layer of the network.
When a sample from a novel class arrives, the last layer is expanded with additional parameters.
The Progressive learning solution updates the last layer only sequentially and only works in the ELM framework (does not update internal layers of the network).
In another work Venkatesan et al.
(2017) proposed an incremental learning technique which augments the base network with additional parameters in last fully connected layer to classify novel classes.
Similar to iCaRL, they perform soft distillation by learning all parameters of the network.
Instead of keeping historical training data, they propose phantom sampling - hallucinating data from past distribution modeled with Generative Adversarial Networks.
In this work we propose a solution that borrows ideas from freeze-and-expand paradigm, improved feature representation learning, network distillation and modeling past data with a generative model.
We propose to apply expansion to the last fully connected layer of a base network to enable classiﬁcation on novel classes, and to deeper layers to extend and improve the feature representation.
However, in contrast to other methods Rebufﬁ et al.
(2016); Venkatesan & Er (2016), we do not retrain the base network parameters, but only the newly introduced weights of the expansion.
Moreover, the extended feature representation is learned from samples of base and novel classes.
In contrast to Hariharan & Girshick (2016), where the improved feature representation is learned from simulating low-shot scenarios on the base classes only, before the actual novel data is available.
Finally, in order to avoid keeping all historical training data, we use Gaussian Mixture Model of the feature space as a generative model for base classes.
T HE PROPOSED METHOD
Assume a deep neural network is trained on K base classes with the full set of training data.
This base network can be partitioned into two subnetworks: a feature extraction network and a classiﬁcation network.
The feature extraction network f rep maps an input sample x into a feature representation v ∈ R N .
The classiﬁcation network f cls maps feature vectors v into a vector of approximated class posterior probabilities P ( k | v ) which correspond to each one of K classes.
The whole network can be represented as composition of two networks f net ( x ) =
f cls ( f rep ( x )) .
For example, if the classiﬁcation network consists of the last fully connected layer (FC) followed by softmax, then f cls ( v )[ k ] = 1 Z e w Tk v , where w k ∈ R N is class’s k weights vector, and Z is the normalization factor.
In the following we discuss how the pre-learned feature representation of feature extraction network can be leveraged to classify additional classes in low-shot scenario with only relatively minor changes to the classiﬁcation subnetwork.
3. E XPANSION OF THE LAST LAYER OF CLASSIFICATION SUBNETWORK
First, we discuss how to expand the classiﬁcation network to classify one additional class.
We can expand f cls from a K -class classiﬁer into K + 1 class classiﬁer by adding a new weight vector w K +1 ∈ R N to the last FC layer.
Thus, the K + 1 class probability is f cls ( v )[ K + 1] = 1 Z (cid:48)
e w TK +1 v , where Z (cid:48) is a new normalization factor for K + 1 classes.
We would like to preserve classiﬁcation accuracy on the base classes to avoid catastrophic forgetting.
To that end, during training we constrain to optimize of the w K +1 weights, while the vectors { w i } K i =1 are kept intact.
We refer to this paradigm as hard distillation .
By preserving the base classes weight vectors, we guarantee that as a result of the last classiﬁcation layer expansion the only new errors that can appear are between the novel class and the base classes, but not among the base classes.
Moreover, the small number of newly learned parameters helps avoid over-ﬁtting, which is especially important in low-shot scenarios.
Similarly, we can expand the classiﬁcation network to classify more than one novel class. [Figure] K # c l s rep [Figure]
[Figure] Old Weights Out Vec 1 G 3 G ... M 1 FC N expansion 1 FC
Old Weights K expansion 1 FC N
FC  expansion 1 FC expansion 2 FC 2 G
K + N o v e l s
Novels
[Figure]
3. D EEP F EATURE GMM - G ENERATIVE MODEL FOR BASE CLASSES
Due to the small memory footprint constraint, we are unable to keep the entire training data of the base classes.
As an alternative, we can use a generative model of the base classes and during training draw samples from the model.
There are various approaches to this task, such as GAN Goodfellow et al.
(2014), VAE Pu et al.
Pixel CNN van den Oord et al.
(2016), or conventional methods of non-parametric kernel density estimation Hastie et al.
However, it is usually hard to generate accurate samples from past learned distributions in the image domain, and these methods still require a signiﬁcant amount of memory to store the model network parameters.
Furthermore, since training typically requires thousands of samples, we prefer a generative model that allows fast sampling to reduce the low-shot phase training time.
In our work, we use the Gaussian Mixture Model (GMM) density estimator as an approximate generative model of the data from the base classes.
However, instead of approximating the generative distribution of the image data, we approximate a class conditional distribution of its feature representation.
Thus, we model a GMM P ( v | c = k ) =
(cid:80) Mi
=
π i N ( v | µ i , Σ i ) , where M is the number of mixtures for each bass class.
In order to satisfy the small memory footprint constraint, we use a
GMM which assumes feature independence, i.e., the covariance matrix Σ
i of each Gaussian mixture is diagonal.
We denote this model as Deep Feature GMM .
If we have K classes, and the feature vectors dimensionality is N , the memory requirements for storing information about base classes is
O ( MKN ) .
The feature representation v , which we learn a generative model for, can be from the last fully connected layer or from deeper layers.
In Section 4.5, we evaluate the effectiveness of the use of the Deep Features GMM, showing that despite its compact representation, there is a minimal degradation in accuracy when training a classiﬁer based only on data that is generated from the Deep
Features GMM, compared to the accuracy obtained on the full training data.
3. L OW -S HOT T RAINING
We apply standard data augmentation (random crop, horizontal ﬂip, and color noise) to the input samples of the novel classes and create 100 additional samples variants from each of the novel class samples.
These samples are passed through the feature extraction network f rep to obtain their corresponding feature representation.
Note that new samples and their augmented variants are passed through f rep only once.
As described in Section 3.1, we expand the classiﬁcation subnetwork f cls and train the expanded network to classify novel classes in addition to the base classes.
Figure 1(a) illustrates the proposed method in the case where f cls is the last fully connected layer.
As mentioned above, we only learn the N dimensional vector w K +1 , which augments the K × N weight matrix of the FC layer.
Each training batch is composed of base classes feature vectors drawn from the Deep Features GMM models learned from the base classes training data and the available samples of a novel class.
The training batch is balanced to have equal number of generations/samples per class.
Since the forward and backward passes are carried out by only the last FC layers, each iteration can be done very rapidly.
We use SGD with gradient dropout (see below) to learn w K +1 .
More speciﬁcally, the weights update is done by:
[Equation]
where µ is the momentum factor, α is the learning rate and M is a binary random mask with probability p of being 1 ( M is randomly generated throughout the low-shot training).
That is, the gradient update is applied to a random subset of the learned weights.
This SGD with gradient dropout is our heuristic variant for Noisy SGD proposed by Ge et al.
(2015) which provably helps to escape saddle points.
In Section 4.3 we demonstrate the contribution of the gradient dropout when only a few novel labeled samples are available.
3. E XPANSION OF D EEPER L AYERS FOR L EARNING R EPRESENTATION
The procedure described in the previous subsections expands the last classiﬁcation layer, but does not change the feature representation space.
In some cases, especially in those which the novel classes are similar to the base classes, it is desirable to update and expand the feature representation.
To expand the feature representation, we add new parameters to deeper layers of the network.
This of course requires an appropriate expansion of all subsequent layers.
To satisfy the hard distillation constraints, we enforce that the feature representation expansion does not affect the network output for the base classes.
All weights in subsequent layers which connects the expanded representation to the base classes are set to zero and remain unchanged during learning.
In Figure 1(b) we demonstrate an expansion of two last fully connected layers.
The FC 2 weight matrix is zero padded to adjust to the new added weights in FC 1 .
Only the expansion to FC 2 uses the new added features in FC 1 .
The details of the representation learning expansion can be found in Appendix D.
E XPERIMENTS
In this section, we evaluate the proposed low-shot network expansion method on several classiﬁcation tasks.
We design a benchmark which measures the performance of several alternative low-shot methods in scenarios that resemble real-life problems, starting with easier tasks (Scenario 1) to harder tasks (Scenario 2 & 3).
In each experiment, we use a standard dataset that is partitioned to base classes and novel classes.
We deﬁne three scenarios:
Scenario 1 Generic novel classes: unconstrained novel and base classes which can be from different domains.
Scenario 2 Domain speciﬁc with similar novel classes: base and novel classes are drawn from the same domain and the novel classes share visual similarities among themselves.
Scenario 3 Domain speciﬁc with similar base and novel classes: base and novel classes are drawn from the same domain and each novel class shares visual similarities with one of the base classes.
In each scenario we deﬁne ﬁve base classes (learned using the full train set) and up to ﬁve novel classes, which should be learned from up to 15 samples only.
We compare the proposed method to several alternative methods for low-shot learning described in Section 4.2.
4. D ATASETS FOR L OW -S HOT N ETWORK E XPANSION SCENARIOS
Dataset for Scenario 1 For the task of generic classiﬁcation of the novel classes we use the
ImageNet dataset Russakovsky et al.
such that the selected classes were not part of the
ILSVRC2012 1000 classes challenge.
Each class have at least 1000 training images and 250 test images per class.
The randomly selected 5 partition of 5 base classes and 5 novel classes.
Dataset for Scenario 2 and Scenario 3 For these scenarios we use the UT-Zappos50K Yu &
Grauman (2014) shoes dataset for ﬁne-grained classiﬁcation.
We choose 10 classes representing different types of shoes each having more than 1,000 training images and 250 test images.
To deﬁne similarity between the chosen classes, we ﬁne-tune the base network (VGG-19 Simonyan & Zisserman (2015)) on the selected classes with the full dataset, and we use the confusion matrix as a measure of similarity between classes.
Using the deﬁned similarities, we randomly partition the 10 classes to 5 base and 2 novel classes, where for Scenario 2 we enforce similarity between novel classes, and for Scenario 3 we enforce similarity between novel and base classes.
The confusion matrix representing the visual similarities and an illustration of the similarities between the base and novel classes is presented in Figure 10 in Appendix C.
4. E VALUATED M ETHODS
In the proposed method we use the VGG-19 network Simonyan & Zisserman (2015) trained on
ImageNet ILSVRC2012 Russakovsky et al.
(2015) 1000 classes as a feature extraction subnetwork f rep .
In all three scenarios for training the classiﬁcation subnetwork f cls on the base classes, we ﬁne-tune the last two fully-connected layers of VGG-19 on the 5 selected base classes, while freezing the rest of the layers of f rep .
We denote the method proposed in Section 3 as Generative Low-Shot Network Expansion: Gen-LSNE .
We compare our proposed method to NCM Mensink et al.
(2013), and to the Prototype-kNN method which is an extension of NCM and the soft distillation based method inspired by iCaRL method
Rebufﬁ et al.
(2016), adapted for the low-shot scenario.
4.2. NCM & P ROTOTYPE - K NN
We compare the proposed method to NCM classiﬁer proposed by Mensink et al.
Additionally, we extend the NCM classiﬁer by using multiple prototypes for each class, as in the Prototype-kNN classiﬁer Hastie et al.
Both NCM and Prototype-kNN are implemented in a ﬁxed feature space of the FC2 layer of the VGG-19 network.
In our implementation of the Prototype-kNN, we ﬁt a Deep
Features GMM model with 20 mixtures for each of the base classes.
We extract feature representation of all of the available samples from the novel classes.
The Deep Features GMM centroids of the base feature vectors and the novel feature vectors of the samples are considered as a prototypes of each class.
We set k for Prototype-kNN classiﬁer to be the smallest number of prototypes per class (the number of prototypes in the novel classes is lower than the number of mixture in the base classes).
The Prototype-kNN classiﬁcation rule is the majority vote among k nearest neighbors of the query sample.
If the majority vote is indecisive, that is, there are two or more classes with the same number of prototypes among the k nearest neighbors of query image, we repeat classiﬁcation with k = 1 .
4.2. L OW -S HOT WITH S OFT D ISTILLATION
We want to measure the beneﬁt of the hard distillation constraint in low-shot learning scenario.
Thus, we formulate a soft distillation based method inspired by iCaRL Rebufﬁ et al.
and
methods described by Venkatesan et al.
(2017) and Venkatesan & Er (2016)
as an alternative to the proposed method.
In the iCaRL method, feature representation is updated by re-training the whole representation network.
Since in low-shot scenario we have only a small number of novel class samples, updating the whole representation network is infeasible.
Using the soft distillation method, we adapt to the low-shot scenario by updating only the last two fully connected layers FC 1 , FC 2 , but still use a combination of distillation and classiﬁcation loss as in the iCaRL method.
The iCaRL method stores a set of prototype images and uses the Nearest Mean Exemplar (NME) classiﬁer at the ﬁnal classiﬁcation stage.
In order to provide a fair comparison with the hard distillation method and uphold our memory restriction, we avoid storing prototypes in image domain, and use the proposed Deep-Features GMM as a generative model for the base-classes.
Using NME classiﬁer with prototypes of the base classes is in fact a special case of Prototype-kNN with k = 1 .
Therefore, in soft distillation method instead of NME we use a learned expanded network with additional parameters in last fully connected layers, which aligns with Venkatesan et al.
(2017) and Venkatesan & Er (2016), and in our proposed hard-distillation method in Section 3.1. [Figure] [Figure] a v e r a g e t e
[Figure]
t
[Figure] [Figure] [Figure] [Figure]
[Figure]
[Figure]
[Figure]
[Figure]
[Figure]
[Figure]
[Figure]
[Figure]
[Figure]
[Figure]
GradDrop 15.
[Figure]
[Figure]
To summarize, soft distillation applies a distillation loss and allows the FC 1 , FC 2 layers to adjust to the new data, while the proposed hard-distillation freezes FC 1 , FC 2 and trains only the new (expanded) parameters without using a distillation loss.
We denote the soft distillation based methods as Soft-Dis in the presented results.
4.2. G RADIENT D ROPOUT
In Section 3.3 we proposed using gradient dropout regularization on SGD as a technique to improve convergence and overcome overﬁtting in a low-shot scenario.
We perform ablation experiments to assess the importance of the gradient dropout and train using both soft distillation (Soft-Dis) and proposed hard distillation (Gen-LSNE) with and without gradient dropout regularization.
4. R ESULTS : E XPANSION OF THE LAST FULLY CONNECTED LAYER
Scenario 1: Generic novel classes
In this experiment, the base classiﬁcation network is trained on ﬁve base classes and then expanded to classify two novel classes chosen at random.
For each of the ﬁve class partitions (Section 4.1), we perform ﬁve trials by randomly drawing two novel classes from ﬁve novel classes available in the partition.
The results are an average of 25 trials.
The results of this experiment are presented in Figure 2.
In Figure 6 in Appendix B we present detailed results of the test error on the base and novels classes apart.
Prototype-kNN and the Soft-Dis methods perform better on the base classes.
However, our method is signiﬁcantly better on the novel classes and the overall test error is considerably improved, particularly when the number of samples is small.
In addition, we see the signiﬁcant gain in accuracy delivered by the gradient dropout when the number of novel samples is lower than 3 samples.
Furthermore, gradient dropout also improves the results of the Soft-Dis method.
The Prototype-kNN method is unable to effectively utilize the new available novel samples, however it best preserves the base class accuracy when the number of novel samples and base class prototypes is high (above 5 , see Figure 6).
Since the number of prototypes used is equal to the number of novel samples used, the addition of a novel samples/base class prototypes generally has a greater impact on the preservation of the base class accuracy.
We assume that since the spread of the base class prototypes is better than that of the novel classes, then some novel samples are misclassiﬁed as some similar base class.
NCM generally performs considerably better than Prototype-kNN, despite the use of less information from the base classes.
However, NCM is unable to effectively utilize more novel samples when they are available.
Gen-LSNE signiﬁcantly outperforms NCM with a single novel sample, and overall outperforms all the tested method with nine and below samples per novel class.
Scenario 2 & 3: Domain speciﬁc with similar novel-to-novel and novel-to-base classes As described in Section 4.1, in each scenario we have 5 partitions with ﬁve base classes and two novel classes.
The results are an average of 5 trials.
The result of the experiments are presented in Figures 3 and 4.
In Scenario-2 & Scenario-3 we see that the proposed method consistently outperforms the [Figure] [Figure] v
[Figure]
t e
[Figure] [Figure] [Figure] [Figure]
[Figure]
[Figure] [Figure] Soft-Dis , NCM and Prototype-kNN methods. Training Gen-LSNE with gradient dropout improves results in cases with 1 & 3 novel samples per class, especially in Scenario-3.
Additionally, training with gradient dropout improves the results of the Soft-Dis method.
In Figures 7 and 8 in Appendix B we present detailed results of the test error on base and novels classes apart.
4. R ESULTS : E XPANSION OF D EEPER L AYERS FOR L EARNING R EPRESENTATION
In this section we explore the effect of expansion of deeper layers, as described in Section 3.4.
We partition the datasets as deﬁned in 4.1 to ﬁve base and ﬁve novel classes, and we test a 10 classes classiﬁcation task.
We expand the feature representation which is obtained after FC 1 layer withnew features.
The size of the feature representation after the FC1 layer of VGG-19 is of dimension 4k.
Thus, FC 1 is expanded with 4 k · 5 new weights.
The results are averaged over the 5 trails.
Figureshows the results obtained, we denote +5Inner as the experiments with the additional ﬁve shared representation features.
We see a marginal gain in Scenario 1.
However, we observe a signiﬁcant gain in Scenario 2 andwhen the number of samples increases (especially Scenario 2).
Observe that Gen-LSNE signiﬁcantly outperforms the alternative tested method in almost all of the tested cases.
Note that the addition of the ﬁve shared additional representation features has no observable effect on Soft-Dis .
[Figure]
[Table]
[Figure]
[Figure] [Table] [Figure] [Table]
(a)
[Figure]
g t [Figure] [Figure] [Table]
[Figure] [Table] [Figure] [Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
4. R ESULTS : D EEP - FEATURES GMM E VALUATION
In the Deep-features GMM evaluation experiment, we feed the full training data to the base network and collect the feature vectors before FC 1 , i.e., two FC layers before the classiﬁcation output.
We ﬁt a GMM model to the feature vectors of each of the base classes with a varying number of mixture.
We train the two last FC layers of the base network from randomly initialized weights, where the training is based on generating feature vectors from the ﬁtted GMM.
We measure the top-1 accuracy on the test set of the networks trained with GMM models and the base network trained with full training data [Table] on the datasets deﬁned in 4.1.
The difference in top-1 accuracy between the network trained with full data and the networks trained with GMM models represent degradation caused by compressing into simple generative model.
The results of the experiment presented in the Table 1 demonstrate that learning with samples from GMM models cause only a negligible degradation relative to learning with a full training set.
We observe that the degradation in accuracy is not monotonic in the number of GMM mixtures [Table] and that for many practical purposes a small number of mixture may be sufﬁcient.
C ONCLUDING R EMARKS
We have introduced Gen-LSNE , a technique for low-shot network expansion.
The method is based on hard-distillation, where pre-trained base parameters are kept intact, and only a small number of parameters are trained to accommodate the novel classes.
We presented and evaluated the advantages of hard-distillation: (i) it gains signiﬁcant increased accuracy (up to 20% ) on the novel classes, (ii) it minimizes forgetting: less than 3% drop in accuracy on the base classes, (iii) small number of trained parameters avoids overﬁtting, and (iv) the training for the expansion is fast.
We have demonstrated that our method excels when only a few novel images are provided, rendering our method practical and efﬁcient for a quick deployment of the network expansion.
We have also presented Deep–Features GMM for effective base class memorization.
This computationally and memory efﬁcient method allows training the network from a generative compact feature-space representation of the base classes, without storing the entire training set.
In basic setting of a hard distillation, novel class classiﬁcation is based on the base representation.
We have also presented an extended version of network expansion, where the representation is updated by training the last deeper layers.
We have shown that when more images of the novel classes are available, the adjusted representation is effective.
Generally speaking, the representation can be improved as more samples are available, but at the expense of longer training, larger memory footprint, and risking forgetting.
In the future we would like to continue exploring hard-distillation methods, in extremely low-shot classiﬁer expansion, where only one or a handful of images of the novel class are provided.
An additional research direction would be to maximize the information gain that is obtained from each novel image, aspiring towards human low-shot understanding.
A PPENDIX A VGG-19 B ASE NETWORK TRAINING HYPER PARAMETERS
We use batch size of 60 , and 5000 training iterations.
We apply SGD with momentum µ = 0 .
9 and with learning rate lr = 0 .
We apply polynomial learning rate policy with power = 0 .
[Figure]
and Lnorm weight decay of 0 . 0005 .
The network was ﬁne-tuned on two TITAN-X Pascal GPUs
[Figure]
PPENDIX
[Figure]
ASE
[Figure]
N
[Figure]
EST
[Figure]
RROR
[Figure]
[Figure] [Figure] A PPENDIX C C LASSES AND PARTITIONS OF UT-Z APPOS 50K Y U &
G RAUMAN (2014) DATASET
[Figure]
[Figure]
A PPENDIX D R EPRESENTATION L EARNING : W EIGHTS I NITIALIZATION
The fully connected layer FC1 is parametrized with weight matrix W ∈ R N × V , where V is the dimensionality of input feature vector ν
and N is the dimensionality of the output feature representation vector v .
As was described in Section 3.4 we want to extend the feature representation v ∈ R N with E additional dimensions ˜ v ∈ R E .
We expand the weight matrix W with E × V additional weights as shown in Figure 1(b).
We denote the expanded weights as W exp ∈
R E × V .
The expanded weights are to be learned from the novel data.
We draw a random set of S novel examples.
Let
[Equation]
denote the mean response of the FC1 to the set of novel examples.
Let { j i } Ei =1 be the E indexes of maximum elements of R .
We initialize the expansion to FC1 layer W exp in the following manner:
[Equation]
where w j ∈ R V is the j (cid:48)
th row of matrix W , (cid:15) ∼ N (0 , std ( W )) , and α is a weight constant (in our experiments α = 0 . 25 ).
This initialization allows the expansion of the feature representation ˜ v to have non zero responses (after ReLU) with respect to the novel samples.
Since we operate in a
Low-Shot scenario, where only few samples of novel classes are available, this weights initialization plays crucial role in convergence of FC1 extended weights.
We initialize the subsequent layer FC2 in the following manner: let
W (cid:48) ∈ R K × N be the weight matrix of FC2, where N is the dimensionality of the feature representation vector v and K is the number of base classes.
Since v was expanded with additional E features ˜ v , and we want to allow classiﬁcation of L novel classes, the dimension of expanded W (cid:48) will be ( K + L ) ×
( N + E ) .
As was mentioned in Section 3.4 and illustrated in Figure 1(b), the hard distillation constraint requires that
W (cid:48) will be zero-padded with K × E zeros to avoid inﬂuence of the expanded features ˜ v on the output of the base network.
In contrast, the expansion of W (cid:48) which we denote W (cid:48) exp ∈ R L × ( N + E ) should be encouraged to produce larger responses to ˜ v to improve learning.
We initialize the expansion of
FC2 layer W (cid:48) exp in the following manner:
[Equation]
where u ∈ {− 1 , 1 } with probability 0 .
5 and Γ is an ampliﬁcation parameter.
In our experiments we used Γ = 2 .
We found that this initialization technique is crucial in assuring convergence of the added weights and the ability of the new weights to improve classiﬁcation results in low-shot setting.