C ONSTELLATION N ETS FOR F EW -S HOT L EARNING
Anonymous authors
Paper under double-blind review
A BSTRACT
The success of deep convolutional neural networks builds on top of the learning of effective convolution operations, capturing a hierarchy of structured features via ﬁltering, activation, and pooling.
However, the explicit structured features, e.g. object parts, are not expressive in the existing CNN frameworks.
In this paper, we tackle the few-shot learning problem and make an effort to enhance structured features by expanding CNNs with a constellation model, which performs cell feature clustering and encoding with a dense part representation; the relationships among the cell features are further modeled by an attention mechanism.
With the additional constellation branch to increase the awareness of object parts, our method is able to attain the advantages of the CNNs while making the overall internal representations more robust in the few-shot learning setting.
Our approach attains a signiﬁcant improvement over the existing methods in few-shot learning on the CIFAR-FS, FC100, and mini -ImageNet benchmarks.
I NTRODUCTION
Tremendous progress has been made in both the development and the applications of the deep convolutional neural networks (CNNs)
(Krizhevsky et al., 2012; Simonyan & Zisserman, 2015;
Szegedy et al., 2015;
He et al., 2016; Xie et al., 2017).
Visualization of the internal CNN structure trained on e.g. ImageNet (Deng et al., 2009) has revealed the increasing level of semantic relevance for the learned convolution kernels/ﬁlters to the semantics of the object classes, displaying bar/edge like patterns in the early layers, object parts in the middle layers, and face/object like patterns in the higher layers (Zeiler & Fergus, 2014).
In general, we consider the learned convolution kernels being somewhat implicit about the underlying objects since they represent projections/mappings for the input but without the explicit knowledge about the parts in terms of their numbers, distributions, and spatial conﬁgurations.
On the other hand, there has been a rich history about explicit object representations starting from deformable templates (Yuille et al., 1992), pictorial structure (Felzenszwalb & Huttenlocher, 2005), constellation models (Weber et al., 2000;
Fergus et al., 2003; Sudderth et al., 2005; Fei-Fei et al., 2006), and grammar-based model (Zhu & Mumford, 2007).
These part-based models (Weber et al., 2000; Felzenszwalb & Huttenlocher, 2005; Fergus et al., 2003; Sudderth et al., 2005; Zhu & Mumford, 2007) share three common properties in the algorithm design: (1) unsupervised learning , (2) explicit clustering to obtain the parts , and (3) modeling to characterize the spatial conﬁguration of the parts .
Compared to the CNN architectures, these methods are expressive with explicit part-based representation.
They have pointed to a promising direction for object recognition, albeit a lack of strong practice performance on the modern datasets.
Another line of object recognition system with the part concept but trained discriminatively includes the discriminative trained part-based model (DPM) (Felzenszwalb et al., 2009) and the spatial pyramid matching method (SPM) (Lazebnik et al., 2006).
In the context of deep learning, efforts exist to bring the explicit part representation into deep hierarchical structures (Salakhutdinov et al., 2012).
The implicit and explicit feature representations could share mutual beneﬁts, especially in fewshot learning where training data is scarce: CNNs may face difﬁculty in learning a generalized representation due to lack of sufﬁcient training data, whereas clustering and dictionary learning provide a direct means for data abstraction.
In general, end-to-end learning of both the implicit and explicit part-based representations is a viable and valuable means in machine learning.
We view convolutional features as an implicit part-based representation since they are learned through back-propagation via ﬁltering processes.
On the other hand, an explicit representation can be attained by introducing feature clustering that captures the data abstraction/distribution under a mixture model.
In this paper, we develop an end-to-end framework to combine the implicit and explicit part-based representations for the few-shot classiﬁcation task by seamlessly integrating constellation models with convolution operations.
In addition to keeping a standard CNN architecture, we also employ a cell feature clustering module to encode the potential object parts.
This procedure is similar to the clustering/codebook learning for appearance in the constellation model (Weber et al., 2000).
The cell feature clustering process generates a dense distance map.
We further model the relations for the cells using a self-attention mechanism, resembling the spatial conﬁguration design in the constellation model (Weber et al., 2000).
Thus, we name our method constellation networks (ConstellationNet).
We demonstrate the effectiveness of our approach on standard few-shot benchmarks, including FC (Oreshkin et al., 2018), CIFAR-FS (Bertinetto et al., 2018) and mini -ImageNet (Vinyals et al., 2016) by showing a signiﬁcant improvement over the existing methods.
An ablation study also demonstrates the effectiveness of ConstellationNet is not achieved by simply increasing the model complexity using e.g. more convolution channels or deeper and wider convolution layers (WRN-28-10 (Zagoruyko &
Komodakis, 2016))
(see ablation study in Table 3 and Figure 2.d).
R ELATED W ORK
Few-Shot Learning.
Recently, few-shot learning attracts much attention in the deep learning community (Snell et al., 2017; Lee et al., 2019).
Current few-shot learning is typically formulated as a meta-learning problem (Finn et al., 2017), in which an effective feature embedding is learned for generalization across novel tasks.
We broadly divide the existing few-shot learning approaches into three categories: (1) Gradient-based methods optimize feature embedding with gradient descent during meta-test stage (Finn et al., 2017; Bertinetto et al., 2018; Lee et al., 2019).
(2) Metric-based methods learn a ﬁxed optimal embedding with a distance-based prediction rule (Vinyals et al., 2016;
Snell et al., 2017).
(3) Model-based methods obtains a conditional feature embedding via a weight predictor (Mishra et al., 2017; Munkhdalai et al., 2017).
Here we adopt ProtoNet (Snell et al., 2017), a popular metric-based framework, in our approach and boost the generalization ability of the feature embeddings with explicit structured representations from the constellation model.
Recently,
Tokmakov et al.
(2019) proposes a compositional regularization to the image with its attribute annotations, which is different from out unsupervised part-discovery strategy.
Part-Based Constellation/Discriminative Models.
The constellation model family (Weber et al., 2000; Felzenszwalb & Huttenlocher, 2005; Fergus et al., 2003; Sudderth et al., 2005; Fei-Fei et al., 2006; Zhu & Mumford, 2007) is mostly generative/expressive that shares two commonalities in the representation: (1) clustering/codebook learning in the appearance and (2) modeling of the spatial conﬁgurations.
The key difference among these approaches lies in how the spatial conﬁguration is modeled: Gaussian distributions (Weber et al., 2000); pictorial structure (Felzenszwalb & Huttenlocher, 2005); joint shape model (Fergus et al., 2003) ; hierarchical graphical model (Sudderth et al., 2005); grammar-based (Zhu & Mumford, 2007).
These constellation models represent a promising direction for object recognition but are not practical competitive compared with deep learning based approaches.
There are also discriminative models: The discriminatively trained part-based model (DPM) (Felzenszwalb et al., 2009) is a typical method in this vein where object parts (as HOG features (Dalal & Triggs, 2005)) and their conﬁgurations (a star model) are learned jointly in a discriminative way.
The spatial pyramid matching method (SPM) (Lazebnik et al., 2006) has no explicit parts but instead builds on top of different levels of grids with codebook learned on top of the SIFT features (Lowe, 2004).
DPM and SPM are of practical signiﬁcance for object detection and recognition.
In our approach, we implement the constellation model with cell feature clustering and attention-based cell relation modeling to demonstrate the appearance learning and spatial conﬁguration respectively.
Parts models are extensively studied in ﬁne-grained image classiﬁcations and object detection to provide spatial guidance for ﬁltering uninformative object proposals (Simon & Rodner, 2015;
Peng et al., 2017; Zhu et al., 2017;
Ge et al., 2019; Qi et al., 2019).
Related to our work, Neural
Activation Constellations (NAC) (Simon & Rodner, 2015) introduces the constellation model to perform unsupervised part model discovery with convolutional networks.
Our work is different from
NAC in three aspects: (1) The algorithmic mechanisms behind Simon & Rodner (2015) and ours are different.
Simon & Rodner (2015) implements a traditional Gaussian-based constellation module to model the spatial conﬁguration and part selection on top of a ﬁxed pre-trained CNN.
However, in our ConstellationNet, our part representation and spatial conﬁguration are modeled by cell feature clustering and self-attention based cell relation module, which is general-purpose, modularized and recursive.
In Simon & Rodner (2015) , the constellation module is optimized in an EM-like algorithm, which is separate from the CNN optimization.
Our constellation modules are seamlessly
C on c a t ena t i on
C on v 1 x
B a t c h N o r m
R eL U
AvgPool
Embeddings
[Table]
cos cos cos 0.
✓ ✗ ✗
Constell.
Conv +
[Table]
+
[Table]
|
[Table]
[Figure]
integrated into the current CNNs and jointly optimized with them.
(3) Our ConstellationNet uses the dense cell features from the CNN feature maps, which considers all positions from the images as potential parts and models their relation.
However, (Simon et al. 2015) extracts sparse part representations (i.e. it uses at most one part proposal per channel and selects even less parts later), which may not fully utilize the rich information from the CNN feature maps.
Capsules Networks.
A notable development to learning the explicit structured representation in an end-to-end framework is the capsule networks (CapsNets) (Sabour et al., 2017).
The line of works on
CapsNets (Sabour et al., 2017; Hinton et al., 2018; Kosiorek et al., 2019; Tsai et al., 2020) intends to parse a visual scene in an interpretable and hierarchical way.
Sabour et al.
(2017) represents parts and objects in vector-based capsules with a dynamic routing mechanism.
Tsai et al.
(2020) uses a stacked autoencoder architecture to model the hierarchical relation among parts, objects and scenes.
Here our ConstellationNet maintains part modeling by enabling the joint learning of the convolution and constellation modules to simultaneously attain implicit and explicit representations.
F EW - SHOT LEARNING
In a standard classiﬁcation problem, we aim to learn a model trained on the dataset D base that can generalize its classiﬁcation ability to unseen test set D novel belonging to same categories.
In few-shot classiﬁcation problem, we encourage D base and D novel to be formed from different categories to emphasize model’s generalization ability on novel categories, where we denote training categories as
C base , test categories as C novel , and C base ∩ C novel = ∅ to ensure the fairness.
In the training stage (a.k.a. meta-train stage), metric-based few-shot learning approaches (Snell et al., 2017; Vinyals et al., 2016; Oreshkin et al., 2018) usually learn a feature extractor φ ( x ) on the dataset
D base to obtain generic feature embedding by optimizing the loss L ( φ ) :
[Equation]
(1) where { ( x , y ) } is a sampled mini-batch of data points and (cid:96) ( · ) is usually an episodic few-shot loss (Vinyals et al., 2016) or a standard cross-entropy loss (Chen et al., 2020).
In the inference stage (a.k.a. meta-test stage), a typical few-shot benchmark evaluates the model on
K -way, N -shot classiﬁcation tasks T drawn from D novel , where each task has a support set and a query set, i.e. T =
( T supp , T query ) .
The support set T supp contains K classes and each class has N images (e.g. K = 5 , N ∈ { 1 , 5 } ).
Following Snell et al.
(2017), the prediction ˆ y (cid:48) of a query image x (cid:48) ∈ T query is given by the label of nearest prototype c k from T supp under a cosine similarity d ( · , · ) :
[Equation]
An extended description of the few-shot learning framework can be found from Appendix A.1.
The generalization ability of the feature extractor φ ( x ) is improved in terms of training scheme (e.g. episodic learning (Vinyals et al., 2016)), network design (e.g. task condition (Oreshkin et al., 2018)) or objective function (e.g. learnable distance (Sung et al., 2018)).
In our method, we propose a novel network design by inserting constellation models into CNNs and strengthen the intermediate features.
C ONSTELLATION M ODEL
The concept of constellation has been introduced to the few-shot learning scenario in early years (Fei-Fei et al., 2006), in which the appearance and the shape are independently learned in a mixture model.
In our work, we revisit the constellation model in an end-to-end learning framework: First, we deﬁne the a cell feature as the individual local feature at a position in the feature map (see Figure 1).
We then employ cell feature clustering to model the underlying distribution of input cell features, implying a part discovery procedure.
We further obtain the distance map of the cell features from clustering and then perform cell relation modeling to build spatial relationships.
4. C ELL F EATURE C LUSTERING
In convolutional neural networks (CNNs), the convolutional ﬁlters are learned to detect the discriminative patterns from low-level to high-level through back-propagation (Zeiler & Fergus, 2014).
In fact, the backward signal in the back-propagation is not necessarily needed to obtain a pattern detector.
With the feature map in the forward step of the CNN, we are able to cluster the individual features at each location of the feature map (a.k.a.
cell features ) into multiple centers and employ the cluster centers as ﬁlters (Coates & Ng, 2012; Krähenbühl et al., 2015).
Assume we obtain a convolutional feature map U with batch size B , spatial size H × W and channels C .
We disensemble the feature map U ∈ R B
× H × W × C into a cell features set U
= { u 1 , u 2 , ..., u n } where n = BHW and u i ∈ R C is a cell feature.
Naively, we can conduct a k -means algorithm on input cell features U to solve the clustering objective:
[Equation]
where V = { v 1 , v 2 , ..., v K } is a set of cluster centers and m ik indicates if the input cell feature u i is assigned to cluster center v k .
The clustering-based ﬁlters V can model the underlying cell feature distributions and capture the most frequent features, which can be explicitly interpreted as meaningful part patterns/part types.
The hard assignment map m i =
( m i 1 , m i 2 , ..., m iK ) of input cell feature u i onto the cluster centers can be used as a part-based representation, providing alternative information to the next layer in the CNN.
However, there are two issues remaining unsolved in the naive design: Firstly, CNNs are typically optimized in a stochastic gradient descent (SGD) manner.
Thus, in each forward step, only a minibatch of images are proceeded to provide cell features, which implies that the cluster centers cannot extract the global feature distribution across the whole dataset.
Secondly, the hard assignment map has limited information due to its discrete representation.
Therefore, inspired by Sculley (2010), we design a mini-batch soft k -means algorithm to cluster the cell features approximately:
• Initialization.
Randomly initialize global cluster centers V = { v 1 , v 2 , ..., v K } and a counter s = ( s 1 , s 2 , ..., s K )
= 0 .
• Cluster Assignment.
In forward step, given input cell features U = { u 1 , u 2 , ..., u n } , we compute the distance vector d i =
( d i 1 , d i 2 , ...
d iK ) between input cell feature u i and all cluster centers V .
We then compute the soft assignment [Equation] ik ∈ R and generate the current mini-batch centers
[Equation]
where β > 0 is an inverse temperature.
• Centroid Movement.
We formulate a count update ∆ s = (cid:80) i m i by summing all assignment maps m i =
( m i 1 , m i 2 , ...m iK ) .
The current mini-batch centers v (cid:48) k are then updated to the global centers v k with a momentum coefﬁcient η :
[Equation]
• Counter Update.
Counter s is updated and distance vectors { d i } are reshaped and returned:
[Equation]
With gradually updating global cluster centers, the above algorithm is able to address the issue of limited data in a mini-batch.
In addition, we reshape the distance vectors { d i } of all input cell features to a distance map D ∈ R B × H × W × K .
Each distance vector d i can be seen as a learned cell code in codebook (dictionary) learning, which encodes a soft assignment of the visual word (i.e. cell feature) onto the codewords (i.e. cluster centers) and implies a part representation.
The distance map D then can be viewed as a cell code map that represents a spatial distribution of identiﬁed parts, which is passed to following layers.
Empirically, it is observed that when u i and v k are L 2 normalized, the training procedure is more stable and the Euclidean distance d
ik is equivalent to a cosine similarity up to an afﬁne transformation.
Details of the cell feature clustering can be found in Appendix A.8.
4. C ELL R ELATION AND S PATIAL C ONFIGURATION M ODELING
Before the deep learning era, traditional constellation models (Fei-Fei et al., 2006) decompose visual information into appearance and shape representation.
The appearance of different parts in the image is treated independently while the shape of parts is assumed to have spatial connections.
In our constellation model, we establish the spatial relationship among the individual part-based representations at a different location from the distance map as well.
Speciﬁcally, we apply the self-attention mechanism (Vaswani et al., 2017) to build the spatial relationship and enhance the representation instead of using probabilistic graphical models in prior work (Fei-Fei et al., 2006).
In cell relation modeling, we add a positional encoding P ∈ R B × H × W × C following Carion et al.
(2020) for spatial locations to the distance map D and obtain the input feature map F I for query and key layers. For value layer, we directly ﬂatten the distance map D to another input feature map F (cid:48) I : F I =
SpatialFlatten
( D + P ) ∈
R B × HW × K , [Equation] SpatialFlatten [Equation]
The input feature maps F I , F (cid:48) I are transformed into query, key and value { F q , F k , F v } ⊂ R B × HW × K by three linear layers { W q , W k , W v } ⊂ R K × K and further computes the output feature F A :
[Equation]
The softmax of dot product between query and key matrix F q ( F k ) (cid:62)
∈ R B × HW × HW calculates the similarity scores in the embedding space among features across the spatial dimension.
This encodes the spatial relationships of input features and leads to an enhanced output feature representation
F A .
Besides, √ K in the denominator is to stabilize the gradient.
In practice, we adopt a multi-head attention to model the feature relation in the embedding subspaces:
[Equation]
In a J -head attention, the aforementioned similarity scores in the K (cid:48)
=
KJ dimensional embedding subspace are calculated using the query, key and value from j -th head, i.e. { F qj , F kj , F vj } ⊂
R B × HW × K (cid:48) .
The output features F j of each head are computed following Eq. 9.
All the output features { F 1 , ..., F J } are concatenated back into K dimension embedding and further processed with a linear layer
W ∈ R K × K to generate multi-head output features F MHA .
Such multi-head attention settings could provide more diverse feature relation without introducing extra parameters.
4. I NTEGRATE C ONSTELLATION M ODEL WITH CNN S
Our constellation model has the capability to capture explicit structured features and encodes spatial relations among the cell features.
The output features yield informative visual cues which are able to strengthen the convolutional features.
Thus, as shown in Figure 1, we place the constellation model after the convolution operation to extract its unique explicit features and concatenate them with the original convolutional feature map.
A following 1 × 1 convolutional layer is used on the concatenated features to restore the channels of convolutional feature map.
In Table 3, we provide evidence that merging features from constellation model to the CNN backbone can signiﬁcantly improve the representation ability.
In contrast, increasing channels in CNNs alone to double the parameters (second line in Table 3) can only improve the performance marginally.
Optionally, we found it is useful to adopt auxiliary loss when training the constellation model in deeper networks (e.g. ResNet-12).
On top of each constellation model, we conduct a standard classiﬁcation to acquire additional regularization.
4. W HY CLUSTERING AND SELF - ATTENTION ( CLUSTERING MAP + POSITIONAL ENCODING )?
As described in Section 1 and 2, classical constellation models (Fergus et al., 2003; Felzenszwalb & Huttenlocher, 2005) extract parts with their spatial relationships; they are expressive but do not produce competitive results on modern image benchmarks.
CNN models (Krizhevsky et al., 2012;
He et al., 2016) attain remarkable results on large-scale image benchmarks (Deng et al., 2009) but they are limited when training data is scarce.
We take the inspiration from the traditional constellation models, but with a realization that overcomes their previous modeling limitations.
The main contribution of our work is a constellation module/block that performs cell-wise clustering , followed by self-attention on the clustering distance map + positional encoding .
This separates our work from previous attempts, e.g. non-local block work (Wang et al., 2018) in which long-range non-linear averaging is performed on the convolution features (no clustering, nor positional encoding for the spatial conﬁguration).
The main properties of our constellation block include: (1) Cell based dense representation as opposed to the sparse part representation in (Weber et al., 2000) to make the cells recursively modeled in the self-attention unit in a modularized and general-purpose way.
(2) Clustering to generate the cell code after clustering (codebook learning) that attains abstraction and is not dependent on the CNN feature dimensions.
(3) Positional encoding (as in Carion et al. for cells to encode the spatial locations.
(4) Tokenized representation as expressive parts (code/clustering distance map + positional encoding) for the cells.
(5) Self-attention to jointly model the cell code and positional encoding to capture the relationships between the parts together with their spatial conﬁgurations.
E XPERIMENT 5. D ATASETS
We adopt three standard benchmark datasets that are widely used in few-shot learning, CIFAR-FS dataset (Bertinetto et al., 2018), FC100 dataset (Oreshkin et al., 2018), and mini -ImageNet dataset (Vinyals et al., 2016).
Details about dataset settings in few-shot learning are in Appendix A.2.
5. N ETWORK WITH M ULTI -B RANCH
We build ConstellationNet on two ProtoNet variants, namely Conv-4 and ResNet-12, which are commonly used in few-shot learning.
Details of networks and the optimization are in Appendix.
We develop a new technique, Multi-Branch , to optimize standard classiﬁcation loss and prototypical loss simultaneously.
We ﬁnd the two training schemes, standard classiﬁcation scheme and prototypical scheme, can be a companion rather than a conﬂict.
Details of these two schemes can be found from Appendix A.1.
Different from standard network backbone used in prior works, our embedding φ ( x ) is separated into two branches after a shared stem (Y-shape), which is deﬁned as φ ( x ) = { φ cls ( x ) , φ proto ( x ) } and φ cls ( x )
=
g cls ( f stem ( x )) , φ proto ( x ) =
g proto ( f stem ( x )) .
Two branches φ cls ( x ) , φ proto ( x ) are trained by standard classiﬁcation and prototypical schemes separately in a multi-task learning fashion.
During the testing time, φ cls ( x ) and φ proto ( x ) are concatenated together to compute distance between support prototypes and query images.
For our ConstellationNet, we split the network into two branches after the second convolutional blocks (Conv-4) or the second residual blocks (ResNet-12).
We keep the shared stem identical to the network backbone and reduce the channels of two separate branches to match the parameter size of the model without multi-branch.
The detailed ablation study is described in Table 3.
Feature Augmentation.
During the meta-testing stage, we discover that concatenating features before average pooling to the ﬁnal output can improve classiﬁcation accuracy.
The advantage of this technique is that no additional training and model parameters are introduced.
5. R ESULTS ON S TANDARD B ENCHMARKS
Table 1 and 2 summarize the results of the few-shot classiﬁcation tasks on CIFAR-FS, FC100, and mini -ImageNet, respectively.
Our method shows a notable improvement over several strong baselines in various settings.
ConstellationNet signiﬁcantly improves the performance on shallow networks (Conv-4).
In Table 2, our model outperforms SIB (Hu et al., 2020) 1-shot by 0.6% and 5-shot by 5.6%.
In Table 1, our model outperforms MetaOptNet (Lee et al., 2019) by 5.95% in 1-shot and 6.24% in 5-shot.
For deep networks with rich features, the constellation module still contributes to the performance, showing its complementary advantage to convolution.
Our ResNet-12 model beats (Lee et al., 2019) 1-shot result by 2.7% on FC100, 3.4% on CIFAR-FS, and 1.72% on mini -ImageNet. [Table]
[Table] The consistent improvement over both shallow and deep networks across all three datasets shows the generality of our method.
Our ConstellationNet is orthogonal to the margin loss based methods (Liu et al., 2020; Li et al., 2020), and we also do not use extra cross-modal information (Xing et al., 2019; Li et al., 2020).
On the contrary, our model enhances the embedding generalization ability by incorporating its own part-based representation.
Additionally, to verify the orthogonality of our method, we adapt the negative margin loss following Liu et al.
(2020) to our Conv-4 models in
Appendix A.7.
We observe ConstellationNet with negative margin brings 0.52% improvement to
ConstellationNet, and obtains 6.93% gain compared with baseline on mini -ImageNet.
M ODEL A NALYSIS 6. A RCHITECTURE ALTERNATIVES
In Table 3, we ﬁrst study the role of each module in ConstellationNet, where the number of parameters is controlled approximately equivalent to the baseline’s size.
Our constellation model brings 6.41% and 2.59% improvements over baseline on 1-shot Conv-4 and ResNet-12 results.
Combined with our multi-branch training procedure, the model further improves additional 1.34% and 1.26% on 1-shot
Conv-4 and ResNet-12, respectively.
Finally, feature augmentation from penultimate layer to ﬁnal output embedding brings additional 0.45% and 0.27% improvements on two variants.
We also test the baseline model with extra channels in the Table 3.
The new model only shows slight improvements over original baseline, and is outperformed by our ConstellationNet with a large margin.
We also obtain WRN-28-10 baseline results to validate our improvement.
While making
ResNet baselines deeper and wider, our ConstellationNet still outperforms this strong baseline.
In
We compare our ConstellationNet with alternative architectures including the baseline and the modiﬁed baseline with extra channels based on Conv-4 and ResNet-12.
We also include a baseline with WideResNet-28- (Zagoruyko & Komodakis, 2016) backbone for comparison.
[Table]
[Figure] Figure 2 (e), we further study whether the performance gap between ConstellationNet and baseline can be reduced by simply altering the baseline’s model complexity using e.g. more convolution channels.
Although the trend of baseline accuracy increases when increasing the model parameter number gradually, the performance gap is still signiﬁcant.
This validates our concept that modeling hierarchical part structures can greatly beneﬁt features learned from convolution operation, and obtain a more robust feature representation.
In addition, applying self-attention on the distance map (row 6: 57.03% on Conv-4, 1-shot) achieves better performance than directly applying it to the original cell features (i.e. convolutional feature map) (row 4: 55.92% on Conv-4, 1-shot).
We also tried to replace the cell feature clustering module with a 1x1 convolution layer (output dimension is equal to the number of clusters) (row 5: 55.46% on Conv-4, 1-shot).
It is worse than our results (row 6) as well.
We observe that the 1x1 convolution layer is less expressive than the cell feature clustering module, making it difﬁcult to extract enough context information during cell relation modeling.
6. M ODULES A NALYSIS
In Figure 2 (a), we vary the number of clusters adapted in all layers to observe the performance change.
We found that increasing the number of clusters improves the accuracy in general, and set clusters to 64 is optimal in terms of both model size and classiﬁcation performance.
Figure(b) shows the number of attention heads does not effect performance as much as the number of cluster, and 8-head attention obtains 1.80% performance gain on the 1-shot setting compared to 1-head attention.
In Figure 2 (c, d), we also study the effectiveness of clustering algorithm applied to different layers.
The results show both early features and high-level features beneﬁt from introducing clusters algorithm into the original CNN architecture.
6. C LUSTER V ISUALIZATION
Figure 3 demonstrates the visualization of cluster centers in each layer of Conv-4 model on miniImageNet.
In the upper part of the ﬁgure, each image shows patches corresponding to the nearest cell features to a cluster center (i.e. with lowest Euclidean distance).
It is observed that clusters in early layers (e.g. layer 1,2) represent simple low-level patterns while the clusters in high layers (e.g. layer 3,4) indicate more complex structures and parts.
In the lower part of the ﬁgure, we choose two cluster centers from layer 4 for further interpretation: The left one with green box could possibly represent legs since it consists of various types of legs from human, dog and other animals.
The right one with the red box shows most nearest cell features to this cluster center are parts with bird’s head or beetles, which share a dotted structure (i.e. black dots on beetles / eyes on bird’s head).
The left side of Figure 4 shows the visualization of cell features that are assigned to different clusters.
For each image, we extract the assignment maps corresponding to three cluster centers generated in
[Figure]
the last constellation module of Conv-4 and ﬁnd multiple cell features with the highest assignments within each assignment map.
The locations of cell features are projected back in the original image space, marked by three different colors of " · " in the raw image to show three different feature clusters.
For a given class of images, the same cluster centers are selected for comparison across 6 samples.
As shown in Figure 4, we observe part information of each class is explicitly discovered.
For the bird category, we can see different parts in each image, including head (cyan " · "), body (purple " · ") and tail (yellow " · ").
For the dog category, we see parts including heads (red " · "), legs (green " · ") and body (blue " · ").
For the tank category, we see parts like track (light blue " · ") and turret (pink " · ").
The right side of Figure 4 visualizes the attention maps in the cell relation model.
We use the last constellation module in the ResNet-12 model for visualization since it captures high-level features that better represent parts.
We choose one query feature at the center of the object and show its attention map to all key features.
The middle part of the ﬁgure shows the attention maps corresponding toheads in the multi-head attention.
It is observed that some parts are identiﬁed such as head (second map in ﬁrst row), legs (ﬁrst two map in second row), buttock (ﬁrst map in ﬁrst row) and body (second map in the second row).
A merged attention map by overlaying all 8 attention maps is presented at right part of the ﬁgure.
It indicates that all the attention heads together can extract the features of the whole object, which would be useful for ﬁnal classiﬁcation.
C ONCLUSION
In this paper, we present ConstellationNet by introducing an explicit feature clustering procedure with relation learning via self-attention.
We implement a mini-batch soft k -means algorithm to capture the cell feature distribution.
With integrated implicit (standard CNN modules) and explicit (cell feature clustering + cell relation modeling) representations, our proposed ConstellationNet achieves signiﬁcant improvement over the competing methods on few-shot classiﬁcation benchmarks.
A A PPENDIX A. F EW -S HOT L EARNING F RAMEWORK
In this section, we introduce background concepts of meta-learning and elaborate the few-shot learning framework used in our ConstellationNet.
Meta-Learning in Few-Shot Classiﬁcation.
Current few-shot learning is typically formulated as a meta-learning task (Finn et al., 2017), in which an dataset D base is used to provide commonsense knowledge and a dataset D novel for the few-shot classiﬁcation.
D base has the classes C base which are disjoint from the C novel in D novel to ensure fairness.
There are two stages, meta-training and meta-test , in the meta-learning framework:
In meta-training stage, we attempt to train a model to learn generic features from D base .
In meta-test stage, we adapt the model on the limited training split from D novel and evaluate the performance of the model on the test split.
ProtoNet-Based Framework.
In our ConstellationNet, we adopt ProtoNet (Snell et al., 2017) as the base few-shot learning framework.
In ProtoNet, the dataset D novel is represented by a series of K -way N -shot tasks {T } where each task consists of a support set and a query set, i.e. T =
( T supp , T query ) .
The support set T supp contains K classes and each class has N examples from the training split of D novel , which are used to adapt the model in meta-test stage.
The query set T query from the test split of D novel is then used to evaluate the model.
The ProtoNet attempts to learn a generic feature extractor φ ( x ) on image x , and represent a class k by the prototype c k , which is the average feature of examples from support set T supp with this class:
[Equation]
During the meta-test stage, we use the prototypes to compute the probability p k of a query example x (cid:48) ∈ T query on class k and predict its label y (cid:48) : [Equation]
[Equation]
where d ( · , · ) is a cosine similarity function (different from the Euclidean distance in Snell et al.
During the meta-training stage, there are two different training schemes: The prototypical scheme from ProtoNet uses an episodic learning strategy that also formulates the dataset D base as a series of tasks {T } .
The negative log-likelihood loss L ( φ ) is optimized:
[Equation] [Equation]
Another way is the standard classiﬁcation scheme (Chen et al., 2020):
It simply uses D base as a standard classiﬁcation dataset { ( x , y ) } consisting of Q classes in total.
Thus, a cross-entropy loss
L ( φ ) is optimized:
[Equation]
[Equation] where w q is the linear weight for class q .
In our ConstellationNet, we use the standard classiﬁcation scheme at default.
For the experiment with multi-branch network, we use the prototypical scheme and standard classiﬁcation scheme for separate branches.
A. D ATASETS
The CIFAR-FS dataset (Bertinetto et al., 2018) is a few-shot classiﬁcation benchmark containing 100 classes from CIFAR-100 (Krizhevsky et al., 2009).
The classes are randomly split into 64 ,and 20 classes as meta-training, meta-validation and meta-testing set respectively.
For each class, it contains 600 images of size 32 × 32 .
We adopt the split from Lee et al.
The FC100 dataset (Oreshkin et al., 2018) is another benchmark based on CIFAR-100 where classes are grouped into 20 superclasses to void the overlap between the splits.
The mini -ImageNet dataset (Vinyals et al., 2016) is a common benchmark for few-shot classiﬁcation containing 100 classes from ILSVRC2012 (Deng et al., 2009).
The classes are randomly split into 64 , 16 and 20 classes as meta-training, meta-validation and meta-testing set respectively.
For each class, it contains 600 images of size 84 × 84 .
We follow the commonly-used split in Ravi & Larochelle (2016), Lee et al.
and
Chen et al.
In all experiments, we conduct data augmentation for the meta-training set of all datasets to match Lee et al.
(2019)’s implementation.
A. N ETWORK B ACKBONE
Conv-4.
Following Lee et al.
(2019), we adopt the same network with 4 convolutional blocks.
Each of the 4 blocks has a 3 × 3 convolutional layer, a batch normalization layer, a ReLU activation and a 2 × 2 max-pooling layer sequentially.
The numbers of ﬁlters are 64 for all 4 convolutional layers.
ResNet-12.
Following Chen et al.
(2020), we construct the residual block with 3 consecutive convolutional blocks followed by an addition average pooling layer where each convolutional block has a 3 × 3 convolutional layer, a batch normalization layer, a leaky ReLU activation, and max-pooling layers.
The ResNet-12 network has 4 residual blocks with each ﬁlter size set to 64, 128, 256, 512, respectively.
WRN-28-10.
WideResNet expands the residual blocks by increasing the convolutional channels and layers (Zagoruyko & Komodakis, 2016).
WRN-28-10 uses 28 convolutional layers with a widening factor of 10.
A. S ELF - ATTENTION SETTINGS
We follow the common practice in Vaswani et al.
(2017) to set the attention layer with residual connections, dropout and layer normalization.
The sine positional encoding follows settings in Carion et al.
A. T RAINING D ETAILS .
Optimization Settings.
We follow implementation in Lee et al.
and use SGD optimizer with initial learning rate of 1, and set momentum to 0.9 and weight decay rate to 5 × 10 − 4 .
The learning rate reduces to 0.06, 0.
[Table]
and 0.0024 at epoch 20, 40 and 50.
The inverse temperature β is set to 100 .
in the cluster assignment step
[Table]
and λ is set to [-1 . 
-]1.0 in the centroid movement step.
A. A BLATION S TUDY ON THE N UMBER OF C LUSTERS
[Table]
Table 4 studies the number of clusters needed for random and similar classes.
The result shows the optimal number of clusters are less affected by the number of clusters but more affected by the similarity between classes.
Less number of clusters are needed for dataset with classes of high similarity, which aligns with our intuition, limited number of patterns exist in this dataset so that small number of clusters are enough to represent its part-based information.
FC100 training dataset consists of 60 classes that are grouped evenly into 12 superclasses.
In the random classes group, the training dataset includes 6 randomly selected super-classes (i.e., 30 classes) and models are trained with 8, 16, 32, 64 and 128 number of clusters.
The highest accuracy occurs at 16 clusters (1-shot: 39.12% in ResNet-12).
In the similar classes group, 30 classes are randomly sampled from the original training dataset and we repeat the same experiments as above.
The highest accuracy occurs at 64 clusters (1-shot: 41.22% in ResNet-12), which is much more than theclusters used for images from similar classes.
A. A DDITIONAL E XPERIMENTS WITH N EGATIVE M ARGIN
[Table]
Table 5 studies the use of negative margin loss (Liu et al., 2020) on our Conv-4 models.
In the negative margin loss, we use the inner-product similarity, the temperature coefﬁcient β = 1 . 0 and the negative margin m = − 0 .
5 , which attains the best performance improvement on our models.
Besides, we do not have the ﬁne-tune step during meta-test.
Our baseline with the negative margin loss obtains 0.80% improvement on 1-shot and 0.44% improvement on 5-shot compared with the baseline.
Similarly, our ConstellationNet with the negative margin loss achieves 0.52% improvement on 1-shot and 0.40% improvement on 5-shot.
The consistent improvement of negative margin loss on the baseline and our ConstellationNet indicates that our constellation module is orthogonal to the negative margin loss, and both modules can boost the performance on few-shot classiﬁcation.
A. C LARIFICATION ON C LUSTERING P ROCEDURE
In this section, we add more clariﬁcation on our cell feature clustering procedure in Sec.
During the training stage, the global cluster centers V = { v k } are updated by the computed clustering centers { v (cid:48) k } in current mini-batch.
Each update to a cluster center v k is weighted by a momentum coefﬁcient η determined by the value of an associated counter s k , since we would like to avoid large adjustment from the current mini-batch in order to stabilize the global cluster centers.
Besides, the mini-batches of examples are randomly drawn from the dataset following Sculley (2010), without specialized design to optimize clustering learning.
During the evaluation stage, we ﬁx the global cluster centers
V in the forward step of our model, avoiding the potential information leak or transduction from the test mini-batches.