Title: AUTOMATED RELATIONAL META-LEARNING

Abstract: In order to efficiently learn with small amount of data on new tasks, meta-learning transfers knowledge learned from previous tasks to the new ones. However, a critical challenge in meta-learning is the task heterogeneity which cannot be well handled by traditional globally shared meta-learning methods. In addition, current task-specific meta-learning methods may either suffer from hand-crafted structure design or lack the capability to capture complex relations between tasks. In this paper, motivated by the way of knowledge organization in knowledge bases, we propose an automated relational meta-learning (ARML) framework that automatically extracts the cross-task relations and constructs the meta-knowledge graph.
When a new task arrives, it can quickly find the most relevant structure and tailor the learned structure knowledge to the meta-learner. As a result, the proposed framework not only addresses the challenge of task heterogeneity by a learned meta-knowledge graph, but also increases the model interpretability. We conduct extensive experiments on 2D toy regression and few-shot image classification and the results demonstrate the superiority of ARML over state-of-the-art baselines.

1. INTRODUCTION:

Learning quickly is the key characteristic of human intelligence, which remains a daunting problem in machine intelligence. The mechanism of meta-learning is widely used to generalize and transfer prior knowledge learned from previous tasks to improve the effectiveness of learning on new tasks, which has benefited various applications, such as computer vision (Kang et al., 2019; Liu et al., 2019) , natural language processing (Gu et al., 2018; Lin et al., 2019) and social good (Zhang et al., 2019; Yao et al., 2019a) . Most of existing meta-learning algorithms learn a globally shared meta-learner (e.g., parameter initialization (Finn et al., 2017; 2018) , meta-optimizer (Ravi & Larochelle, 2016) , metric space (Snell et al., 2017; Garcia & Bruna, 2017; Oreshkin et al., 2018) ). However, globally shared meta-learners fail to handle tasks lying in different distributions, which is known as task heterogeneity (Vuorio et al., 2018; Yao et al., 2019b) . Task heterogeneity has been regarded as one of the most challenging issues in meta-learning, and thus it is desirable to design meta-learning models that effectively optimize each of the heterogeneous tasks.

The key challenge to deal with task heterogeneity is how to customize globally shared meta-learner by using task-specific information? Recently, a handful of works try to solve the problem by learning a task-specific representation for tailoring the transferred knowledge to each task (Oreshkin et al., 2018; Vuorio et al., 2018; Lee & Choi, 2018) . However, the expressiveness of these methods is limited due to the impaired knowledge generalization between highly related tasks. Recently, learning the underlying structure across tasks provides a more effective way for balancing the customization and generalization. Representatively, Yao et al. propose a hierarchically structured meta-learning method to customize the globally shared knowledge to each cluster (Yao et al., 2019b) . Nonetheless, the hierarchical clustering structure completely relies on the handcrafted design which needs to be tuned carefully and may lack the capability to capture complex relationships.

Hence, we are motivated to propose a framework to automatically extract underlying relational structures from historical tasks and leverage those relational structures to facilitate knowledge customization on a new task. This inspiration comes from the way of structuring knowledge in knowledge bases (i.e., knowledge graphs). In knowledge bases, the underlying relational structures across text entities are automatically constructed and applied to a new query to improve the searching efficiency. In the meta-learning problem, similarly, we aim at automatically establishing the metaknowledge graph between prior knowledge learned from previous tasks. When a new task arrives, it queries the meta-knowledge graph and quickly attends to the most relevant entities (vertices), and then takes advantage of the relational knowledge structures between them to boost the learning effectiveness with the limited training data.

The proposed meta-learning framework is named as Automated Relational Meta-Learning (ARML). Specifically, the ARML automatically builds the meta-knowledge graph from meta-training tasks to memorize and organize learned knowledge from historical tasks, where each vertex represents one type of meta-knowledge (e.g., the common contour between birds and aircrafts). To learn the meta-knowledge graph at meta-training time, for each task, we construct a prototype-based relational graph for each class, where each vertex represents one prototype. The prototype-based relational graph not only captures the underlying relationship behind samples, but alleviates the potential effects of abnormal samples. The meta-knowledge graph is then learned by summarizing the information from the corresponding prototype-based relational graphs of meta-training tasks. After constructing the meta-knowledge graph, when a new task comes in, the prototype-based relational graph of the new task taps into the meta-knowledge graph for acquiring the most relevant knowledge, which further enhances the task representation and facilitates its training process.

Our major contributions of the proposed ARML are three-fold: (1) it automatically constructs the meta-knowledge graph to facilitate learning a new task; (2) it empirically outperforms the state-ofthe-art meta-learning algorithms; (3) the meta-knowledge graph well captures the relationship among tasks and improves the interpretability of meta-learning algorithms.

2. RELATED WORK:

Meta-learning designs models to learn new tasks or adapt to new environments quickly with a few training examples. There are mainly three research lines of meta-learning: (1) black-box amortized methods design black-box meta-learners to infer the model parameters (Ravi & Larochelle, 2016; Andrychowicz et al., 2016; Mishra et al., 2018; Gordon et al., 2019) ; (2) gradient-based methods aim to learn an optimized initialization of model parameters, which can be adapted to new tasks by a few steps of gradient descent (Finn et al., 2017; 2018; Lee & Choi, 2018; Yoon et al., 2018; Grant et al., 2018) ; (3) non-parametric methods combine parametric meta-learners and non-parametric learners to learn an appropriate distance metric for few-shot classification (Snell et al., 2017; Vinyals et al., 2016; Yang et al., 2018; Oreshkin et al., 2018; Yoon et al., 2019; Garcia & Bruna, 2017) .

Our work is built upon the gradient-based meta-learning methods. In the line of gradient-based meta-learning, most algorithms learn a globally shared meta-learners from previous tasks (Finn et al., 2017; Li et al., 2017; Flennerhag et al., 2019) , to improve the effectiveness of learning process on new tasks. However, these algorithms typically lack the ability to handle heterogeneous tasks (i.e., tasks sample from sufficient different distributions). To tackle this challenge, recent works tailor the globally shared initialization to different tasks by customizing initialization (Vuorio et al., 2018; Yao et al., 2019b) and using probabilistic models (Yoon et al., 2018; Finn et al., 2018) . Representatively, HSML customizes the globally shared initialization with a manually designed hierarchical clustering structure to balance the generalization and customization (Yao et al., 2019b) . However, the handcrafted designed hierarchical structure may not accurately reflect the real structure and the clustering structure constricts the complexity of relationship. Compared with these methods, ARML leverages the most relevant structure from the automatically constructed meta-knowledge graph. Thus, ARML not only discovers more accurate underlying structures to improve the effectiveness of meta-learning algorithms, but also the meta-knowledge graph further enhances the model interpretability. with parameters θ are used to evaluate the effectiveness on D ts i by minimizing the expected empirical loss on D tr i , i.e., L(D tr T i , θ), and obtain the optimal parameters θi. For the regression problem, the loss function is defined based on the mean square error (i.e., (x j ,y j )∈D tr i f θ (xj)-yj 2 2 ) and for the classification problem, the loss function uses the cross-entropy loss (i.e., -(x j ,y j )∈D tr i log p(yj|xj, f θ )).

3. PRELIMINARIES:

Usually, optimizing and learning parameter θ for the task Ti with a few labeled training samples is difficult. To address this limitation, meta-learning provides us a new perspective to improve the performance by leveraging knowledge from multiple tasks.

Meta-learning and Model-agnostic Meta-learning In meta-learning, a sequence of tasks {T1, ..., TI } are sampled from a task-level probability distribution p(T ), where each one is a few-shot learning task. To facilitate the adaption for incoming tasks, the meta-learning algorithm aims to find a well-generalized meta-learner on I training tasks at meta-learning phase. At meta-testing phase, the optimal meta-learner is applied to adapt the new tasks Tt. In this way, meta-learning algorithms are capable of adapting to new tasks efficiently even with a shortage of training data for a new task.

Model-agnostic meta-learning (MAML) (Finn et al., 2017) , one of the representative algorithms in gradient-based meta-learning, regards the meta-learner as the initialization of parameter θ, i.e., θ0, and learns a well-generalized initialization θ * 0 during the meta-training process. The optimization problem is formulated as (one gradient step as exemplary):

EQUATION

At the meta-testing phase, to obtain the adaptive parameter θt for each new task Tt, we finetune the initialization of parameter θ * 0 by performing gradient updates a few steps, i.e.,

f θ t = f θ * 0 -α∇ θ L(f θ ,D tr t ) .

4. METHODOLOGY:

In this section, we introduce the details of the proposed ARML. To better explain how it works, we show its framework in Figure 1 . The goal of ARML is to facilitate the learning process of new tasks by leveraging transferable knowledge learned from historical tasks. To achieve this goal, we introduce a meta-knowledge graph, which is automatically constructed at the meta-training time, to organize and memorize historical learned knowledge. Given a task, which is built as a prototypebased relational structure, it taps into the meta-knowledge graph to acquire relevant knowledge for enhancing its own representation. The enhanced prototype representations further aggregate and incorporate with meta-learner for fast and effective adaptions by utilizing a modulating function. In the following subsections, we elaborate three key components: prototype-based sample structuring, automated meta-knowledge graph construction and utilization, and task-specific knowledge fusion and adaptation, respectively.

4.1. PROTOTYPE-BASED SAMPLE STRUCTURING:

Given a task which involves either classifications or regressions regarding a set of samples, we first investigate the relationships among these samples. Such relationship is represented by a graph, called prototype-based relational graph in this work, where the vertices in the graph denote the prototypes of different classes while the edges and the corresponding edge weights are created based on the similarities between prototypes. Constructing the relational graph based on prototypes instead of raw samples allows us to alleviate the issue raised by abnormal samples. As the abnormal samples, which locate far away from normal samples, could pose significant concerns especially when only a limited number of samples are available for training. Specifically, for classification problem, the prototype, denoted by c k i ∈ R d , is defined as:

EQUATION

where N tr k denotes the number of samples in class k. E is an embedding function, which projects xj into a hidden space where samples from the same class are located closer to each other while samples from different classes stay apart. For regression problem, it is not straightforward to construct i into prototypes, with each prototype represents one class. Then, R i interacts with the meta-knowledge graph G to acquire the most relevant historical knowledge by information propagation. Finally, the task-specific modulation tailors the globally shared initialization θ 0 by aggregating of raw prototypes and enriched prototypes, which absorbs relevant historical information from the meta-knowledge graph.

the prototypes explicitly based on class information. Therefore, we cluster samples by learning an assignment matrix Pi ∈ R K×N tr . Specifically, we formulate the process as:

EQUATION

where Pi[k] represents the k-th row of Pi. Thus, training samples are clustered to K clusters, which serve as the representation of prototypes.

After calculating all prototype representations {c k i |∀k ∈ [1, K]}, which serve as the vertices in the the prototype-based relational graph Ri, we further define the edges and the corresponding edge weights. The edge weight A Ri (c j i , c m i ) between two prototypes c j i and c m i is gauged by the the similarity between them. Formally:

EQUATION

where Wr and br represents learnable parameters, γr is a scalar and σ is the Sigmoid function, which normalizes the weight between 0 and 1. For simplicity, we denote the prototype-based relational graph as Ri = (CR i , AR i ), where CR i = {c j i |∀j ∈ [1, K]} ∈ R K×d represent a set of vertices, with each one corresponds to the prototype from a class, while

AR i = {|AR i (c j i , c m i )|∀j, m ∈ [1, K]} ∈ R K×K

gives the adjacency matrix, which indicates the proximity between prototypes.

4.2. AUTOMATED META-KNOWLEDGE GRAPH CONSTRUCTION AND UTILIZATION:

In this section, we first discuss how to organize and distill knowledge from historical learning process and then expound how to leverage such knowledge to benefit the training of new tasks. To organize and distill knowledge from historical learning process, we construct and maintain a meta-knowledge graph. The vertices represent different types of meta-knowledge (e.g., the common contour between aircrafts and birds) and the edges are automatically constructed to reflect the relationship between meta-knowledge. When serving a new task, we refer to the meta-knowledge, which allows us to efficiently and automatically identify relational knowledge from previous tasks. In this way, the training of a new task can benefit from related training experience and get optimized much faster than otherwise possible. In this paper, the meta-knowledge graph is automatically constructed at the meta-training phase. The details of the construction are elaborated as follows:

Assuming the representation of an vertex g is given by h g ∈ R d , we define the meta-knowledge graph as G = (HG, AG), where

HG = {h j |∀j ∈ [1, G]} ∈ R G×d and AG = {AG(h j , h m )|∀j, m ∈ [1, G]} ∈ R G×G

denote the vertex feature matrix and vertex adjacency matrix, respectively. To better explain the construction of the meta-knowledge graph, we first discuss the vertex representation HG.

During meta-training, tasks arrive one after another in a sequence and their corresponding vertices representations are expected to be updated dynamically in a timely manner. Therefore, the vertex representation of meta-knowledge graph are defined to get parameterized and learned at the training time. Moreover, to encourage the diversity of meta-knowledge encoded in the meta-knowledge graph, the vertex representations are randomly initialized. Analogous to the definition of weight in the prototype-based relational graph Ri in equation 4, the weight between a pair of vertices j and m is constructed as:

EQUATION

where Wo and bo represent learnable parameters and γo is a scalar.

To enhance the learning of new tasks with involvement of historical knowledge, we query the prototype-based relational graph in the meta-knowledge graph to obtain the relevant knowledge in history. The ideal query mechanism is expected to optimize both graph representations simultaneously at the meta-training time, with the training of one graph facilitating the training of the other. In light of this, we construct a super-graph Si by connecting the prototype-based relational graph Ri with the meta-knowledge graph G for each task Ti. The union of the vertices in Ri and G contributes to the vertices in the super-graph. The edges in Ri and G are also reserved in the super-graph. We connect Ri with G by creating links between the prototype-based relational graph with the meta-knowledge graph. The link between prototype c j i in prototype-based relational graph and vertex h m in metaknowledge graph is weighted by the similarity between them. More precisely, for each prototype c j i , the link weight AS (c j i , h m ) is calculated by applying softmax over Euclidean distances between c j i and {h m |∀m ∈ [1, G]} as follows:

EQUATION

where γ s is a scaling factor. We denote the intra-adjacent matrix as

AS = {AS (c j i , h m )|∀j ∈ [1, K], m ∈ [1, G]} ∈ R K×G .

Thus, for task T i , the adjacent matrix and feature matrix of super-graph K+G) and Hi = (CR i ; HG) ∈ R (K+G)×d , respectively. After constructing the super-graph Si, we are able to propagate the most relevant knowledge from meta-knowledge graph G to the prototype-based relational graph Ri by introducing a Graph Neural Networks (GNN). In this work, following the "message-passing" framework (Gilmer et al., 2017) , the GNN is formulated as:

Si = (Ai, Hi) is defined as Ai = (AR i , AS ; A T S , AG) ∈ R (K+G)×(

EQUATION

where MP(•) is the message passing function and has several possible implementations (Hamilton et al., 2017; Kipf & Welling, 2017; Veličković et al., 2018) , H (l) i is the vertex embedding after l layers of GNN and W (l) is a learnable weight matrix of layer l. The input H (0) i = Hi. After stacking L GNN layers, we get the information-propagated feature representation for the prototype-based relational graph Ri as the top-K rows of H (L) i , which is denoted as

ĈR i = {ĉ j i |j ∈ [1, K]}.

4.3. TASK-SPECIFIC KNOWLEDGE FUSION AND ADAPTATION:

After propagating information form meta-knowledge graph to prototype-based relational graph, in this section, we discuss how to learn a well-generalized meta-learner for fast and effective adaptions to new tasks with limited training data. To tackle the challenge of task heterogeneity, in this paper, we incorporate task-specific information to customize the globally shared meta-learner (e.g., initialization here) by leveraging a modulating function, which has been proven to be effective to provide customized initialization in previous studies (Wang et al., 2019; Vuorio et al., 2018) .

The modulating function relies on well-discriminated task representations, while it is difficult to learn all representations by merely utilizing the loss signal derived from the test set D ts i . To encourage such stability, we introduce two reconstructions by utilizing two auto-encoders. There are two collections of parameters, i.e, CR i and ĈR i , which contribute the most to the creation of the task-specific meta-learner. CR i express the raw prototype information without tapping into the meta-knowledge graph, while ĈR i give the prototype representations after absorbing the relevant knowledge from the meta-knowledge graph. Therefore, the two reconstructions are built on CR i and ĈR i . To reconstruct CR i , an aggregator AG q (•) (e.g., recurrent network, fully connected layers) is involved to encode CR i into a dense representation, which is further fed into a decoder AG q dec (•) to achieve reconstructions. 

Update Φ ← Φ -β∇Φ I i=1 L(f θ i , D ts i ) + µiLt + µ2Lq

13: end while Then, the corresponded task representation qi of CR i is summarized by applying a mean pooling operator over prototypes on the encoded dense representation. Formally,

qi = MeanPool(AG q (CR i )) = 1 N tr N tr j=1 (AG q (c j i )), Lq = CR i -AG q dec (AG q (CR i )) 2 F (8)

Similarly, we reconstruct ĈR i and get the corresponded task representation ti as follows:

ti = MeanPool(AG t ( ĈR i )) = 1 N tr N tr j=1 (AG t (ĉ j i )), Lt = ĈR i -AG t dec (AG t ( ĈR i )) 2 F (9)

The reconstruction errors in Equations 8 and 9 pose an extra constraint to enhance the training stability, leading to improvement of task representation learning.

After getting the task representation qi and ti, the modulating function is then used to tailor the task-specific information to the globally shared initialization θ0, which is formulated as:

EQUATION

where Wg and b g is learnable parameters of a fully connected layer. Note that we adopt the Sigmoid gating as exemplary and more discussion about different modulating functions can be found in ablation studies of Section 5.

For each task Ti, we perform the gradient descent process from θ0i and reach its optimal parameter θi.

Combining the reconstruction loss Lt and Lq with the meta-learning loss defined in equation 1, the overall objective function of ARML is:

EQUATION

where µ1 and µ2 are introduced to balance the importance of these three items. Φ represents all learnable parameters. The algorithm of meta-training process of ARML is shown in Alg. 2. The details of the meta-testing process of ARML are available in Appendix A.

5. EXPERIMENTS:

In this section, we conduct extensive experiments to demonstrate the effectiveness of the ARML on 2D regression and few-shot classification.

5.1. EXPERIMENTAL SETTINGS:



Methods for Comparison:

We compare our proposed ARML with two types of baselines: (1) Gradient-based meta-learning methods: both globally shared methods (MAML (Finn et al., 2017) , Meta-SGD (Li et al., 2017) ) and task-specific methods (MT-Net (Lee & Choi, 2018) , MUMO-MAML (Vuorio et al., 2018) , HSML (Yao et al., 2019b) , BMAML (Yoon et al., 2018) ) are considered for comparison.

(2) Other meta-learning methods (non-parametric and black box amortized methods): we select globally shared methods VERSA (Gordon et al., 2019) , Prototypical Network (ProtoNet) (Snell et al., 2017) , TapNet (Yoon et al., 2019) and task-specific method TADAM (Oreshkin et al., 2018) as baselines. Following the traditional settings, non-parametric baselines are only used in few-shot classification. Detailed implementations of baselines are discussed in Appendix B.3.

Hyperparameter Settings For the aggregated function in autoencoder structure (AG t , AG t dec AG q , AG q dec ), we use the GRU as the encoder and decoder in this structure. We adopt one layer GCN (Kipf & Welling, 2017) with tanh activation as the implementation of GNN in equation 7. For the modulation network, we test sigmoid, tanh and Film modulation, and find that sigmoid modulation achieves best performance. Thus, in the future experiment, we set the sigmoid modulation as modulating function.

More detailed discussion about experiment settings are presented in Appendix B.

5.2. 2D REGRESSION:

Dataset Description In 2D regression problem, we adopt the similar regression problem settings as (Finn et al., 2018; Vuorio et al., 2018; Yao et al., 2019b; Rusu et al., 2019) , which includes several families of functions. In this paper, to model more complex relational structures, we design a 2D regression problem rather than traditional 1D regression. Input x ∼ U [0.0, 5.0] and y ∼ U [0.0, 5.0] are sampled randomly and random Gaussian noisy with standard deviation 0.3 is added to the output. Furthermore, six underlying functions are selected, including (1) Sinusoids: z(x, y) = assin(wsx + bs), where as (Finn et al., 2017) , we use two fully connected layers with 40 neurons as the base model. The number of vertices of meta-knowledge graph is set as 6.

∼ U [0.1, 5.0], bs ∼ U [0, 2π] ws ∼ U [0.8, 1.2]; (2) Line: z(x, y) = a l x + b l ,

Results and Analysis:

In Figure 2 , we summarize the interpretation of meta-knowledge graph (see top figure, and more cases are provided in Figure 8 of Appendix G.4) and the the qualitative results (see bottom table) of 10-shot 2D regression. In the bottom table, we can observe that ARML achieves the best performance as compared to competitive gradient-based meta-learning methods, i.e., globally shared models and task-specific models. This finding demonstrates that the meta-knowledge graph is necessary to model and capture task-specific information. The superior performance can also be interpreted in the top figure. In the left, we show the heatmap between prototypes and meta-knowledge vertices (darker color means higher similarity). We can see that sinusoids and line activate V1 and V4, which may represent curve and line, respectively. V1 and V4 also contribute to quadratic and quadratic surface, which also show the similarity between these two families of functions. V3 is activated in P0 of all functions and the quadratic surface and ripple further activate V1 in P0, which may show the different between 2D functions and 3D functions (sinusoid, line, quadratic and cubic lie in the subspace). Specifically, in the right figure, we illustrate the meta-knowledge graph, where we set a threshold to filter the link with low similarity score and show the rest. We can see that V3 is the most popular vertice and connected with V1, V5 (represent curve) and V4 (represent line). V1 is further connected with V5, demonstrating the similarity of curve representation.

5.3. FEW-SHOT CLASSIFICATION:

Dataset Description and Settings In the few-shot classification problem, we first use the benchmark proposed in (Yao et al., 2019b) , where four fine-grained image classification datasets are included (i.e., CUB-200-2011 (Bird) , Describable Textures Dataset (Texture), FGVC of Aircraft (Aircraft), and FGVCx-Fungi (Fungi)). For each few-shot classification task, it samples classes from one of four datasets. In this paper, we call this dataset as Plain-Multi and each fine-grained dataset as subdataset.

Then, to demonstrate the effectiveness of our proposed model for handling more complex underlying structures, in this paper, we increase the difficulty of few-shot classification problem by introducing two image filters: blur filter and pencil filter. Similar to (Jerfel et al., 2019) , for each image in Plain-Multi, one artistic filters are applied to simulate a changing distribution of few-shot classification tasks. After applying the filters, the total number of subdatasets is 12 and each task is sampled from one of them. This data is named as Art-Multi. More detailed descriptions of the effect of different filters are discussed in Appendix C.

Following the traditional meta-learning settings, all datasets are divided into meta-training, metavalidation and meta-testing classes. The traditional N-way K-shot settings are used to split training and test set for each task. We adopt the standard four-block convolutional layers as the base learner (Finn et al., 2017; Snell et al., 2017) for ARML and all baselines for a fair comparison. The number of vertices of meta-knowledge graph for Plain-Multi and Art-Multi datasets are set as 4 and 8, respectively. Additionally, for the miniImagenet and tieredImagenet (Ren et al., 2018) , similar to (Finn et al., 2018) , which tasks are constructed from a single domain and do not have heterogeneity, we compare our proposed ARML with baseline models and present the results in Appendix D.

Overall Performance Experimental results for Plain-Multi and Art-Multi are shown in Table 1 and Table 2 , respectively. For each dataset, the performance accuracy with 95% confidence interval is reported. Due to the space limitation, in Art-Multi dataset, we only show the average value of each filter here. The full results are shown in Table 8 of Appendix E. In these two tables, first, we can observe that task-specific gradient-based models (MT-Net, MUMOMAML, HSML, BMAML) significantly outperforms globally shared models (MAML, Meta-SGD). Second, compared ARML with other task-specific gradient-based meta-learning methods, the better performance confirms that ARML can model and extract task-specific information more accurately by leveraging the constructed meta-knowledge graph. Especially, the performance gap between the ARML and HSML verifies the benefits of relational structure compared with hierarchical clustering structure. Third, as a gradientbased meta-learning algorithm, ARML can also outperform methods of other research lines (i.e., ProtoNet, TADAM, TapNet and VERSA). Finally, to show the effectiveness of proposed components in ARML, we conduct comprehensive ablation studies in Appendix F. The results further demonstrate the effectiveness of prototype-based relational graph and meta-knowledge graph.

Analysis of Constructed Meta-knowledge Graph:

In this section, we conduct extensive qualitative analysis for the constructed meta-knowledge graph, which is regarded as the key component in ARML. Due to the space limit, we present the results on Art-Multi datasets here and the analysis of Plain-Multi with similar observations is discussed in Appendix G.1. We further analyze the effect of To analyze the learned meta-knowledge graph, for each subdataset, we randomly select one task as exemplary (see Figure 9 of Appendix G.4 for more cases). For each task, in the left part of Figure 3 , we show the similarity heatmap between prototypes and vertices in meta-knowledge graph, where deeper color means higher similarity. V0-V8 and P1-P5 denote the different vertices and prototypes, respectively. The meta-knowledge graph is also illustrated in the right part. Similar to the graph in 2D regression, we set a threshold to filter links with low similarity and illustrate the rest of them. First, we can see that the V1 is mainly activated by bird and aircraft (including all filters), which may reflect the shape similarity between bird and aircraft. Second, V2, V3, V4 are firstly activated by texture and they form a loop in the meta-knowledge graph. Especially, V2 also benefits images with blur and pencil filters. Thus, V2 may represent the main texture and facilitate the training process on other subdatasets. The meta-knowledge graph also shows the importance of V2 since it is connected with almost all other vertices. Third, when we use blur filter, in most cases (bird blur, texture blur, fungi blur), V7 is activated. Thus, V7 may show the similarity of images with blur filter. In addition, the connection between V7 and V2 and V3 show that classifying blur images may depend on the texture information. Fourth, V6 (activated by aircraft mostly) connects with V2 and V3, justifying the importance of texture information to classify the aircrafts.

6. CONCLUSION:

In this paper, to improve the effectiveness of meta-learning for handling heterogeneous task, we propose a new framework called ARML, which automatically extract relation across tasks and construct a meta-knowledge graph. When a new task comes in, it can quickly find the most relevant relations through the meta-knowledge graph and use this knowledge to facilitate its training process.

The experiments demonstrate the effectiveness of our proposed algorithm.

In the future, we plan to investigate the problem in the following directions: (1) we are interested to investigate the more explainable semantic meaning in the meta-knowledge graph on this problem; (2) For each subdataset, we randomly select one task from them. In the left, we show the similarity heatmap between prototypes (P0-P5) and meta-knowledge vertices (V0-V7). In the right part, we show the meta-knowledge graph.

we plan to extend the ARML to the continual learning scenario where the structure of meta-knowledge graph will change over time;

(3) our proposed model focuses on tasks where the feature space, the label space are shared. We plan to explore the relational structure on tasks with different feature and label spaces.

A ALGORITHM IN META-TESTING PROCESS 

θt = θ0t -α∇ θ L(f θ , D tr t ) B HYPERPARAMETERS SETTINGS B.1 2D REGRESSION

In 2D regression problem, we set the inner-loop stepsize (i.e., α) and outer-loop stepsize (i.e., β) as 0.001 and 0.001, respectively. The embedding function E is set as one layer with 40 neurons. The autoencoder aggregator is constructed by the gated recurrent structures. We set the meta-batch size as 25 and the inner loop gradient steps as 5.

B.2 FEW-SHOT IMAGE CLASSIFICATION:

In few-shot image classification, for both Plain-Multi and Art-Multi datasets, we set the corresponding inner stepsize (i.e., α) as 0.001 and the outer stepsize (i.e., β) as 0.01. For the embedding function E, we employ two convolutional layers with 3 × 3 filters. The channel size of these two convolutional layers are 32. After convolutional layers, we use two fully connected layers with 384 and 128 neurons for each layer. Similar to the hyperparameter settings in 2D regression, the autoencoder aggregator is constructed by the gated recurrent structures, i.e., AG t , AG t dec AG q , AG q dec are all GRUs. The meta-batch size is set as 4. For the inner loop, we use 5 gradient steps.

B.3 DETAILED BASELINE SETTINGS:

For the gradient-based baselines (i.e., MAML, MetaSGD, MT-Net, BMAML. MUMOMAML, HSML), we use the same inner loop stepsize and outer loop stepsize rate as our ARML. As for non-parametric based meta-learning algorithms, both TADAM and Prototypical network, we use the same meta-training and meta-testing process as gradient-based models. Additionally, TADAM uses the same embedding function E as ARML for fair comparison (i.e., similar expressive ability).

C ADDITIONAL DISCUSSION OF DATASETS:

In this dataset, we use pencil and blur filers to change the task distribution. To investigate the effect of pencil and blur filters, we provide one example in Figure 4 . We can observe that different filters result in different data distributions. All used filters are provided by OpenCV1 . 

D RESULTS ON MINIIMAGENET AND TIEREDIMAGENET:

For miniimagenet and tieredImagenet, since it do not have the characteristic of task heterogeneity, we show the results in Table 3 and Table 4 , respectively. In this table, we compare our model with other gradient-based meta-learning models (the top baselines are globally shared models and the bottom baselines are task-specific models). Similar to (Finn et al., 2018) , we also apply the standard 4-block convolutional layers for each baseline. For MT-Net on MiniImagenet, we use the reported results in (Yao et al., 2019b) , which control the model with the same expressive power. Most task-specific models including ARML achieve the similar performance on the standard benchmark due to the homogeneity between tasks.

Table 3 : Performance comparison on the 5-way, 1-shot MiniImagenet dataset.

Algorithms 5-way 1-shot Accuracy MAML (Finn et al., 2017) 48.70 ± 1.84% LLAMA (Finn & Levine, 2018) 49.40 ± 1.83% Reptile (Nichol & Schulman, 2018) 49.97 ± 0.32% MetaSGD (Li et al., 2017) 50.47 ± 1.87%

MT-Net (Lee & Choi, 2018) 49.75 ± 1.83% MUMOMAML (Vuorio et al., 2018) 49.86 ± 1.85% HSML (Yao et al., 2019b) 50.38 ± 1.85% PLATIPUS (Finn et al., 2018) 50.13 ± 1.86% ARML 50.42 ± 1.73%

Table 4 : Performance comparison on the 5-way, 1-shot tieredImagenet dataset.

Algorithms 5-way 1-shot Accuracy MAML (Finn et al., 2017) 51.37 ± 1.80% Reptile (Nichol & Schulman, 2018) 49.41 ± 1.82% MetaSGD (Li et al., 2017) 51.48 ± 1.79%

MT-Net (Lee & Choi, 2018) 51.95 ± 1.83% MUMOMAML (Vuorio et al., 2018) 52.59 ± 1.80% HSML (Yao et al., 2019b) 52.67 ± 1.85% ARML 52.91 ± 1.83%

E ADDITIONAL RESULTS OF FEW-SHOT IMAGE CLASSIFICATION:

We provide the full results table of Art-Multi Dataset in Table 8 . In this table, we can see our proposed ARML outperforms almost all baselines in every sub-datasets.

F ABLATION STUDY:

In this section, we perform the ablation study of the proposed ARML to demonstrate the effectiveness of each component. The results of ablation study on 5-way, 5-shot scenario for Art-Multi and Plain-Multi datasets are presented in Table 5 and Table 6 , respectively. Specifically, to show the effectiveness of prototype-based relational graph, in ablation I, we apply the mean pooling to aggregate each sample and then feed it to interact with meta-knowledge graph. In ablation II, we use all samples to construct the sample-level relational graph without constructing prototype. In ablation III, we remove the links between prototypes. Compared with ablation I, II and III, the better performance of ARML shows that structuring samples can (1) better handling the underlying relations ( 2) alleviating the effect of potential anomalies by structuring samples as prototypes.

In ablation IV, we remove the meta-knowledge graph and use the prototype-based relational graph with aggregator AG q as the task representation. The better performance of ARML demonstrates the effectiveness of meta-knowledge graph for capturing the relational structure and facilitating the classification performance. We further remove the reconstruction loss in ablation V and replace the encoder/decoder structure as MLP in ablation VI. The results demonstrate that the autoencoder structure benefits the process of task representation learning and selected encoder and decoder.

In ablation VII, we share the gate value within each filter in Convolutional layers. Compared with VII, the better performance of ARML indicates the benefit of customized gate for each parameter.

In ablation VIII and IX, we change the modulate function to Film (Perez et al., 2018) and tanh, respectively. We can see that ARML is not very sensitive to the modulating activation, and Sigmoid function is slightly better in most cases. 5 ). In this figure, we can see that different subdatasets activate different vertices. Specifically, V2, which is mainly activated by texture, plays a significantly important role in aircraft and fungi. Thus, V2 connects with V3 and V1 in the meta-knowledge graph, which is mainly activated by fungi and aircraft, respectively. In addition, V0 is also activated by aircraft because of the similar contour between aircraft and bird. Furthermore, in meta-knowledge graph, V0 connects with V3, which shows the similarity of environment between bird images and fungi images. For each subdataset, one task is randomly selected from them. In the left figure, we show the similarity heatmap between prototypes (P1-P5) and meta-knowledge vertices (denoted as E1-E4), where deeper color means higher similarity. In the right part, we show the meta-knowledge graph, where a threshold is also set to filter low similarity links.

G.2 PERFORMANCE V.S. VERTICE NUMBERS:

We first investigate the impact of vertice numbers in meta-knowledge graph. The results of Art-Multi (5-way, 5-shot) are shown in Table 7 . From the results, we can notice that the performance saturates as the number of vertices around 8. One potential reason is that 8 vertices are enough to capture the potential relations. If we have a larger datasets with more complex relations, more vertices may be needed. In addition, if the meta-knowledge graph does not have enough vertices, the worse performance suggests that the graph may not capture enough relations across tasks. In this part, we provide the case study to visualize the task structure of HSML and ARML. HSML is one of representative task-specific meta-learning methods, which adapts transferable knowledge by introducing a task-specific representation. It proposes a tree structure to learn the relations between tasks. However, the structure requires massive labor efforts to explore the optimal structure. By contrast, ARML automatically learn the relation across tasks by introducing the knowledge graph. In addition, ARML fully exploring there types of relations simultaneously, i.e., the prototype-prototype, prototype-knowledge and knowledge-knowledge relations.

To compare these two models, we show the case studies of HSML and ARML in Figure 6 and Figure 7 . For tasks sampled from bird, bird blur, aircraft and aircraft blur are selected for this comparison. Following case study settings in the original paper (Yao et al., 2019b) , for each task, we show the soft-assignment probability to each cluster and the learned hierarchical structure. For ARML, like 3, we show the learned meta-knowledge and the similarity heatmap between prototypes and meta-knowledge vertices. In this figures we can observe that ARML constructs relations in a more flexible way by introducing the graph structure. More specifically, while HSML activate relevant node in a fixed two-layer hierarchical way, ARML provides more possibilities to leverage previous learned tasks by leveraging prototypes and the learned meta-knowledge graph. 

:

https://opencv.org/

Figures and Tables:

Few-shot Learning Considering a task Ti, the goal of few-shot learning is to learn a model with a dataset Di = {D tr i , D ts i }, where the labeled training set D tr i = {x tr j , y tr j |∀j ∈ [1, N tr ]} only has a few samples and D ts i represents the corresponding test set. A learning model (a.k.a., base model) f

Figure1: The framework of ARML. For each task T i , ARML first builds a prototype-based relational structure R i by mapping the training samples D tr i into prototypes, with each prototype represents one class. Then, R i interacts with the meta-knowledge graph G to acquire the most relevant historical knowledge by information propagation. Finally, the task-specific modulation tailors the globally shared initialization θ 0 by aggregating of raw prototypes and enriched prototypes, which absorbs relevant historical information from the meta-knowledge graph.

where a l ∼ U [-3.0, 3.0], b l ∼ U [-3.0, 3.0]; (3) Quadratic: z(x, y) = aqx 2 + bqx + cq, where aq ∼ U [-0.2, 0.2], bq ∼ U [-2.0, 2.0], cq ∼ U [-3.0, 3.0]; (4) Cubic: z(x, y) = acx 3 + bcx 2 + ccx + dc, where ac ∼ U [-0.1, 0.1], bc ∼ U [-0.2, 0.2], cc ∼ U [-2.0, 2.0], dc ∼ U [-3.0, 3.0]; (5) Quadratic Surface: z(x, y) = aqsx 2 + bqsy 2 , where aqs ∼ U [-1.0, 1.0], bqs ∼ U [-1.0, 1.0]; (6) Ripple: z(x, y) = sin(-ar(x 2 + y 2 )) + br, where ar ∼ U [-0.2, 0.2], br ∼ U [-3.0, 3.0]. Note that, function 1-4 are located in the subspace of y = 1. Follow

Figure 2: In the top figure, we show the interpretation of meta-knowledge graph. The left heatmap shows the similarity between prototypes (P0, P1) and meta-knowledge vertices (V0-V5). The right part show the meta-knowledge graph. In the bottom table, we show the overall performance (mean square error with 95% confidence) of 10-shot 2D regression.

Figure 3: Interpretation of meta-knowledge graph on Art-Multi dataset.For each subdataset, we randomly select one task from them. In the left, we show the similarity heatmap between prototypes (P0-P5) and meta-knowledge vertices (V0-V7). In the right part, we show the meta-knowledge graph.

Figure 4: Effect of different filters.

Figure 5: Interpretation of meta-knowledge graph on Plain-Multi dataset.For each subdataset, one task is randomly selected from them. In the left figure, we show the similarity heatmap between prototypes (P1-P5) and meta-knowledge vertices (denoted as E1-E4), where deeper color means higher similarity. In the right part, we show the meta-knowledge graph, where a threshold is also set to filter low similarity links.

Figure 6: Case study for learned structure of HSML. For each task, the top heatmap shows the soft-assignment probability with each cluster and the top tree show the learned hierarchical structure.

Figure 7: Case study for learned structure of ARML. Both the learned graph and the similarity heatmap between prototypes and meta-knowledge vertices are illustrated.

Algorithm 1 Meta-Training Process of ARML Require: p(T ): distribution over tasks; K: Number of vertices in meta-knowledge graph; α: stepsize for gradient descent of each task (i.e., inner loop stepsize); β: stepsize for meta-optimization (i.e., outer loop stepsize); µ1, µ2: balancing factors in loss function 1: Randomly initialize all learnable parameters Φ 2: while not done do Si and get the information-propagated representation ĈR i 9: Aggregate CR i in equation 8 and ĈR i in equation 9 to get the representations qi, ti and reconstruction loss Lq, Lt

Table content: <table><tr><td>3:</td><td>Sample a batch of tasks {Ti|i ∈ [1, I]} from p(T )</td></tr><tr><td>4:</td><td>for all Ti do</td></tr><tr><td>5:</td><td>Sample training set D tr i and testing set D ts i</td></tr><tr><td>6:</td><td>Construct the prototype-based relational graph Ri by computing prototype in equation 2</td></tr><tr><td/><td>and weight in equation 4</td></tr><tr><td>7:</td><td>Compute the similarity between each prototype and meta-knowledge vertex in equation 6</td></tr><tr><td/><td>and construct the super-graph Si</td></tr><tr><td colspan="2">8: Apply GNN on super-graph 10: Compute the task-specific initialization θ0i in equation 10 and update parameters θi =</td></tr><tr><td/><td>θ0i -α∇ θ L(f θ , D tr i )</td></tr><tr><td>11:</td><td>end for</td></tr><tr><td>12:</td><td/></tr></table>

Overall few-shot classification results (accuracy ± 95% confidence) on Plain-Multi dataset.

Table content: <table><tr><td colspan="2">Settings Algorithms</td><td>Data: Bird</td><td>Data: Texture</td><td>Data: Aircraft</td><td>Data: Fungi</td></tr><tr><td/><td>VERSA</td><td>53.40 ± 1.41%</td><td>30.43 ± 1.30%</td><td>50.60 ± 1.34%</td><td>40.40 ± 1.40%</td></tr><tr><td/><td>ProtoNet</td><td>54.11 ± 1.38%</td><td>32.52 ± 1.28%</td><td>50.63 ± 1.35%</td><td>41.05 ± 1.37%</td></tr><tr><td/><td>TapNet</td><td>54.90 ± 1.34%</td><td>32.44 ± 1.23%</td><td>51.22 ± 1.34%</td><td>42.88 ± 1.35%</td></tr><tr><td>5-way</td><td>TADAM</td><td>56.58 ± 1.34%</td><td>33.34 ± 1.27%</td><td>53.24 ± 1.33%</td><td>43.06 ± 1.33%</td></tr><tr><td>1-shot</td><td>MAML</td><td>53.94 ± 1.45%</td><td>31.66 ± 1.31%</td><td>51.37 ± 1.38%</td><td>42.12 ± 1.36%</td></tr><tr><td/><td>MetaSGD</td><td>55.58 ± 1.43%</td><td>32.38 ± 1.32%</td><td>52.99 ± 1.36%</td><td>41.74 ± 1.34%</td></tr><tr><td/><td>BMAML</td><td>54.89 ± 1.48%</td><td>32.53 ± 1.33%</td><td>53.63 ± 1.37%</td><td>42.50 ± 1.33%</td></tr><tr><td/><td>MT-Net</td><td>58.72 ± 1.43%</td><td>32.80 ± 1.35%</td><td>47.72 ± 1.46%</td><td>43.11 ± 1.42%</td></tr><tr><td/><td>MUMOMAML</td><td>56.82 ± 1.49%</td><td>33.81 ± 1.36%</td><td>53.14 ± 1.39%</td><td>42.22 ± 1.40%</td></tr><tr><td/><td>HSML</td><td>60.98 ± 1.50%</td><td>35.01 ± 1.36%</td><td>57.38 ± 1.40%</td><td>44.02 ± 1.39%</td></tr><tr><td/><td>ARML</td><td colspan="4">62.33 ± 1.47% 35.65 ± 1.40% 58.56 ± 1.41% 44.82 ± 1.38%</td></tr><tr><td/><td>VERSA</td><td>65.86 ± 0.73%</td><td>37.46 ± 0.65%</td><td>62.81 ± 0.66%</td><td>48.03 ± 0.78%</td></tr><tr><td/><td>ProtoNet</td><td>68.67 ± 0.72%</td><td>45.21 ± 0.67%</td><td>65.29 ± 0.68%</td><td>51.27 ± 0.81%</td></tr><tr><td/><td>TapNet</td><td>69.07 ± 0.74%</td><td>45.54 ± 0.68%</td><td>67.16 ± 0.66%</td><td>51.08 ± 0.80%</td></tr><tr><td>5-way</td><td>TADAM</td><td>69.13 ± 0.75%</td><td>45.78 ± 0.65%</td><td>69.87 ± 0.66%</td><td>53.15 ± 0.82%</td></tr><tr><td>5-shot</td><td>MAML</td><td>68.52 ± 0.79%</td><td>44.56 ± 0.68%</td><td>66.18 ± 0.71%</td><td>51.85 ± 0.85%</td></tr><tr><td/><td>MetaSGD</td><td>67.87 ± 0.74%</td><td>45.49 ± 0.68%</td><td>66.84 ± 0.70%</td><td>52.51 ± 0.81%</td></tr><tr><td/><td>BMAML</td><td>69.01 ± 0.74%</td><td>46.06 ± 0.69%</td><td>65.74 ± 0.67%</td><td>52.43 ± 0.84%</td></tr><tr><td/><td>MT-Net</td><td>69.22 ± 0.75%</td><td>46.57 ± 0.70%</td><td>63.03 ± 0.69%</td><td>53.49 ± 0.83%</td></tr><tr><td/><td>MUMOMAML</td><td>70.49 ± 0.76%</td><td>45.89 ± 0.69%</td><td>67.31 ± 0.68%</td><td>53.96 ± 0.82%</td></tr><tr><td/><td>HSML</td><td>71.68 ± 0.73%</td><td>48.08 ± 0.69%</td><td>73.49 ± 0.68%</td><td>56.32 ± 0.80%</td></tr><tr><td/><td>ARML</td><td colspan="4">73.34 ± 0.70% 49.67 ± 0.67% 74.88 ± 0.64% 57.55 ± 0.82%</td></tr><tr><td colspan="6">different number of vertices in meta-knowledge graph in Appendix G.2 and conduct a comparison</td></tr><tr><td colspan="4">with HSML about the learned structure in Appendix G.3.</td><td/><td/></tr></table>

Overall few-shot classification results (accuracy ± 95% confidence) on Art-Multi dataset.

Table content: <table><tr><td>Settings</td><td colspan="2">Algorithms</td><td>Avg. Original</td><td>Avg. Blur</td><td>Avg. Pencil</td></tr><tr><td/><td>VERSA</td><td/><td>43.91 ± 1.35%</td><td>41.98 ± 1.35%</td><td>38.70 ± 1.33%</td></tr><tr><td/><td>Protonet</td><td/><td>42.08 ± 1.34%</td><td>40.51 ± 1.37%</td><td>36.24 ± 1.35%</td></tr><tr><td/><td>TapNet</td><td/><td>42.15 ± 1.36%</td><td>41.16 ± 1.34%</td><td>37.25 ± 1.33%</td></tr><tr><td>5-way, 1-shot</td><td>TADAM</td><td/><td>44.73 ± 1.33%</td><td>42.44 ± 1.35%</td><td>39.02 ± 1.34%</td></tr><tr><td/><td>MAML</td><td/><td>42.70 ± 1.35%</td><td>40.53 ± 1.38%</td><td>36.71 ± 1.37%</td></tr><tr><td/><td>MetaSGD</td><td/><td>44.21 ± 1.38%</td><td>42.36 ± 1.39%</td><td>37.21 ± 1.39%</td></tr><tr><td/><td>MT-Net</td><td/><td>43.94 ± 1.40%</td><td>41.64 ± 1.37%</td><td>37.79 ± 1.38%</td></tr><tr><td/><td>BMAML</td><td/><td>43.66 ± 1.36%</td><td>41.08 ± 1.35%</td><td>37.28 ± 1.39%</td></tr><tr><td/><td colspan="2">MUMOMAML</td><td>45.63 ± 1.39%</td><td>41.59 ± 1.38%</td><td>39.24 ± 1.36%</td></tr><tr><td/><td>HSML</td><td/><td>45.68 ± 1.37%</td><td>42.62 ± 1.38%</td><td>39.78 ± 1.36%</td></tr><tr><td/><td>ARML</td><td/><td colspan="3">47.92 ± 1.34% 44.43 ± 1.34% 41.44 ± 1.34%</td></tr><tr><td/><td>VERSA</td><td/><td>55.03 ± 0.71%</td><td>53.41 ± 0.70%</td><td>47.93 ± 0.70%</td></tr><tr><td/><td>Protonet</td><td/><td>58.12 ± 0.74%</td><td>55.07 ± 0.73%</td><td>50.15 ± 0.74%</td></tr><tr><td/><td>TapNet</td><td/><td>57.77 ± 0.73%</td><td>55.21 ± 0.72%</td><td>50.68 ± 0.71%</td></tr><tr><td>5-way, 5-shot</td><td>TADAM</td><td/><td>60.35 ± 0.72%</td><td>58.36 ± 0.73%</td><td>53.15 ± 0.74%</td></tr><tr><td/><td>MAML</td><td/><td>58.30 ± 0.74%</td><td>55.71 ± 0.74%</td><td>49.59 ± 0.73%</td></tr><tr><td/><td>MetaSGD</td><td/><td>57.82 ± 0.72%</td><td>55.54 ± 0.73%</td><td>50.24 ± 0.72%</td></tr><tr><td/><td>BMAML</td><td/><td>58.84 ± 0.73%</td><td>56.21 ± 0.71%</td><td>51.22 ± 0.73%</td></tr><tr><td/><td>MT-Net</td><td/><td>57.95 ± 0.74%</td><td>54.65 ± 0.73%</td><td>49.18 ± 0.73%</td></tr><tr><td/><td/><td/><td/><td>V1</td></tr><tr><td/><td/><td/><td/><td/><td>V2</td></tr><tr><td>Bird</td><td>Texture</td><td>Aircraft</td><td>Fungi</td><td/></tr><tr><td/><td/><td/><td/><td>V0</td><td>V3</td></tr><tr><td>Bird Blur</td><td>Texture Blur</td><td>Aircraft Blur</td><td>Fungi Blur</td><td>V7</td></tr><tr><td/><td/><td/><td/><td/><td>V4</td></tr><tr><td/><td/><td/><td/><td>V6</td></tr><tr><td/><td/><td/><td/><td>V5</td></tr><tr><td>Bird Pencil</td><td>Texture Pencil</td><td>Aircraft Pencil</td><td>Fungi Pencil</td><td/></tr></table>

Compute the similarity between each prototype and meta-knowledge vertice in equation 6 and construct the super-graph St 3: Apply GNN on super-graph St and get the updated prototype representation ĈR t 4: Aggregate CR t in equation 8, ĈR t in equation 9 and get the representations qt, tt 5: Compute the task-specific initialization θ0t in equation 10 6: Update parameters

Table content: <table><tr><td>Algorithm 2 Meta-Testing Process of ARML</td></tr><tr><td>Require: Training data D tr t of a new task T t</td></tr><tr><td>1: Construct the prototype-based relational graph R t by computing prototype in equation 2 and</td></tr><tr><td>weight in equation 4</td></tr><tr><td>2:</td></tr></table>

Full evaluation results of model ablation study on Art-Multi dataset. B, T, A, F represent bird, texture, aircraft, fungi, respectively. Plain means original image.

Table content: <table><tr><td>Model</td><td>B Plain</td><td>B Blur</td><td>B Pencil</td><td>T Plain</td><td>T Blur</td><td>T Pencil</td></tr><tr><td>I. no prototype-based graph</td><td>72.08%</td><td>71.06%</td><td>66.83%</td><td>45.23%</td><td>39.97%</td><td>41.67%</td></tr><tr><td>II. no prototype</td><td>72.99%</td><td>70.92%</td><td>67.19%</td><td>45.17%</td><td>40.05%</td><td>41.04%</td></tr><tr><td>III. no prototype links</td><td>72.53%</td><td>71.09%</td><td>67.11%</td><td>45.08%</td><td>40.12%</td><td>41.01%</td></tr><tr><td>IV. no meta-knowledge graph</td><td>70.79%</td><td>69.53%</td><td>64.87%</td><td>43.37%</td><td>39.86%</td><td>41.23%</td></tr><tr><td>V. no reconstruction loss</td><td>70.82%</td><td>69.87%</td><td>65.32%</td><td>44.02%</td><td>40.18%</td><td>40.52%</td></tr><tr><td>VI. replace encoder/decoder as MLP</td><td>71.36%</td><td>70.25%</td><td>66.38%</td><td>44.18%</td><td>39.97%</td><td>41.85%</td></tr><tr><td>VII. share the gate within Conv. filter</td><td>72.03%</td><td>68.15%</td><td>65.23%</td><td>43.98%</td><td>40.13%</td><td>39.71%</td></tr><tr><td>VIII. tanh</td><td>72.70%</td><td>69.53%</td><td colspan="4">66.85% 45.81% 40.79% 38.64%</td></tr><tr><td>IX. film</td><td>71.52%</td><td>68.70%</td><td>64.23%</td><td>43.83%</td><td>40.52%</td><td>39.49%</td></tr><tr><td>ARML</td><td colspan="4">73.05% 71.31% 67.14% 45.32%</td><td colspan="2">40.15% 41.98%</td></tr><tr><td>Model</td><td>A Plain</td><td>A Blur</td><td>A Pencil</td><td>F Plain</td><td>F Blur</td><td>F Pencil</td></tr><tr><td>I. no prototype-based graph</td><td>70.06%</td><td>68.02%</td><td>60.66%</td><td>55.81%</td><td>54.39%</td><td>50.01%</td></tr><tr><td>II. no prototype</td><td>71.10%</td><td>67.59%</td><td>61.07%</td><td>56.11%</td><td>54.82%</td><td>49.95%</td></tr><tr><td>III. no prototype links</td><td>71.56%</td><td>67.91%</td><td>60.83%</td><td>55.76%</td><td>54.60%</td><td>50.08%</td></tr><tr><td>IV. no meta-knowledge graph</td><td>69.97%</td><td>68.03%</td><td>59.72%</td><td>55.84%</td><td>53.72%</td><td>48.91%</td></tr><tr><td>V. no reconstruction loss</td><td>66.83%</td><td>65.73%</td><td>55.98%</td><td>54.62%</td><td>53.02%</td><td>48.01%</td></tr><tr><td>VI. replace encoder/decoder as MLP</td><td>70.93%</td><td>68.12%</td><td>60.95%</td><td>56.02%</td><td>53.83%</td><td>50.22%</td></tr><tr><td>VII. share the gate within Conv. filter</td><td>71.25%</td><td>67.49%</td><td>58.09%</td><td>55.36%</td><td>54.25%</td><td>49.90%</td></tr><tr><td>VIII. tanh</td><td colspan="5">73.96% 69.70% 60.75% 56.87% 54.30%</td><td>49.82%</td></tr><tr><td>IX. film</td><td>69.13%</td><td>66.93%</td><td>55.59%</td><td>55.77%</td><td>53.72%</td><td>48.92%</td></tr><tr><td>ARML</td><td>71.89%</td><td colspan="5">68.59% 61.41% 56.83% 54.87% 50.53%</td></tr></table>

Results of Model Ablation (5-way, 5-shot results) on Plain-Multi dataset.

Table content: <table><tr><td>Ablation Models</td><td>Bird</td><td>Texture</td><td>Aircraft</td><td>Fungi</td></tr><tr><td>I. no prototype-based graph</td><td>71.96 ± 0.72%</td><td>48.79 ± 0.67%</td><td>74.02 ± 0.65%</td><td>56.83 ± 0.80%</td></tr><tr><td>II. no prototype</td><td>72.86 ± 0.74%</td><td>49.03 ± 0.69%</td><td>74.36 ± 0.65%</td><td>57.02 ± 0.81%</td></tr><tr><td>III. no prototype links</td><td>72.53 ± 0.72%</td><td>49.25 ± 0.68%</td><td>74.46 ± 0.64%</td><td>57.10 ± 0.81%</td></tr><tr><td>IV. no meta-knowledge graph</td><td>71.23 ± 0.75%</td><td>47.96 ± 0.68%</td><td>73.71 ± 0.69%</td><td>55.97 ± 0.82%</td></tr><tr><td>V. no reconstruction loss</td><td>70.99 ± 0.74%</td><td>48.03 ± 0.69%</td><td>69.86 ± 0.66%</td><td>55.78 ± 0.83%</td></tr><tr><td>VI. replace encoder/decoder as MLP</td><td>72.36 ± 0.72%</td><td>48.93 ± 0.67%</td><td>74.28 ± 0.65%</td><td>56.91 ± 0.83%</td></tr><tr><td>VII. share the gate within Conv. filter</td><td>72.83 ± 0.72%</td><td>48.66 ± 0.68%</td><td>74.13 ± 0.66%</td><td>56.83 ± 0.81%</td></tr><tr><td>VIII. tanh</td><td>73.45 ± 0.71%</td><td>49.23 ± 0.66%</td><td>74.39 ± 0.65%</td><td>57.38 ± 0.80%</td></tr><tr><td>IX. film</td><td>72.95 ± 0.73%</td><td>49.18 ± 0.69%</td><td>73.82 ± 0.68%</td><td>56.89 ± 0.80%</td></tr><tr><td>ARML</td><td>73.34 ± 0.70%</td><td>49.67 ± 0.67%</td><td>74.88 ± 0.64%</td><td>57.55 ± 0.82%</td></tr><tr><td colspan="4">G ADDITIONAL ANALYSIS OF META-KNOWLEDGE GRAPH</td><td/></tr><tr><td colspan="3">G.1 QUALITATIVE ANALYSIS ON PLAIN-MULTI DATASET</td><td/><td/></tr><tr><td colspan="5">Then, we analyze the meta-knowledge graph on Plain-Multi dataset by visualizing the learned meta-</td></tr><tr><td colspan="3">knowledge graph on Plain-Multi dataset (as shown in Figure</td><td/><td/></tr></table>

Full evaluation results of performance v.s. # vertices of meta-knowledge graph on Art-Multi. B, T, A, F represent bird, texture, aircraft, fungi, respectively. Plain means original image.

Table content: <table><tr><td colspan="2"># of Vertices B Plain</td><td>B Blur</td><td>B Pencil</td><td>T Plain</td><td>T Blur</td><td>T Pencil</td></tr><tr><td>4</td><td colspan="6">72.29% 70.36% 67.88% 45.37% 41.05% 41.43%</td></tr><tr><td>8</td><td colspan="6">73.05% 71.31% 67.14% 45.32% 40.15% 41.98%</td></tr><tr><td>12</td><td colspan="6">73.45% 70.64% 67.41% 44.53% 41.41% 41.05%</td></tr><tr><td>16</td><td colspan="6">72.68% 70.18% 68.34% 45.63% 41.43% 42.18%</td></tr><tr><td>20</td><td colspan="6">73.41% 71.07% 68.64% 46.26% 41.80% 41.61%</td></tr><tr><td colspan="2"># of Vertices A Plain</td><td>A Blur</td><td>A Pencil</td><td>F Plain</td><td>F Blur</td><td>F Pencil</td></tr><tr><td>4</td><td colspan="6">70.98% 67.36% 60.46% 56.07% 53.77% 50.08%</td></tr><tr><td>8</td><td colspan="6">71.89% 68.59% 61.41% 56.83% 54.87% 50.53%</td></tr><tr><td>12</td><td colspan="6">71.78% 67.26% 60.97% 56.87% 55.14% 50.86%</td></tr><tr><td>16</td><td colspan="6">71.96% 68.55% 61.14% 56.76% 54.54% 49.41%</td></tr><tr><td>20</td><td colspan="6">72.02% 68.29% 60.59% 55.95% 54.53% 50.13%</td></tr><tr><td colspan="4">G.3 DISCUSSION BETWEEN ARML AND HSML</td><td/><td/></tr></table>

Full results on Art-Multi dataset. In this table, B, T, A, F represent bird, texture, aircraft, fungi, respectively. Plain means original image.

Table content: <table><tr><td>B Plain B Blur B Pencil T Plain T Blur T Pencil A Plain A Blur A Pencil F Plain F Blur F Pencil</td><td>52.46% 51.65% 48.80% 30.03% 29.10% 28.74% 51.03% 47.89% 41.07% 42.13% 39.26% 36.20%</td><td>53.67% 50.98% 46.66% 31.37% 29.08% 28.48% 45.54% 43.94% 35.49% 37.71% 38.00% 34.36%</td><td>53.30% 51.14% 47.76% 31.56% 29.48% 29.08% 46.18% 44.50% 36.66% 37.54% 39.50% 35.46%</td><td>54.76% 52.18% 48.85% 32.03% 29.90% 30.82% 50.42% 47.59% 40.17% 41.73% 40.09% 36.27%</td><td>55.27% 52.62% 48.58% 30.57% 28.65% 28.39% 45.59% 42.24% 34.52% 39.37% 38.58% 35.38%</td><td>55.23% 53.08% 48.18% 29.28% 28.70% 28.38% 51.24% 47.29% 35.98% 41.08% 40.38% 36.30%</td><td>56.71% 52.87% 47.83% 31.02% 29.11% 29.69% 46.83% 42.68% 36.08% 40.09% 39.66% 35.51%</td><td>56.99% 54.21% 50.25% 32.13% 29.63% 29.23% 43.64% 40.08% 33.73% 43.02% 42.64% 37.96%</td><td>57.73% 53.18% 50.96% 31.88% 29.72% 29.90% 49.95% 43.36% 39.61% 42.97% 40.08% 36.52%</td><td>58.15% 53.20% 51.09% 32.01% 30.21% 30.17% 49.98% 45.79% 40.87% 42.58% 41.29% 37.01%</td><td>59.67% 54.89% 52.97% 32.31% 30.77% 31.51% 51.99% 47.92% 41.93% 44.69% 42.13% 38.36%</td><td>66.28% 65.12% 60.76% 38.85% 35.49% 33.83% 64.82% 62.73% 53.60% 51.18% 50.30% 43.54%</td><td>70.42% 67.90% 61.82% 44.78% 38.43% 38.40% 65.84% 63.41% 54.08% 51.45% 50.56% 46.33%</td><td>68.60% 68.03% 62.69% 43.41% 37.86% 38.60% 65.16% 64.29% 54.73% 53.92% 50.66% 46.69%</td><td>70.08% 69.05% 65.45% 44.93% 41.80% 40.18% 70.35% 68.56% 59.09% 56.04% 54.04% 47.85%</td><td>71.51% 68.65% 63.93% 42.96% 39.59% 38.87% 64.68% 62.54% 49.20% 54.08% 52.02% 46.39%</td><td>71.31% 68.73% 64.33% 41.89% 37.79% 37.91% 64.88% 63.36% 52.31% 53.18% 52.26% 46.43%</td><td>71.66% 68.51% 64.99% 43.18% 39.83% 39.76% 66.57% 63.33% 51.91% 53.96% 53.18% 48.21%</td><td>71.18% 69.29% 68.28% 43.23% 39.42% 39.20% 63.39% 58.29% 46.12% 54.01% 51.70% 47.02%</td><td>71.57% 70.50% 64.57% 44.57% 40.31% 40.07% 63.36% 61.55% 52.17% 54.89% 52.82% 47.79%</td><td>71.75% 69.31% 65.62% 44.68% 40.13% 41.33% 70.12% 67.63% 59.40% 55.97% 54.60% 49.40%</td><td>73.05% 71.31% 67.14% 45.32% 40.15% 41.98% 71.89% 68.59% 61.41% 56.83% 54.87% 50.53%</td></tr><tr><td>Settings Algorithms</td><td>VERSA</td><td>ProtoNet</td><td>TapNet</td><td>5-way TADAM</td><td>1-shot MAML</td><td>MetaSGD</td><td>BMAML</td><td>MT-Net</td><td>MUMOMAML</td><td>HSML</td><td>ARML</td><td>VERSA</td><td>ProtoNet</td><td>TapNet</td><td>5-way TADAM</td><td>5-shot MAML</td><td>MetaSGD</td><td>BMAML</td><td>MT-Net</td><td>MUMOMAML</td><td>HSML</td><td>ARML</td></tr></table>

Peer review (iclr2020):
This paper proposed a knowledge-based meta-learning framework, called ARML(Automated Relational Metal-Learning) that automatically extracts cross-task relations and constructs a meta-knowledge graph. ARML wanted to solve the task heterogeneity problem in meta-learning through knowledge graph learning using graph neural networks. To do this, the authors introduced a framework consisting of (1) finding a prototype-based relational structure, (2) constructing a meta-knowledge graph, and (3) adapting the task-specific knowledge. Experimental results show that the proposed algorithm outperforms other competitive algorithms in few-shot learning tasks, which is justified by experimentally showing that the learned meta-knowledge graph has a meaningful interpretation. The paper was well-motivated and well-written, which made it very interesting to read. Looking at the task heterogeneity problem of meta-learning as a knowledge graph learning problem is the most important contribution of this paper. Since then, the framework*s proposal to learn it as a graph neural network is a very natural extension, which can greatly increase the performance of existing few-shot learning tasks. The question here is whether the meta-learning method for finding relational structures through knowledge graphs is the first one proposed in this paper. The paper *Few-shot learning with graph neural networks, ICLR-2018* performed the few-shot learning task with very similar motivation. What is the difference compared to this paper? And as mentioned in the paper, HSML is the closest study to ARML in that it considers high-level relations between cross-tasks. The reviewer is very curious about the qualitative comparison of the high-level structures found by the two algorithms, and I confident that this comparison will enrich the paper.