982
29, 2022
Bidirectional Matching Prototypical Network for
Few-Shot Image Classification
Wen Fu , Li Zhou, and Jie Chen , Member, IEEE
Abstract—Few-shot image classification (FSIC) is the task of
generalizing a model to unknown categories by learning from a
small number of labeled samples of some given categories. Recently,
metric-based approaches have received lots of attention for their
simplicity and effectiveness, but they often only use support set
to generate inaccurate prototypes matching query set, ignoring
the rich information contained in queries and the reversibility
of the matching relationship between the two. In this letter, we
propose a new simple and effective metric-based method called
Bidirectional Matching Prototypical Network (BMPN), which has
three innovations:1)It has an additional reverse matching process.
This process uses queries to generate more accurate prototypes
to improve the model’s performance while also forcing the model
to learn features far from the decision boundary to enhance gen-
eralization capabilities; 2)It has a lightweight coordinate attention
feature extractor (CAFE). This module not only captures long-term
dependence along one spatial direction but also saving the accurate
position information of the other spatial direction, helping the
model to locate the region of interest more accurately; 3)It has
a joint loss function, including forward matching loss and reverse
matching loss, and a progressive weighting strategy is used in the
training process to balance the importance of the two. Our model is
trained end-to-end, and the experimental results show that we have
reached the most advanced performance on the two benchmark
datasets.
Index Terms—Bidirectional matching, deep learning, few-shot
image classification, metric-based method.
I. INTRODUCTION
EEP learning has developed rapidly in recent years. With
D the support of large amounts of data, more complex
networks, and powerful hardware, deep learning can achieve
satisfactory results in various visual tasks [1]–[8]. However,
sometimes the cost of labeling training images is very high,
or some scarce samples are difficult to obtain, resulting in
few available training samples. In this case, the performance
of the existing model is not ideal enough due to overfitting
Manuscript received October 12, 2021; revised February 1, 2022; accepted
February 14, 2022. Date of publication February 22, 2022; date of current version
April 26, 2022. This work was supported by the National Science Foundation
of China under Grant U1832217. The associate editor coordinating the review
of this manuscript and approving it for publication was Prof. Mylene Q. Farias.
(Corresponding author: Jie Chen.)
Wen Fu is with the Institute of Microelectronics, Chinese Academy of Sci-
ences, Beijing 100029, China, and also with the University of Chinese Academy
of Sciences, Beijing 100049, China (e-mail: fuwen2020@ime.ac.cn).
Li Zhou and Jie Chen are with the Institute of Microelectronics, Chinese
Academy of Sciences, Beijing 100029, China (e-mail: zhouli@ime.ac.cn;
jchen@ime.ac.cn).
Digital Object Identifier 10.1109/LSP.2022.3152686
1070-9908 © 2022 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
See https://www.ieee.org/publications/rights/index.html for more information.
Authorized licensed use limited to: TIANJIN UNIVERSITY. Downloaded on November 14,2022 at 10:18:19 UTC from IEEE Xplore. Restrictions apply.
IEEE SIGNAL PROCESSING LETTERS, VOL.
or inconsistent training-testing distribution [9]. Therefore, the
problem of learning with few labeled samples called few-shot
learning has become a popular research direction [10]–[18].
Metric-based few-shot image classification is an essential
direction of few-shot learning. In recent years, many models
have been proposed [10], [11], [19], [20]. The matching net-
work [10] combines meta-learning with a deep neural network
to train a learnable nearest neighbor classifier. The prototypical
network [11] uses Euclidean distance to measure the distance
between prototypes and queries to classify queries. Further, the
relation network [19] trains an additional neural network to
learn a nonlinear metric used to calculate the similarity between
prototypes and queries. However, these methods generally use a
limited number of support samples to generate inaccurate proto-
type matching queries, ignoring the rich information contained
in queries.
Some work in few-shot image classification areas has recently
attempted to use information from both support set and query
set [21]–[23]. GNN [23] uses supports and queries to construct
a graph model that transfers the distance metric from Euclidean
space to non-Euclidean space and uses a message-passing algo-
rithm to predict queries. TPN [21] uses transductive learning to
feed supports and queries into the network for training and uses
label-propagation algorithm to predict queries. Their common
idea is to transfer label information from the labeled support
set to the unlabeled query set. CAN [22] proposes a CAM
module, which generates a cross-attention map between sup-
ports and queries to highlight the target area and generate more
discriminative features. Although these attempts have achieved
good performance gains, they have ignored that the matching
relationship between support and query should be reversible.
Inspired by PANet [24], which reuses the predictive mask as a
new segmentation annotation, we propose a new metric-based
few-shot image classification method based on the prototypical
network called Bidirectional Matching Prototypical Network
(BMPN). The intuitive motivation of our work is that if the
support set can classify the query set well, then the query set
must also be able to classify the support set well. Since there
are more queries than supports, the model can generate more
accurate prototypes. Meanwhile, due to the reverse matching
process, the model will learn more general features, which means
that the learned features are far from the decision boundary,
and the model will be more general. Our main contributions are
summarized as follows:
1) BMPN with an additional reverse matching process is
proposed. It can use the rich information in queries to
generate more accurate prototypes to improve the model’s
performance while forcing the model to learn features
FU et al.: BIDIRECTIONAL MATCHING PROTOTYPICAL NETWORK FOR FEW-SHOT IMAGE CLASSIFICATION 983

far from the decision boundary to improve generalization

ability.
2) A lightweight coordinate attention feature extractor
(CAFE) is proposed. It captures long-term dependence
along one spatial direction and saves accurate location
information along the other spatial direction, helping the
model locate the region of interest more accurately.
3) A joint loss function containing both forward and reverse
matching loss is proposed, and a progressive weighting
strategy is adopted to balance the importance of both in
the training stages to ensure the stability of training.
4) We have conducted enough experiments on the two bench-
mark datasets, and experimental results show that we have
reached the most advanced performance.
Fig. 1. Structure of our proposed BMPN. Operators and paths are illustrated
in the dashed box in the lower right corner. The black line represents the forward
II. METHODOLOGY matching paths, and the red line represents the reverse matching paths. After the
forward matching process, queries obtain the pseudo-label and generate reverse
In this section, the basic definition of few-shot image clas- prototypes to perform reverse matching.
sification task is introduced and the proposed BMPN model is
described in detail.

A. Problem Formulation
In the few-shot image classification setup, datasets are usually
divided into training set Dtrain and testing set Dtest (Dtrain ∩
Dtest = φ). Following [10], We employ the standard episode
strategies for both the training and the testing set. Specifically,
C(C ≥ 5) categories are randomly sampled from the dataset,
and K(K ≤ 5) samples are randomly selected from each cat-
egory to form a label support set S = {(xi , yi )}CK i=1 , referred
to as the C-way K-shot task. Then, N (N = 15) samples are
randomly selected from the same C categories to form an unseen
query set Q = {(x̂i , ŷi )}CN
i=1 . In the training phase, the model is
trained to minimize the prediction error of the query set in each
episode. In the testing phase, the generalization performance of
the model is tested on Dtest with the same settings.

B. Prototypical Network
The prototypical network averages the feature vectors of each
class in the support set as its corresponding prototype. It then
calculates the distance between the prototype and the query
through forward matching to achieve classification. For C-way
K-shot task, the c-th class prototype pc is calculated by the
following formula:
Fig. 2. (a) is the overall structure of CAFE, which have four CA block. (b) is
the composition of a CA block. The coordinate attention module decomposes the
2-D global pooling into two 1-D average pooling along with X and Y directions
and generates attention by subsequent operation.
In the training stage, standard cross-entropy loss is used,
which is called forward loss in this paper:

1  1 
K CN
pc = Fθ (xi ) (1) Lf orward = − log P (y = c | Q) (4)
K i=1 CN j=1

Where xi belongs to the c-th category in the support set,

which contains K images in total, and Fθ (·) represents the
feature extractor. The feature extraction network of the pro-
totypical network consists of four convolution blocks, each of
which contains a 64-channel 3×3 convolution kernel, a batch
normalization layer, a Relu layer, and a 2×2 Max-pooling layer.
Given the distance function D(·), the prediction category of the
query set can be expressed as:
exp(−D (Fθ (Q), pc ))
P (y = c | Q) = C
c=1 exp(−D (Fθ (Q), pc ))
ŷi = arg max P (y = c | Q)
c introduced the coordinate attention module to decompose the
C. Bidirectional Matching
The BMPN proposed in this letter consists of a feature ex-
tractor with coordinate attention, an additional reverse matching
process, and a progressive weighting strategy, as shown in Fig. 1.
1) Coordinate Attention Based Feature Exactor: The struc-
ture of CAFE is shown in Fig. 2. Unlike the prototypical network,
it consists of four CA blocks, each containing an additional
coordinate attention module [25]. Some traditional attention
(2) modules, such as the SE module [26], use global pooling opera-
tions, which lose the essential position information of capturing
(3) spatial structures in visual tasks. To solve this problem, we

Authorized licensed use limited to: TIANJIN UNIVERSITY. Downloaded on November 14,2022 at 10:18:19 UTC from IEEE Xplore. Restrictions apply.
984 IEEE SIGNAL PROCESSING LETTERS, VOL. 29, 2022

2-D global pooling into two 1-D average pooling operations,

Algorithm 1: Progressive Weight Strategy.
which not only captures the long-term dependence of one spatial
direction but also saves the precise position information in the Input: S = {(xi , yi )}CK
i=1 , Q = {(x̂i , ŷi )}i=1 , learning
CN

other spatial direction, helping the model locate the region of rate ξ, hyper-parameter α;
interest more accurately. Experimental results show that CAFE Output: model parameter θ;
effectively suppresses useless information and significantly im- 1: initialize θ;
proves performance and robustness of the model. 2: for iter in iterations do
Specifically, for feature map x with the size of C × H × W , 3: forward matching, labeling queries: {(x̂i , ŷi )}CN i=1 ;
1
CN
its operation through the coordinate attention module can be 4: Lf orward = − CN j=1 log P(y = c | Q);
expressed as: 5: reverse matching, labeling supports: {(xi , yi )}CK i=1 ;
1
CK
1  1  6: Lreverse = − CK i=1 log P(y = c | S);
uhc (h) = xc (h, i), uw
c (w) = xc (j, w) 7: λ = α × iterations
iter
;
W H
0≤i≤W 0≤j≤H 8: Ltotal = Lf orward + λLreverse ;
(5) 9: Updating model:θ ← θ − ξ · ∇θ Ltotal ;
    10: end for
v = Relu BN H1 uh , u w
(6)
v h = H2 (v), v w = H3 (v) (7)
III. EXPERIMENTS
g h = Sigmoid(v h ), g w = Sigmoid(v w ) (8)
We evaluated our BMPN on the two few-shot image classifica-
where xc is the feature map of the c-th channel of the x, Hi (I = tion benchmarks and compared it with the most advanced meth-
1, 2, 3) is 1 × 1 convolution, uhc and uwc are the outputs of xc after ods available: MiniImageNet [10] and CUB-200-2011 [27].
1-D pooling in the X direction and Y direction, respectively. [·] is
C
the concatenation operation, v ∈ R r ×(H+W ) is the output after A. Dataset
nonlinear operation, r is the reduction ratio which is set to 32 in 1) Miniimagenet: It is a subset of ImageNet, containing
C C
this letter, and v h ∈ R r ×H and v w ∈ R r ×W are the partition 60,000 RGB images and 100 categories, with 600 images in
of v into two independent tensors along the spatial dimension. each category, and the size of each image is 84 × 84. Following
The final output of the feature map after CA module is: the settings in [13], we used 64, 16, and 20 randomly selected
classes for training, validation, and testing, respectively.
yc (i, j) = xc (i, j) × gch (i) × gcw (j) (c = 1 · · · C) (9)
2) CUB-200-2011: It is commonly used to evaluate fine-
2) Bidirectional Matching Process: The flow of the bidirec- grained classification and contains 11,788 images in 200 cat-
tional matching algorithm is shown in Fig. 1. The forward match- egories. Following the settings in [28], we use 100, 50, and 50
ing process is precisely the same as the prototypical network, and randomly selected classes for training, validation, and testing,
the model learns from the forward matching loss Lf orward . After respectively.
completing the forward matching process, we get the network’s
prediction for queries, which we call pseudo-label of queries. B. Implementation Details
We get the reverse prototypes by averaging the queries of the
We now conduct experiments on the most common 5-way
same pseudo-label. Assuming that forward matching is accurate
1-shot and 5-way 5-shot cases in few-shot image classification.
enough, adding a reverse matching process has the following two
Accuracy is evaluated as the performance metric. During the
advantages: 1) The reverse matching loss Lreverse will force the
training and testing phases, each class has 15 queries (75 in total).
model to learn features far from the decision boundary, making
Our model is trained end-to-end from scratch with 150,000
the model more generalized. 2) More queries than supports will
iterations. CAFE is used for the feature extraction network,
result in more accurate prototypes. In particular, both kinds of
and Adam [29] is used for the optimizer. The initial learning
losses are cross-entropy losses. The total loss of the model is
rate is set to 0.001, halved at 30,000, 50,000, and 100,000
Ltotal = Lf orward + λLreverse , λ is used to balance the two
iterations. All images are uniformly adjusted to 84 × 84 × 3
kinds of losses.
to input. We use standard data augment methods in the training
3) Progressive Weight Strategy: The reverse matching pro-
phase, including random crop, left-right flip, and color jitter.
cess assumes that the pseudo-label obtained by the forward
α is set to 4 in this letter. In the testing phase, to make the
matching is sufficiently accurate. Since our model is trained
evaluation more convincing, we conducted more than 600 tests
end-to-end, the predictions of queries are mostly wrong at the
with 95% confidence intervals to obtain the results. It’s worth
beginning. To solve this problem, we designed a progressive
emphasizing that we used the same setup for all datasets. Our
weight generation module, as shown in Algorithm 1. It can be
code is implemented in PyTorch [30] and runs on an NVIDIA
seen that at the beginning of training, the proportion of Lreverse
TITAN Xp GPU.
is almost zero, and the model is mainly supervised by forward
matching loss Lf orward . As the training progresses, the model’s
performance is improved, and the proportion of Lreverse is C. Result and Analysis
increasing. In the later stage of training, only Lreverse supervises 1) Result: Our backbone is CAFE, which consists of four
model training. α is the maximum value that λ can reach, set to layers of convolution blocks, the method with the same structure
4 in this letter. is selected for a fair comparison, and the baseline network is

Authorized licensed use limited to: TIANJIN UNIVERSITY. Downloaded on November 14,2022 at 10:18:19 UTC from IEEE Xplore. Restrictions apply.
FU et al.: BIDIRECTIONAL MATCHING PROTOTYPICAL NETWORK FOR FEW-SHOT IMAGE CLASSIFICATION
TABLE I
RESULT ON MINIIMAGENET
TABLE II
RESULT ON CUB-200-2011
the prototypical network. Tables I and II show the performance
comparison of BMPN and other methods on each dataset. On
the miniImagenet dataset, the 1-shot and 5-shot performance
of BMPN are improved by about 8.8% and 6.7%, respectively,
compared to the baseline. For transductive learning methods,
BMPN improved performance by about 4.2% and 6.5% in
1-shot and 5-shot, respectively, compared to GNN. Furthermore,
compared to TPN, the performance is improved by about 3.8%
and 2.7% in 1-shot and 5-shot, respectively. Two aspects account
for the differences. First, GNN and TPN use the plain Conv-4
backbone. The extracted features contain noise such as back-
ground noise, resulting in compromised performance. Second,
GNN and TPN do not have the reverse matching process, so the
prediction of queries depends on a limited number of supports,
leading to a model that is easily overfitted to the supports. BMPN
is at least 1.4% and 2.5% ahead of other methods, which verifies
the effectiveness and superiority of our approach. On the CUB-
200-2011 dataset, the 1-shot and 5-shot performance of BMPN
are improved by 16% and 5.5%, respectively, compared with the
baseline. Compared with other methods, there are also apparent
improvements. The main reason is that the image background
of the CUB dataset is clearer than the miniImagenet dataset.
CAFE module can locate objects of interest well and sup-
press useless information, thus significantly improving model
performance.
2) Analysis: We now conduct an ablation study on MiniIma-
geNet to explore the effectiveness of the proposed components.
As shown in Table III, model’s performance is substantially
improved with the CAFE module, which proves that the CAFE
module enables the model to extract features that are more
helpful for classification. The SE module brings less gain than
the CAFE module due to global pooling, which causes the loss of
location information. The performance is further improved with
the reverse matching process, proving that the reverse matching
process can effectively utilize the information in queries. It is
Authorized licensed use limited to: TIANJIN UNIVERSITY. Downloaded on November 14,2022 at 10:18:19 UTC from IEEE Xplore. Restrictions apply.
985
TABLE III
ABLATION STUDY ON MINIIMAGENET
Fig. 3. Visualization of feature space. (a) is origin Prototipical Network(PN),
(b) is PN with CAFE module, and (c) is BMPN. Each color represents a class.
worth emphasizing that at this time, we default to the weight
of the reverse loss remaining constant throughout the process,
i.e., λ = 4. The progressive weight strategy allows the model
to dynamically adjust the weights of the reverse matching loss
based on the training process. Compared with keeping a fixed
weight, this strategy avoids the performance impairment caused
by the high early error rate and helps the model learn more
accurate information in queries; thus, the model’s performance
is further improved.
3) Visualization: We point out that BMPN has a charac-
teristic: It forces the model to learn features far away from
the decision boundary and improves the model’s generalization
ability. T-SNE [32] was used to visualize the feature space on the
CUB dataset under 5-way 5-shot task to verify our statement.
As shown in Fig. 3, the feature space formed by (a) is poorly
discriminative, and some categories are mixed. As shown in (b),
after adding the CAFE module, the separability is improved,
but the decision boundary is still blurred. Our proposed (c) is
more compact between classes and significantly enhances the
separability between different categories, proving our views’
correctness.
IV. CONCLUSION
In this letter, we proposed a new metric-based few-shot image
classification method. We forced the network to learn features
far away from the decision boundary by adding a reverse match-
ing process, enhancing the model’s generalization ability and
performance. We designed a progressive weighting strategy to
balance the ratio of forward matching loss and reverse matching
loss during training to ensure training stability. In addition, we
also developed a feature extractor with coordinate attention to
help the model extract the region of interest, which signifi-
cantly improved the model’s performance. Many experiments on
benchmark datasets show that our proposed method is superior
to other advanced few-shot classification methods.
986
REFERENCES
[1] R. B. Girshick, J. Donahue, T. Darrell, and J. Malik, “Rich feature hierar-
chies for accurate object detection and semantic segmentation,” in Proc.
IEEE Conf. Comput. Vis. Pattern Recognit., 2014, pp. 580–587.
[2] S. Ren, K. He, R. B. Girshick, and J. Sun, “Faster R-CNN: Towards real-
time object detection with region proposal networks,” IEEE Trans. Pattern
Anal. Mach. Intell., vol. 39, no. 6, pp. 1137–1149, Jun. 2016.
[3] J. Donahue et al., “Long-term recurrent convolutional networks for visual
recognition and description,” in Proc. IEEE Conf. Comput. Vis. Pattern
Recognit., 2015, pp. 2625–2634.
[4] K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image
recognition,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit. (CVPR),
2016, pp. 770–778.
[5] J. Redmon, S. K. Divvala, R. B. Girshick, and A. Farhadi, “You only look
once: Unified, real-time object detection,” in Proc. IEEE Conf. Comput.
Vis. Pattern Recognit., 2016, pp. 779–788.
[6] G. Huang, Z. Liu, and K. Q. Weinberger, “Densely connected convolu-
tional networks,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit.,
2017, pp. 4700–4708.
[7] E. Shelhamer, J. Long, and T. Darrell, “Fully convolutional networks for
semantic segmentation,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 39,
no. 4, pp. 640–651, Apr. 2017.
[8] Z. Cai and N. Vasconcelos, “Cascade R-CNN: Delving into high quality
object detection,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit.,
2018, pp. 6154–6162.
[9] W.-Y. Chen, Y.-C. Liu, Z. Kira, Y. Wang, and J.-B. Huang, “A closer look
at few-shot classification,” arXiv, vol. abs/1904.04232, 2019.
[10] O. Vinyals, C. Blundell, T. P. Lillicrap, K. Kavukcuoglu, and D. Wierstra,
“Matching networks for one shot learning,” in Proc. Adv. Neural Inform.
Process. Syst., 2016.
[11] J. Snell, K. Swersky, and R. S. Zemel, “Prototypical networks for few-shot
learning,” in Proc. Adv. Neural Inform. Process. Syst., 2017.
[12] C. Finn, P. Abbeel, and S. Levine, “Model-agnostic meta-learning for fast
adaptation of deep networks,” in Proc. Int. Conf. Mach. Learn., 2017,
pp. 1126–1135.
[13] S. Ravi and H. Larochelle, “Optimization as a model for few-shot learning,”
in Proc. Int. Conf. Learn. Representations, 2017.
[14] Q. Sun, X. Li, Y. Liu, S. Zheng, T.-S. Chua, and B. Schiele, “Learning to
self-train for semi-supervised few-shot classification,” in Proc. Adv. Neural
Inform. Process. Syst., 2019.
[15] Y. Qin, W. Zhang, Z. Wang, C. Zhao, and J. Shi, “Layer-wise adaptive
updating for few-shot image classification,” IEEE Signal Process. Lett.,
vol. 27, pp. 2044–2048, 2020.
Authorized licensed use limited to: TIANJIN UNIVERSITY. Downloaded on November 14,2022 at 10:18:19 UTC from IEEE Xplore. Restrictions apply.
IEEE SIGNAL PROCESSING LETTERS, VOL. 29, 2022
[16] G. S. Dhillon, P. Chaudhari, A. Ravichandran, and S. Soatto, “A baseline
for few-shot image classification,” arXiv, vol. abs/1909.02729, 2020.
[17] C. Simon, P. Koniusz, R. Nock, and M. T. Harandi, “Adaptive subspaces
for few-shot learning,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit.,
2020, pp. 4136–4145.
[18] C. Xiong, W. Li, Y. Liu, and M. Wang, “Multi-dimensional edge features
graph neural network on few-shot image classification,” IEEE Signal
Process. Lett., vol. 28, pp. 573–577, 2021.
[19] F. Sung, Y. Yang, L. Zhang, T. Xiang, P. H. S. Torr, and T. M. Hospedales,
“Learning to compare: Relation network for few-shot learning,” in Proc.
IEEE Conf. Comput. Vis. Pattern Recognit., 2018, pp. 1199–1208.
[20] W. Li, L. Wang, J. Xu, J. Huo, Y. Gao, and J. Luo, “Revisiting local
descriptor based image-to-class measure for few-shot learning,” in Proc.
IEEE Conf. Comput. Vis. Pattern Recognit., 2019, pp. 7260–7268.
[21] Y. Liu et al., “Learning to propagate labels: Transductive propagation
network for few-shot learning,” in Proc. Int. Conf. Learn. Representations,
2019.
[22] R. Hou, H. Chang, B. Ma, S. Shan, and X. Chen, “Cross attention network
for few-shot classification,” in Proc. Adv. Neural Inform. Process. Syst.,
2019.
[23] V. G. Satorras and J. Bruna, “Few-shot learning with graph neural net-
works,” arXiv, vol. abs/1711.04043, 2018.
[24] K. Wang, J. H. Liew, Y. Zou, D. Zhou, and J. Feng, “Panet: Few-shot image
semantic segmentation with prototype alignment,” in Proc. IEEE/CVF
Conf. Comput. Vis. Pattern Recognit, 2019, pp. 9197–9206.
[25] Q. Hou, D. Zhou, and J. Feng, “Coordinate attention for efficient mobile
network design,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit.,
2021, pp. 13713–13722.
[26] J. Hu, L. Shen, S. Albanie, G. Sun, and E. Wu, “Squeeze-and-excitation
networks,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 42, no. 8,
pp. 2011–2023, Aug. 2019.
[27] C. Wah, S. Branson, P. Welinder, P. Perona, and S. J. Belongie, “The
Caltech-UCSD birds-200-2011 dataset,” 2011.
[28] N. Hilliard, L. Phillips, S. Howland, A. Yankov, C. D. Corley, and N. O.
Hodas, “Few-shot learning with metric-agnostic conditional embeddings,”
arXiv, vol. abs/1802.04376, 2018.
[29] D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,”
CoRR, vol. abs/1412.6980, 2015.
[30] A. Paszke et al., “Automatic differentiation in pytorch,” 2017.
[31] L. Bertinetto, J. F. Henriques, P. H. S. Torr, and A. Vedaldi, “Meta-learning
with differentiable closed-form solvers,” arXiv, vol. abs/1805.08136,
2019.
[32] L. van der Maaten and G. E. Hinton, “Visualizing data using T-SNE,” J.
Mach. Learn. Res, vol. 9, pp. 2579–2605, 2008.