META-LEARNING WITHOUT MEMORIZATION
Year: 2020

Abstract:
The ability to learn new concepts with small amounts of data is a critical aspect of intelligence that has proven challenging for deep learning methods. Meta-learning has emerged as a promising technique for leveraging data from previous tasks to enable efficient learning of new tasks. However, most meta-learning algorithms implicitly require that the meta-training tasks be mutually-exclusive, such that no single model can solve all of the tasks at once. For example, when creating tasks for few-shot image classification, prior work uses a per-task random assignment of image classes to N-way classification labels. If this is not done, the meta-learner can ignore the task training data and learn a single model that performs all of the meta-training tasks zero-shot, but does not adapt effectively to new image classes. This requirement means that the user must take great care in designing the tasks, for example by shuffling labels or removing task identifying information from the inputs. In some domains, this makes meta-learning entirely inapplicable. In this paper, we address this challenge by designing a meta-regularization objective using information theory that places precedence on data-driven adaptation. This causes the meta-learner to decide what must be learned from the task training data and what should be inferred from the task testing input. By doing so, our algorithm can successfully use data from non-mutually-exclusive tasks to efficiently adapt to novel tasks. We demonstrate its applicability to both contextual and gradientbased meta-learning algorithms, and apply it in practical settings where applying standard meta-learning has been difficult. Our approach substantially outperforms standard meta-learning algorithms in these settings.

heading: 1 INTRODUCTION
text: The ability to learn new concepts and skills with small amounts of data is a critical aspect of intelligence that many machine learning systems lack. Meta-learning (Schmidhuber, 1987) has emerged as a promising approach for enabling systems to quickly learn new tasks by building upon experience from previous related tasks (Thrun & Pratt, 2012; Koch et al., 2015; Santoro et al., 2016; Ravi & Larochelle, 2016; Finn et al., 2017). Meta-learning accomplishes this by explicitly optimizing for few-shot generalization across a set of meta-training tasks. The meta-learner is trained such that, after being presented with a small task training set, it can accurately make predictions on test datapoints for that meta-training task.
While these methods have shown promising results, current methods require careful design of the meta-training tasks to prevent a subtle form of task overfitting, distinct from standard overfitting in supervised learning. If the task can be accurately inferred from the test input alone, then the task training data can be ignored while still achieving low meta-training loss. In effect, the model will collapse to one that makes zero-shot decisions. This presents an opportunity for overfitting where the meta-learner generalizes on meta-training tasks, but fails to adapt when presented with training data from novel tasks. We call this form of overfitting the memorization problem in meta-learning because the meta-learner memorizes a function that solves all of the meta-training tasks, rather than learning to adapt.
Existing meta-learning algorithms implicitly resolve this problem by carefully designing the metatraining tasks such that no single model can solve all tasks zero-shot; we call tasks constructed in this
Implementation and examples available here: https://github.com/google-research/ google-research/tree/master/meta_learning_without_memorization.
way mutually-exclusive. For example, forN -way classification, each task consists of examples from N randomly sampled classes. The N classes are labeled from 1 to N , and critically, for each task, we randomize the assignment of classes to labels {1, 2, . . . , N} (visualized in Appendix Figure 3). This ensures that the task-specific class-to-label assignment cannot be inferred from a test input alone. However, the mutually-exclusive tasks requirement places a substantial burden on the user to cleverly design the meta-training setup (e.g., by shuffling labels or omitting goal information). While shuffling labels provides a reasonable mechanism to force tasks to be mutually-exclusive with standard few-shot image classification datasets such as MiniImageNet (Ravi & Larochelle, 2016), this solution cannot be applied to all domains where we would like to utilize meta-learning. For example, consider meta-learning a pose predictor that can adapt to different objects: even if N different objects are used for meta-training, a powerful model can simply learn to ignore the training set for each task, and directly learn to predict the pose of each of the N objects. However, such a model would not be able to adapt to new objects at meta-test time.
The primary contributions of this work are: 1) to identify and formalize the memorization problem in meta-learning, and 2) to propose a meta-regularizer (MR) using information theory as a general approach for mitigating this problem without placing restrictions on the task distribution. We formally differentiate the meta-learning memorization problem from overfitting problem in conventional supervised learning, and empirically show that naı̈ve applications of standard regularization techniques do not solve the memorization problem in meta-learning. The key insight of our metaregularization approach is that the model acquired when memorizing tasks is more complex than the model that results from task-specific adaptation because the memorization model is a single model that simultaneously performs well on all tasks. It needs to contain all information in its weights needed to do well on test points without looking at training points. Therefore we would expect the information content of the weights of a memorization model to be larger, and hence the model should be more complex. As a result, we propose an objective that regularizes the information complexity of the meta-learned function class (motivated by Alemi et al. (2016); Achille & Soatto (2018)). Furthermore, we show that meta-regularization in MAML can be rigorously motivated by a PAC-Bayes bound on generalization. In a series of experiments on non-mutually-exclusive task distributions entailing both few-shot regression and classification, we find that memorization poses a significant challenge for both gradient-based (Finn et al., 2017) and contextual (Garnelo et al., 2018a) meta-learning methods, resulting in near random performance on test tasks in some cases. Our meta-regularization approach enables both of these methods to achieve efficient adaptation and generalization, leading to substantial performance gains across the board on non-mutually-exclusive tasks.

heading: 2 PRELIMINARIES
text: We focus on the standard supervised meta-learning problem (see, e.g., Finn et al. (2017)). Briefly, we assume tasks Ti are sampled from a task distribution p(T ). During meta-training, for each task, we observe a set of training data Di = (xi,yi) and a set of test data D∗i = (x∗i ,y∗i ) with xi = (xi1, . . . , xiK),yi = (yi1, . . . , yiK) sampled from p(x, y|Ti), and similarly forD∗i . We denote the entire meta-training set asM = {Di,D∗i }Ni=1. The goal of meta-training is to learn a model for a new task T by leveraging what is learned during meta-training and a small amount of training data for the new task D. We use θ to denote the meta-parameters learned during meta-training and use φ to denote the task-specific parameters that are computed based on the task training data.
Following Grant et al. (2018); Gordon et al. (2018), given a meta-training set M, we consider meta-learning algorithms that maximize conditional likelihood q(ŷ∗ = y∗|x∗, θ,D), which is composed of three distributions: q(θ|M) that summarizes meta-training data into a distribution on metaparameters, q(φ|D, θ) that summarizes the per-task training set into a distribution on task-specific parameters, and q(ŷ∗|x∗, φ, θ) that is the predictive distribution. These distributions are learned to minimize
− 1N ∑ i Eq(θ|M)q(φ|Di,θ) [ 1 K ∑ (x∗,y∗)∈D∗i log q(ŷ∗ = y∗|x∗, φ, θ) ] . (1)
For example, in MAML (Finn et al., 2017), θ and φ are the weights of a predictor network, q(θ|M) is a delta function learned over the meta-training data, q(φ|D, θ) is a delta function centered at a point defined by gradient optimization, and φ parameterizes the predictor network q(ŷ∗|x∗, φ) (Grant et al., 2018). In particular, to determine the task-specific parameters φ, the task training data D and θ are used in the predictor model φ = θ + αK ∑ (x,y)∈D∇θ log q(y|x, φ = θ).
Another family of meta-learning algorithms are contextual methods (Santoro et al., 2016), such as conditional neural processes (CNP) (Garnelo et al., 2018b;a). CNP instead defines q(φ|D, θ) as a mapping from D to a summary statistic φ (parameterized by θ). In particular, φ = aθ ◦ hθ(D) is the output of an aggregator aθ(·) applied to features hθ(D) extracted from the task training data. Then θ parameterizes a predictor network that takes φ and x∗ as input and produces a predictive distribution q(ŷ∗|x∗, φ, θ). In the following sections, we describe a common pitfall for a variety of meta-learning algorithms, including MAML and CNP, and a general meta-regularization approach to prevent this pitfall.

heading: 3 THE MEMORIZATION PROBLEM IN META-LEARNING
text: The ideal meta-learning algorithm will learn in such a way that generalizes to novel tasks. However, we find that unless tasks are carefully designed, current meta-learning algorithms can overfit to the tasks and end up ignoring the task training data (i.e., either q(φ|D, θ) does not depend on D or q(ŷ∗|x∗, φ, θ) does not depend on φ, as shown in Figure 1), which can lead to poor generalization. This memorization phenomenon is best understood through examples.
Consider a 3D object pose prediction problem (illustrated in Figure 1), where each object has a fixed canonical pose. The (x, y) pairs for the task are 2D grey-scale images of the rotated object (x) and the rotation angle relative to the fixed canonical pose for that object (y). In the most extreme case, for an unseen object, the task is impossible without using D because the canonical pose for the unseen object is unknown. The number of objects in the meta-training dataset is small, so it is straightforward for a single network to memorize the canonical pose for each training object and to infer the object from the input image (i.e., task overfitting), thus achieving a low training error without using D. However, by construction, this solution will necessarily have poor generalization to test tasks with unseen objects.
As another example, imagine an automated medical prescription system that suggests medication prescriptions to doctors based on patient symptoms and the patient’s previous record of prescription responses (i.e., medical history) for adaptation. In the meta-learning framework, each patient represents a separate task. Here, the symptoms and prescriptions have a close relationship, so we cannot assign random prescriptions to symptoms, in contrast to the classification tasks where we can randomly shuffle the labels to create mutually-exclusiveness. For this non-mutually-exclusive task distribution, a standard meta-learning system can memorize the patients’ identity information in the training, leading it to ignore the medical history and only utilize the symptoms combined with the memorized information. As a result, it may issue highly accurate prescriptions on the meta-training set, but fail to adapt to new patients effectively. While such a system would achieve a baseline level of accuracy for new patients, it would be no better than a standard supervised learning method applied to the pooled data.
We formally define (complete) memorization as: Definition 1 (Complete Meta-Learning Memorization). Complete memorization in meta-learning is when the learned model ignores the task training data such that I(ŷ∗;D|x∗, θ) = 0 (i.e., q(ŷ∗|x∗, θ,D) = q(ŷ∗|x∗, θ) = ED′|x∗ [q(ŷ∗|x∗, θ,D′)]).
Memorization describes an issue with overfitting the meta-training tasks, but it does not preclude the network from generalizing to unseen (x, y) pairs on the tasks similar to the training tasks. Memorization becomes an undesired problem for generalization to new tasks when I(y∗;D|x∗) I(ŷ∗;D|x∗, θ) (i.e., the task training data is necessary to achieve good performance, even with exact inference under the data generating distribution, to make accurate predictions).
A model with the memorization problem may generalize to new datapoints in training tasks but cannot generalize to novel tasks, which distinguishes it from typical overfitting in supervised learning. In practice, we find that MAML and CNP frequently converge to this memorization solution (Table 2). For MAML, memorization can occur when a particular setting of θ that does not adapt to the task training data can achieve comparable meta-training error to a solution that adapts θ. For example, if a setting of θ can solve all of the meta-training tasks (i.e., for all (x, y) in D and D∗ the predictive error is close to zero), the optimization may converge to a stationary point of the MAML objective where minimal adaptation occurs based on the task training set (i.e., φ ≈ θ). For a novel task where it is necessary to use the task training data, MAML can in principle still leverage the task training data because the adaptation step is based on gradient descent. However, in practice, the
poor initialization of θ can affect the model’s ability to generalize from a small mount of data. For CNP, memorization can occur when the predictive distribution network q(ŷ∗|x∗, φ, θ) can achieve low training error without using the task training summary statistics φ. On a novel task, the network is not trained to use φ, so it is unable to use the information extracted from the task training set to effectively generalize.
In some problem domains, the memorization problem can be avoided by carefully constructing the tasks. For example, for N -way classification, each task consists of examples from N randomly sampled classes. If the classes are assigned to a random permutation ofN for each task, this ensures that the task-specific class-to-label assignment cannot be inferred from the test inputs alone. As a result, a model that ignores the task training data cannot achieve low training error, preventing convergence to the memorization problem. We refer to tasks constructed in this way as mutuallyexclusive. However, the mutually-exclusive tasks requirement places a substantial burden on the user to cleverly design the meta-training setup (e.g., by shuffling labels or omitting goal information) and cannot be applied to all domains where we would like to utilize meta-learning.

heading: 4 META REGULARIZATION USING INFORMATION THEORY
text: At a high level, the sources of information in the predictive distribution q(ŷ∗|x∗, θ,D) come from the input, the meta-parameters, and the data. The memorization problem occurs when the model encodes task information in the predictive network that is readily available from the task training set (i.e., it memorizes the task information for each meta-training task). We could resolve this problem by encouraging the model to minimize the training error and to rely on the task training dataset as much as possible for the prediction of y∗ (i.e., to maximize I(ŷ∗;D|x∗, θ)). Explicitly maximizing I(ŷ∗;D|x∗, θ) requires an intractable marginalization over task training sets to compute q(ŷ∗|x∗, θ). Instead, we can implicitly encourage it by restricting the information flow from other sources (x∗ and θ) to ŷ∗. To achieve both low error and low mutual information between ŷ∗ and (x∗, θ), the model must use task training data D to make predictions, hence increasing the mutual information I(ŷ∗;D|x∗, θ), leading to reduced memorization. In this section, we describe two tractable ways to achieve this.

heading: 4.1 META REGULARIZATION ON ACTIVATIONS
text: Given θ, the statistical dependency between x∗ and ŷ∗ is controlled by the direct path from x∗ to ŷ∗ and the indirect path through D (see Figure 1), where the latter is desirable because it leverages the task training data. We can control the information flow between x∗ and ŷ∗ by introducing an intermediate stochastic bottleneck variable z∗ such that q(ŷ∗|x∗, φ, θ) =∫ q(ŷ∗|z∗, φ, θ)q(z∗|x∗, θ) dz∗ (Alemi et al., 2016) as shown in Figure 4. Now, we would like
to maximize I(ŷ∗;D|z∗, θ) to prevent memorization. We can bound this mutual information by
I(ŷ∗;D|z∗, θ) ≥I(x∗; ŷ∗|θ, z∗) = I(x∗; ŷ∗|θ)− I(x∗; z∗|θ) + I(x∗; z∗|ŷ∗, θ) ≥I(x∗; ŷ∗|θ)− I(x∗; z∗|θ)
=I(x∗; ŷ∗|θ)− Ep(x∗)q(z∗|x∗,θ) [ log
q(z∗|x∗, θ) q(z∗|θ) ] ≥I(x∗; ŷ∗|θ)− E [ log
q(z∗|x∗, θ) r(z∗)
] = I(x∗; ŷ∗|θ)− E [DKL(q(z∗|x∗, θ)||r(z∗))] (2)
where r(z∗) is a variational approximation to the marginal, the first inequality follows from the statistical dependencies in our model (see Figure 4 and Appendix A.2 for the proof). By simultaneously minimizing E [DKL(q(z∗|x∗, θ)||r(z∗))] and maximizing the mutual information I(x∗; ŷ∗|θ), we can implicitly encourage the model to use the task training data D. For non-mutually-exclusive problems, the true label y∗ is dependent on x∗. If the model has the memorization problem and I(x∗; ŷ∗|θ) = 0, then q(ŷ∗|x∗, θ,D) = q(ŷ∗|x∗, θ) = q(ŷ∗|θ), which means the model predictions do not depend on x∗ orD. Hence, in practical problems, the predictions generated from the model will have low accuracy.
This suggests minimizing the training loss in Eq. (1) can increase I(ŷ∗;D|x∗, θ) or I(x∗; ŷ∗|θ). Replacing the maximization of I(x∗; ŷ∗|θ) in Eq. (2) with minimizing the training loss results in the following regularized training objective
1 N ∑ i Eq(θ|M)q(φ|Di,θ) [ − 1K
∑ (x∗,y∗)∈D∗i log q(ŷ∗ = y∗|x∗, φ, θ) + βDKL(q(z∗|x∗, θ)||r(z∗)) ] (3)
where log q(ŷ∗|x∗, φ, θ) is estimated by log q(ŷ∗|z∗, φ, θ) with z∗ ∼ q(z∗|x∗, θ), β modulates the regularizer and r(z∗) can be set as N (z∗; 0, I). We refer to this regularizer as meta-regularization (MR) on the activations.
As we demonstrate in Section 6, we find that this regularizer performs well, but in some cases can fail to prevent the memorization problem. Our hypothesis is that in these cases, the network can sidestep the information constraint by storing the prediction of y∗ in a part of z∗, which incurs a small penalty in Eq. (3) and small lower bound in Eq. (2).

heading: 4.2 META REGULARIZATION ON WEIGHTS
text: Alternatively, we can penalize the task information stored in the meta-parameters θ. Here, we provide an informal argument and provide the complete argument in Appendix A.3. Analogous to the supervised setting (Achille & Soatto, 2018), given meta-training dataset M, we consider θ as random variable where the randomness can be introduced by training stochasticity. We model the stochasticity over θ with a Gaussian distribution N (θ; θµ, θσ) with learned mean and variance parameters per dimension (Blundell et al., 2015; Achille & Soatto, 2018). By penalizing I(y∗1:N ,D1:N ; θ|x∗1:N ), we can limit the information about the training tasks stored in the metaparameters θ and thus require the network to use the task training data to make accurate predictions. We can tractably upper bound it by
I(y∗1:N ,D1:N ; θ|x∗1:N ) = E [ log q(θ|M)q(θ|x∗1:N ) ] ≤ E [DKL (q(θ|M)‖r(θ))] , (4)
where r(θ) is a variational approximation to the marginal, which we set to N (θ; 0, I). In practice, we apply meta-regularization to the meta-parameters θ that are not used to adapt to the task training data and denote the other parameters as θ̃. In this way, we control the complexity of the network that can predict the test labels without using task training data, but we do not limit the complexity of the network that processes the task training data. Our final meta-regularized objective can be written as
1 N ∑ i Eq(θ;θµ,θσ)q(φ|Di,θ̃) [ − 1K
∑ (x∗,y∗)∈D∗i log q(ŷ∗ = y∗|x∗, φ, θ, θ̃) + βDKL(q(θ; θµ, θσ)||r(θ)) ] (5)
For MAML, we apply meta-regularization to the parameters uninvolved in the task adaptation. For CNP, we apply meta-regularization to the encoder parameters. The detailed algorithms are shown in Algorithm 1 and 2 in the appendix.

heading: 4.3 DOES META REGULARIZATION LEAD TO BETTER GENERALIZATION?
text: Now that we have derived meta regularization approaches for mitigating the memorization problem, we theoretically analyze whether meta regularization leads to better generalization via a PAC-Bayes bound. In particular, we study meta regularization (MR) on the weights (W) of MAML, i.e. MRMAML (W), as a case study.
Meta regularization on the weights of MAML uses a Gaussian distribution N (θ; θµ, θσ) to model the stochasticity in the weights. Given a task and task training data, the expected error is given by
er(θµ, θσ,D, T ) = Eθ∼N (θ;θµ,θσ),φ∼q(φ|θ,D),(x∗,y∗)∼p(x,y|T ) [L(x ∗, y∗, φ)] , (6)
where the prediction loss L(x∗, y∗, φi) is bounded1. Then, we would like to minimize the error on novel tasks
er(θµ, θσ) = ET ∼p(T ),D∼p(x,y|T ) [er(θµ, θσ,D, T )] (7)
We only have a finite sample of training tasks, so computing er(Q) is intractable, but we can form an empirical estimate:
êr(θµ, θσ,D1,D∗1 , ...,Dn,D∗n)
= 1
n n∑ i=1 Eθ∼N (θ;θµ,θσ),φi∼q(φ|θ,Di) − 1 K ∑ (x∗,y∗)∈D∗i log q(ŷ∗ = y∗|x∗, φi)  ︸ ︷︷ ︸
êr(θµ,θσ,Di,D∗i )
(8)
where for exposition we have assumed |D∗i | = K are the same for all tasks. We would like to relate er(θµ, θσ) and êr(θµ, θσ,D1,D∗1 , ...,Dn,D∗n), but the challenge is that θµ and θσ are derived from the meta-training tasks D1,D∗1 , ...,Dn,D∗n. There are two sources of generalization error: (i) error due to the finite number of observed tasks and (ii) error due to the finite number of examples observed per task. Closely following the arguments in (Amit & Meir, 2018), we apply a standard PAC-Bayes bound to each of these and combine the results with a union bound, resulting in the following Theorem. Theorem 1. Let P (θ) be an arbitrary prior distribution over θ that does not depend on the metatraining data. Then for any δ ∈ (0, 1], with probability at least 1− δ, the following inequality holds uniformly for all choices of θµ and θσ ,
er(θµ, θσ) ≤ 1
n n∑ i=1
êr(θµ, θσ,Di,D∗i )+(√ 1
2(K − 1) +
√ 1
2(n− 1)
)√ DKL(N (θ; θµ, θσ)‖P ) + log n(K + 1)
δ , (9)
where n is the number of meta-training tasks and K is the number of per-task validation datapoints.
We defer the proof to the Appendix A.4. The key difference from the result in (Amit & Meir, 2018) is that we leverage the fact that the task training data is split into training and validation.
In practice, we set P (θ) = r(θ) = N (θ; 0, I). If we can achieve a low value for the bound, then with high probability, our test error will also be low. As shown in the Appendix A.4, by a first order Taylor expansion of the the second term of the RHS in Eq.(9) and setting the coefficient of the KL term as β = √ 1/2(K−1)+ √
1/2(n−1) 2 √ logn(K+1)/δ , we recover the MR-MAML(W) objective (Eq.(5)). β trades-
off between the tightness of the generalization bound and the probability that it holds true. The result of this bound suggests that the proposed meta-regularization on weights does indeed improve generalization on the meta-test set.
1In practice, L(x∗, y∗, φi) is MSE on a bounded target space or classification accuracy. We optimize the negative log-likelihood as a bound on the 0-1 loss.

heading: 5 RELATED WORK
text: Previous works have developed approaches for mitigating various forms of overfitting in metalearning. These approaches aim to improve generalization in several ways: by reducing the number of parameters that are adapted in MAML (Zintgraf et al., 2019), by compressing the task embedding (Lee et al., 2019), through data augmentation from a GAN (Zhang et al., 2018), by using an auxiliary objective on task gradients (Guiroy et al., 2019), and via an entropy regularization objective (Jamal & Qi, 2019). These methods all focus on the setting with mutually-exclusive task distributions. We instead recognize and formalize the memorization problem, a particular form of overfitting that manifests itself with non-mutually-exclusive tasks, and offer a general and principled solution. Unlike prior methods, our approach is applicable to both contextual and gradientbased meta-learning methods. We additionally validate that prior regularization approaches, namely TAML (Jamal & Qi, 2019), are not effective for addressing this problem setting.
Our derivation uses a Bayesian interpretation of meta-learning (Tenenbaum, 1999; Fei-Fei et al., 2003; Edwards & Storkey, 2016; Grant et al., 2018; Gordon et al., 2018; Finn et al., 2018; Kim et al., 2018; Harrison et al., 2018). Some Bayesian meta-learning approaches place a distributional loss on the inferred task variables to constrain them to a prior distribution (Garnelo et al., 2018b; Gordon et al., 2018; Rakelly et al., 2019), which amounts to an information bottleneck on the latent task variables. Similarly Zintgraf et al. (2019); Lee et al. (2019); Guiroy et al. (2019) aim to produce simpler or more compressed task adaptation processes. Our approach does the opposite, penalizing information from the inputs and parameters, to encourage the task-specific variables to contain greater information driven by the per-task data.
We use PAC-Bayes theory to study the generalization error of meta-learning and meta-regularization. Pentina & Lampert (2014) extends the single task PAC-Bayes bound (McAllester, 1999) to the multitask setting, which quantifies the gap between empirical error on training tasks and the expected error on new tasks. More recent research shows that, with tightened generalization bounds as the training objective, the algorithms can reduce the test error for mutually-exclusive tasks (Galanti et al., 2016; Amit & Meir, 2018). Our analysis is different from these prior works in that we only include preupdate meta parameters in the generalization bound rather than both pre-update and post-update parameters. In the derivation, we also explicitly consider the splitting of data into the task training set and task validation set, which is aligned with the practical setting.
The memorization problem differs from overfitting in conventional supervised learning in several aspects. First, memorization occurs at the task level rather than datapoint level and the model memorizes functions rather than labels. In particular, within a training task, the model can generalize to new datapoints, but it fails to generalize to new tasks. Second, the source of information for achieving generalization is different. For meta-learning the information is from both the meta-training data and new task training data but in standard supervised setting the information is only from training data. Finally, the aim of regularization is different. In the conventional supervised setting, regularization methods such as weight decay (Krogh & Hertz, 1992), dropout (Srivastava et al., 2014), the information bottleneck (Tishby et al., 2000; Tishby & Zaslavsky, 2015), and Bayes-by-Backprop (Blundell et al., 2015) are used to balance the network complexity and the information in the data. The aim of meta-regularization is different. It governs the model complexity to avoid one complex model solving all tasks, while allowing the model’s dependency on the task data to be complex. We further empirically validate this difference, finding that standard regularization techniques do not solve the memorization problem.

heading: 6 EXPERIMENTS
text: In the experimental evaluation, we aim to answer the following questions: (1) How prevalent is the memorization problem across different algorithms and domains? (2) How does the memorization problem affect the performance of algorithms on non-mutually-exclusive task distributions? (3) Is our meta-regularization approach effective for mitigating the problem and is it compatible with multiple types of meta-learning algorithms? (4) Is the problem of memorization empirically distinct from that of the standard overfitting problem?
To answer these questions, we propose several meta-learning problems involving non-mutuallyexclusive task distributions, including two problems that are adapted from prior benchmarks with mutually-exclusive task distributions. We consider model-agnostic meta-learning (MAML) and conditional neural processes (CNP) as representative meta-learning algorithms. We study both variants
of our method in combination with MAML and CNP. When comparing with meta-learning algorithms with and without meta-regularization, we use the same neural network architecture, while other hyperparameters are tuned via cross-validation per-problem.

heading: 6.1 SINUSOID REGRESSION
text: First, we consider a toy sinusoid regression problem that is non-mutually-exclusive. The data for each task is created in the following way: the amplitude A of the sinusoid is uniformly sampled from a set of 20 equally-spaced points {0.1, 0.3, · · · , 4}; u is sampled uniformly from [−5, 5] and y is sampled fromN (A sin(u), 0.12). We provide both u and the amplitude A (as a one-hot vector) as input, i.e. x = (u,A). At the test time, we expand the range of the tasks by randomly sampling the data-generating amplitude A uniformly from [0.1, 4] and use a random one-hot vector for the input to the network. The meta-training tasks are a proper subset of the meta-test tasks.
Without the additional amplitude input, both MAML and CNP can easily solve the task and generalize to the meta-test tasks. However, once we add the additional amplitude input which indicates the task identity, we find that both MAML and CNP converge to the complete memorization solution and fail to generalize well to test data (Table 1 and Appendix Figures 7 and 8). Both meta-regularized MAML and CNP (MR-MAML) and (MR-CNP) instead converge to a solution that adapts to the data, and as a result, greatly outperform the unregularized methods.

heading: 6.2 POSE PREDICTION
text: To illustrate the memorization problem on a more realistic task, we create a multi-task regression dataset based on the Pascal 3D data (Xiang et al., 2014) (See Appendix A.5.1 for a complete description). We randomly select 50 objects for meta-training and the other 15 objects for meta-testing. For each object, we use MuJoCo (Todorov et al., 2012) to render images with random orientations of the instance on a table, visualized in Figure 1. For the meta-learning algorithm, the observation (x) is the 128×128 gray-scale image and the label (y) is the orientation relative to a fixed canonical pose. Because the number of objects in the meta-training dataset is small, it is straightforward for a single network to memorize the canonical pose for each training object and to infer the orientation from the input image, thus achieving a low meta-training error without using D. However, this solution performs poorly at the test time because it has not seen the novel objects and their canonical poses.
Optimization modes and hyperparameter sensitivity. We choose the learning rate from {0.0001, 0.0005, 0.001} for each method, β from {10−6, 10−5, · · · , 1} for meta-regularization and report the results with the best hyperparameters (as measured on the meta-validation set) for each method. In this domain, we find that the convergence point of the meta-learning algorithm is determined by both the optimization landscape of the objective and the training dynamics, which vary due to stochastic gradients and the random initialization. In particular, we observe that there are two modes of the objective, one that corresponds to complete memorization and one that corresponds to successful adaptation to the task data. As illustrated in the Appendix, we find that models that converge to a memorization solution have lower training error than solutions which use the task training data, indicating a clear need for meta-regularization. When the meta-regularization is on the activations, the solution that the algorithms converge to depends on the learning rate, while MR on the weights consistently converges to the adaptation solution (See Appendix Figure 9 for the sensitivity analysis). This suggests that MR on the activations is not always successful at preventing memorization. Our hypothesis is that there exists a solution in which the bottlenecked activations encode only the prediction y∗, and discard other information. Such a solution can achieve both low training MSE and low regularization loss without using task training data, particularly if the predicted label contains a small number of bits (i.e., because the activations will have low information complexity).
However, note that this solution does not achieve low regularization error when applying MR to the weights because the function needed to produce the predicted label does not have low information complexity. As a result, meta-regularization on the weights does not suffer from this pathology and is robust to different learning rates. Therefore, we will use regularization on weights as the proposed methodology in the following experiments and algorithms in Appendix A.1.
Quantitative results. We compare MAML and CNP with their meta-regularized versions (Table 2). We additionally include fine-tuning as baseline, which trains a single network on all the instances jointly, and then fine-tunes on the task training data. Meta-learning with meta-regularization (on weights) outperforms all competing methods by a large margin. We show test error as a function of the meta-regularization coefficient β in Appendix Figure 2. The curve reflects the trade-off when changing the amount of information contained in the weights. This indicates that β gives a knob that allows us to tune the degree to which the model uses the data to adapt versus relying on the prior.
Comparison to standard regularization. We compare our meta-regularization with standard regularization techniques, weight decay (Krogh & Hertz, 1992) and Bayes-by-Backprop (Blundell et al., 2015), in Table 3. We observe that simply applying standard regularization to all the weights, as in conventional supervised learning, does not solve the memorization problem, which validates that the memorization problem differs from the standard overfitting problem.

heading: 6.3 OMNIGLOT AND MINIIMAGENET CLASSIFICATION
text: Next, we study memorization in the few-shot classification problem by adapting the few-shot Omniglot (Lake et al., 2011) and MiniImagenet (Ravi & Larochelle, 2016; Vinyals et al., 2016) bench-
marks to the non-mutually-exclusive setting. In the non-mutually-exclusive N-way K-shot classification problem, each class is (randomly) assigned a fixed classification label from 1 to N. For each task, we randomly select a corresponding class for each classification label and K task training data points and K task test data points from that class2. This ensures that each class takes only one classification label across tasks and different tasks are non-mutually-exclusive (See Appendix A.5.2 for details).
We evaluate MAML, TAML (Jamal & Qi, 2019), MR-MAML (ours), fine-tuning, and a nearest neighbor baseline on non-mutually-exclusive classification tasks (Table 4). We find that MR-MAML significantly outperforms previous methods on all of these tasks. To better understand the problem, for the MAML variants, we calculate the pre-update accuracy (before adaptation on the task training data) on the meta-training data in Appendix Table 5. The high pre-update meta-training accuracy and low meta-test accuracy are evidence of the memorization problem for MAML and TAML, indicating that it is learning a model that ignores the task data. In contrast, MR-MAML successfully controls the pre-update accuracy to be near chance and encourages the learner to use the task training data to achieve low meta-training error, resulting in good performance at meta-test time.
Finally, we verify that meta-regularization does not degrade performance on the standard mutuallyexclusive task. We evaluate performance as a function of regularization strength on the standard 20-way 1-shot Omniglot task (Appendix Figure 10), and we find that small values of β lead to slight improvements over MAML. This indicates that meta-regularization substantially improves performance in the non-mutually-exclusive setting without degrading performance in other settings.

heading: 7 CONCLUSION AND DISCUSSION
text: Meta-learning has achieved remarkable success in few-shot learning problems. However, we identify a pitfall of current algorithms: the need to create task distributions that are mutually exclusive. This requirement restricts the domains that meta-learning can be applied to. We formalize the failure mode, i.e. the memorization problem, that results from training on non-mutually-exclusive tasks and distinguish it as a function-level overfitting problem compared to the the standard label-level overfitting in supervised learning.
We illustrate the memorization problem with different meta-learning algorithms on a number of domains. To address the problem, we propose an algorithm-agnostic meta-regularization (MR) approach that leverages an information-theoretic perspective of the problem. The key idea is that by placing a soft restriction on the information flow from meta-parameters in prediction of test set labels, we can encourage the meta-learner to use task training data during meta-training. We achieve this by successfully controlling the complexity of model prior to the task adaptation.
The memorization issue is quite broad and is likely to occur in a wide range of real-world applications, for example, personalized speech recognition systems, learning robots that can adapt to different environments (Nagabandi et al., 2018), and learning goal-conditioned manipulation skills using trial-and-error data. Further, this challenge may also be prevalent in other conditional prediction problems, beyond meta-learning, an interesting direction for future study. By both recognizing the challenge of memorization and developing a general and lightweight approach for solving it, we believe that this work represents an important step towards making meta-learning algorithms applicable to and effective on any problem domain.
2We assume that the number of classes in the meta-training set is larger than N .

heading: ACKNOWLEDGEMENT
text: The authors would like to thank Alexander A. Alemi, Kevin Murphy, Luke Metz, Abhishek Kumar and the anonymous reviewers for helpful discussions and feedback. M. Yin and M. Zhou acknowledge the support of the U.S. National Science Foundation under Grant IIS-1812699.

heading: A APPENDIX

heading: A.1 ALGORITHM
text: We present the detailed algorithm for meta-regularization on weights with conditional neural processes (CNP) in Algorithm 1 and with model-agnostic meta-learning (MAML) in Algorithm 2. For CNP, we add the regularization on the weights θ of encoder and leave other weights θ̃ unrestricted. For MAML, we similarly regularize the weights θ from input to an intermediate hidden layer and leave the weights θ̃ for adaptation unregularized. In this way, we restrict the complexity of the pre-adaptation model not the post-adaptation model.
Algorithm 1: Meta-Regularized CNP input : Task distribution p(T ); Encoder weights distribution q(θ; τ) = N (θ; τ) with Gaussian
parameters τ = (θµ, θσ); Prior distribution r(θ) and Lagrangian multiplier β; θ̃ that parameterizes feature extractor hθ̃(·) and decoder Tθ̃(·). Stepsize α.
output: Network parameter τ , θ̃.
Initialize τ , θ̃ randomly; while not converged do
Sample a mini-batch of {Ti} from p(T ); Sample θ ∼ q(θ; τ) with reparameterization ; for all Ti ∈ {Ti} do
Sample Di = (xi,yi), D∗i = (x∗i ,y∗i ) from Ti ; Encode observation zi = gθ(xi), z∗i = gθ(x ∗ i ) ;
Compute task context φi = a(hθ̃(zi,yi)) with aggregator a(·); Update θ̃ ← θ̃ + α∇θ̃ ∑ Ti log q(y ∗ i |Tθ̃(z∗i , φi)) ;
Update τ ← τ + α∇τ [ ∑ Ti log q(y ∗ i |Tθ̃(z∗i , φi))− βDKL(q(θ; τ)||r(θ))]
Algorithm 2: Meta-Regularized MAML input : Task distribution p(T ); Weights distribution q(θ; τ) = N (θ; τ) with Gaussian parameters τ = (θµ, θσ); Prior distribution r(θ) and Lagrangian multiplier β; Stepsize α, α′. output: Network parameter τ , θ̃.
Initialize τ , θ̃ randomly; while not converged do
Sample a mini-batch of {Ti} from p(T ); Sample θ ∼ q(θ; τ) with reparameterization ; for all Ti ∈ {Ti} do
Sample Di = (xi,yi), D∗i = (x∗i ,y∗i ) from Ti ; Encode observation zi = gθ(xi), z∗i = gθ(x ∗ i ) ;
Compute task specific parameter φi = θ̃ + α′∇θ̃ log q(yi|zi, θ̃) ; Update θ̃ ← θ̃ + α∇θ̃ ∑ Ti log q(y ∗ i |z∗i , φi) ;
Update τ ← τ + α∇τ [ ∑ Ti log q(y ∗ i |z∗i , φi)− βDKL(q(θ; τ)||r(θ))]
Algorithm 3: Meta-Regularized Methods in Meta-testing input : Meta-testing task T with training data D = (x,y) and testing input x∗, optimized
parameters τ, θ̃. output: Prediction ŷ∗
for k from 1 to K do Sample θk ∼ q(θ; τ); Encode observation zk = gθk(x), z ∗ k = gθk(x
∗) ; Compute task specific parameter φk = a(hθ̃(zk,y)) for MR-CNP and φk = θ̃ + α
′∇θ̃ log q(y|zk, θ̃) for MR-MAML; Predict ŷ∗k ∼ q(ŷ∗|z∗k, φk, θ̃)
Return prediction ŷ∗ = 1K ∑K k=1 ŷ ∗ k

heading: A.2 META REGULARIZATION ON ACTIVATIONS
text: We show that I(x∗; ŷ∗|z∗, θ) ≤ I(ŷ∗;D|z∗, θ). By Figure 4, we have that I(ŷ∗;x∗|θ,D, z∗) = 0. By the chain rule of mutual information we have
I(ŷ∗;D|z∗, θ) =I(ŷ∗;D|z∗, θ) + I(ŷ∗;x∗|D, θ, z∗) =I(ŷ∗;x∗,D|θ, z∗) =I(x∗; ŷ∗|θ, z∗) + I(ŷ∗;D|x∗, θ, z∗) ≥I(x∗; ŷ∗|θ, z∗) (10)

heading: A.3 META REGULARIZATION ON WEIGHTS
text: Similar to (Achille & Soatto, 2018), we use ξ to denote the unknown parameters of the true data generating distribution. This defines a joint distribution p(ξ,M, θ) = p(ξ)p(M|ξ)q(θ|M). Furthermore, we have a predictive distribution q(ŷ∗|x∗,D, θ) = Eφ|θ,D [q(ŷ∗|x∗, φ, θ)].
The meta-training loss in Eq. 1 is an upper bound for the cross entropy Hp,q(y∗1:N |x∗1:N ,D1:N , θ). Using an information decomposition of cross entropy (Achille & Soatto, 2018), we have
Hp,q(y ∗ 1:N |x∗1:N ,D1:N , θ) = H(y∗1:N |x∗1:N ,D1:N , ξ) + I(ξ; y∗1:N |x∗1:N ,D1:N , θ) + E [DKL(p(y∗1:N |x∗1:N ,D1:N , θ)||q(y∗1:N |x∗1:N ,D1:N , θ))] + I(D1:N ; θ|x∗1:N , ξ) − I(y∗1:N ,D1:N ; θ|x∗1:N , ξ). (11)
Here the only negative term is the I(y∗1:N ,D1:N ; θ|x∗1:N , ξ), which quantifies the information that the meta-parameters contain about the meta-training data beyond what can be inferred from the data generating parameters (i.e., memorization). Without proper regularization, the cross entropy loss can be minimized by maximizing this term. We can control its value by upper bounding it
I(y∗1:N ,D1:N ; θ|x∗1:N , ξ) = E [ log
q(θ|M, ξ) q(θ|x∗1:N , ξ) ] = E [ log
q(θ|M) q(θ|x∗1:N , ξ) ] = E [DKL(q(θ|M)||q(θ|x∗1:N , ξ))] ≤ E [DKL(q(θ|M)||r(θ))] ,
where the second equality follows because θ and ξ are conditionally independent given M. This gives the regularization in Section 4.2.

heading: A.4 PROOF OF THE PAC-BAYES GENERALIZATION BOUND
text: First, we prove a more general result and then specialize it. The goal of the meta-learner is to extract information about the meta-training tasks and the test task training data to serve as a prior for test examples from the novel task. This information will be in terms of a distribution Q over possible models. When learning a new task, the meta-learner uses the training task data D and a model
parameterized by θ (sampled from Q(θ)) and outputs a distribution q(φ|D, θ) over models. Our goal is to learn Q such that it performs well on novel tasks.
To formalize this, define
er(Q,D, T ) = Eθ∼Q(θ),φ∼q(φ|θ,D),(x∗,y∗)∼p(x,y|T ) [L(φ(x∗), y∗)] (12)
where L(φ(x∗), y∗) is a bounded loss in [0, 1]. Then, we would like to minimize the error on novel tasks
er(Q) = min Q
ET ∼p(T ),D∼p(x,y|T ) [er(Q,D, T )] (13)
Because we only have a finite training set, computing er(Q) is intractable, but we can form an empirical estimate:
êr(Q,D1,D∗1 , ...,Dn,D∗n) = 1
n n∑ i=1 Eθ∼Q(θ),φi∼q(φ|θ,Di)  1 K ∑ (x∗,y∗)∈D∗i L(φ(x∗), y∗))  ︸ ︷︷ ︸
êr(Q,Di,D∗i )
(14)
where for exposition we assume K = |D∗i | is the same for all i. We would like to relate er(Q) and êr(Q,D1,D∗1 , ...,Dn,D∗n), but the challenge is thatQmay depend onD1,D∗1 , ...,Dn,D∗n due to the learning algorithm. There are two sources of generalization error: (i) error due to the finite number of observed tasks and (ii) error due to the finite number of examples observed per task. Closely following the arguments in (Amit & Meir, 2018), we apply a standard PAC-Bayes bound to each of these and combine the results with a union bound.
Theorem. Let Q(θ) be a distribution over parameters θ and let P (θ) be a prior distribution. Then for any δ ∈ (0, 1], with probability at least 1 − δ, the following inequality holds uniformly for all distributions Q,
er(Q) ≤ 1 n n∑ i=1 êr(Q,Di,D∗i ) +
(√ 1
2(K − 1) +
√ 1
2(n− 1)
)√ DKL(Q‖P ) + log n(K + 1)
δ
(15)
Proof. To start, we state a classical PAC-Bayes bound and use it to derive generalization bounds on task and datapoint level generalization, respectively.
Theorem 2. Let X be a sample space (i.e. a space of possible datapoints). Let P (X) be a distribution over X (i.e. a data distribution). Let Θ be a hypothesis space. Given a “loss function” l(θ,X) : Θ × X → [0, 1] and a collection of M i.i.d. random variables sampled from P (X), X1, ..., XM , let π be a prior distribution over hypotheses in Θ that does not depend on the samples but may depend on the data distribution P (X). Then, for any δ ∈ (0, 1], the following bound holds uniformly for all posterior distributions ρ over Θ
P ( EXi∼P (X),θ∼ρ(·) [l(θ,Xi)] ≤ 1
M M∑ m=1 Eθ∼ρ(·)[l(θ,Xm] +
√ 1
2(M − 1)
( DKL(ρ‖π) + log M
δ
) , ∀ρ )
≥1− δ. (16)
Meta-level generalization First, we bound the task-level generalization, that is we relate er(Q) to 1n ∑n i=1 er(Q,Di, Ti). Letting the samples be Xi = (Di, Ti), and l(θ,Xn) = Eφi∼q(φ|Di,θ),(x∗,y∗)∼Ti [L(φ(x∗), y∗)], then Theorem 1 says that for any δ0 ∼ (0, 1]
P ( er(Q) ≤ 1
n n∑ i=1 er(Q,Di, Ti) +
√ 1
2(n− 1)
( DKL(Q‖P ) + log n
δ0
) ,∀Q ) ≥ 1− δ0, (17)
where P is a prior over θ.
Within task generalization Next, we relate er(Q,Di, Ti) to êr(Q,Di,D∗i ) via the PAC-Bayes bound. For a fixed task i, task training data Di, a prior π(φ|Ti) that only depends on the training
data, and any δi ∈ (0, 1], we have that P ( E(x∗,y∗)∼p(x,y|Ti)ρ(φi) [L(φi(x ∗), y∗)] ≤Eρ(φi)  1 K ∑ (x∗,y∗)∈D∗i L(φi(x∗), y∗)  + √ 1
2(K − 1)
( DKL(ρ||π) + log K
δi
) ,∀ρ ) ≥ 1− δi.
Now, we choose π(φ|Ti) to be ∫ P (θ)q(φ|θ,Di)dθ and restrict ρ(φ) to be of the form∫
Q(θ)q(φ|θ,Di)dθ for any Q. While, π and ρ may be complicated distributions (especially, if they are defined implicitly), we know that with this choice of π and ρ,DKL(ρ||π) ≤ DKL(Q||P ) (Cover & Thomas, 2012), hence, we have
P ( er(Q,Di, Ti) ≤ êr(Q,Di,D∗i ) + √ 1
2(K − 1)
( DKL(Q‖P ) + log K
δi
) ,∀Q ) ≥ 1− δi
(18)
Overall bound on meta-learner generalization Combining Eq. (17) and (18) using the union bound, we have
P ( er(Q) ≤ 1
n n∑ i=1 êr(Q,Di,D∗i ) +
√ 1
2(K − 1) DKL(Q‖P ) + log
K
δi
+
√ 1
2(n− 1) DKL(Q‖P ) + log
n δ0 ,∀Q
) ≥ 1− (∑ i δi + δ0 ) (19)
Choosing δ0 = δK+1 and δi = Kδ n(K+1) , then we have: P ( er(Q) ≤ 1
n n∑ i=1 êr(Q,Di,D∗i ) +
(√ 1
2(K − 1) +
√ 1
2(n− 1)
)√ DKL(Q‖P ) + log n(K + 1)
δ , ∀Q ) ≥1− δ. (20)
Because n is generally large, by Taylor expansion of the complexity term we have(√ 1
2(K − 1) +
√ 1
2(n− 1)
)√( DKLQ||P ) + log n(K + 1)
δ
)
= 1 2 √ log n(K + 1)/δ
(√ 1
2(K − 1) +
√ 1
2(n− 1)
)( DKLQ||P ) + 2 log( n(K + 1)
δ )
) + o(1)
Re-defining the coefficient of KL term as β and omitting the constant and higher order term, we recover the meta-regularization bound in Eq.(5) when Q(θ) = N (θ; θµ, θσ).

heading: A.5 EXPERIMENTAL DETAILS

heading: A.5.1 POSE PREDICTION
text: We create a multi-task regression dataset based on the Pascal 3D data (Xiang et al., 2014). The dataset consists of 10 classes of 3D object such as “aeroplane”, “sofa”, “TV monitor”, etc. Each class has multiple different objects and there are 65 objects in total. We randomly select 50 objects for meta-training and the other 15 objects for meta-testing. For each object, we use MuJoCo (Todorov et al., 2012) to render 100 images with random orientations of the instance on a table, visualized in Figure 1. For the meta-learning algorithm, the observation (x) is the 128 × 128 gray-scale image and the label (y) is the orientation re-scaled to be within [0, 10]. For each task, we randomly sample
30 (x, y) pairs for an object and evenly split them between task training and task test data. We use a meta batch-size of 10 tasks per iteration.
For MR-CNP, we use a convolutional encoder with a fully connected bottom layer to map the input image to a 20-dimensional latent representation z and z∗ for task training input x and test input x∗ respectively. The (z, y) are concatenated and mapped by the feature extractor and aggregator which are fully connected networks to the 200 dimensional task summary statistics φ. The decoder is a fully connected network that maps (φ, z∗) to the prediction ŷ∗.
For MR-MAML, we use a convolutional encoder to map the input image to a 14 × 14 dimensional latent representation z and z∗. The pairs (z, y) are used in the task adaptation step to get a task specific parameter φ via gradient descent. Then z∗ is mapped to the prediction ŷ∗ with a convolutional predictor parameterized by φ. The network is trained using 5 gradient steps with learning rate 0.01 in the inner loop for adaptation and evaluated using 20 gradient steps at the test-time.

heading: A.5.2 NON-MUTUALLY-EXCLUSIVE CLASSIFICATION
text: The Omniglot dataset consists of 20 instances of 1623 characters from 50 different alphabets. We randomly choose 1200 characters for meta-training and use the remaining for testing. The metatraining characters are partitioned into 60 disjoint sets for 20-way classification. The MiniImagenet dataset contains 100 classes of images including 64 training classes, 12 validation classes, and 24 test classes. We randomly partition the 64 meta-training classes into 13 disjoint sets for 5-way classification with one label having one less class of images than the others.
For MR-MAML we use a convolutional encoder similar to the pose prediction problem. The dimension of z and z∗ is 14 × 14 for Omniglot and 20 × 20 for MiniImagenet. We use a convolutional decoder for both datasets. Following (Finn et al., 2017), we use a meta batch-size of 16 for 20-way Omniglot classification and meta batch-size of 4 for 5-way MiniImagenet classification. The metalearning rate is chosen from {0.001, 0.005} and the β for meta-regularized methods are chosen from {10−7, 10−6, . . . , 10−3}. The optimal hyperparameters are chosen for each method separately via cross-validation.

heading: A.6 ADDITIONAL ILLUSTRATION AND GRAPHICAL MODEL
text: We show a standard few-shot classification setup in meta-learning to illustrate a mutually-exclusive task distribution and a graphical model for the regularization on the activations.

heading: A.7 ADDITIONAL RESULTS
text: As shown in Figures 5, 7 and 8, when meta-learning algorithms converge to the memorization solution, the test tasks must be similar to the train tasks in order to achieve low test error. For CNP, although the task training set contains sufficient information to infer the correct amplitude, this information is ignored and the regression curve at test-time is determined by the one-hot vector. As a result, CNP can only generalize to points from the curves it has seen in the training (Figure 7 first row). On the other hand, MAML does use the task training data (Figure 5, 8 and Table 1), however, its performance is much worse than in the mutually-exclusive task. MR-MAML and MR-CNP avoid converging to a memorization solution and achieve excellent test performance on sinusoid task.

heading: MR-CNP (A) MR-CNP (A) MR-CNP (W) MR-CNP (W)
text: In Table 5, we report the pre-update accuracy for the non-mutually-exclusive classification experiment in Section 6.3. The pre-update accuracy is obtained by the initial parameters θ rather than the task adapted parameters φ. At the meta-training time, for both MAML and MR-MAML the post-update accuracy obtained by using φ gets close to 1. High pre-update accuracy reflects the memorization problem. For example, in 20-way 1-shot Omniglot example, the pre-update accuracy for MAML is 99.2% at the training time, which means only 0.8% improvement in accuracy is due to adaptation, so the task training data is ignored to a large extent. The pre-update training accuracy for MR-MAML is 5%, which means 95% improvement in accuracy during training is due to the adaptation. This explains why in Table 4, the test accuracy of MR-MAML is much higher than that of MAML at the test-time, since the task training data is used to achieve fast adaptation.

Review summaries:
This paper analyses a pitfall of current meta-learning algorithms, where the task can be inferred from the meta-training data alone, leaving the task-training data unused. Such a meta-learner would generalise well on the meta-training tasks, but will fail to generalise on new tasks at test time. This kind of overfitting is formalised as the memorization problem. This problem is implicitly resolved in current meta-learning algorithms by constructing mutually-exclusive meta-training tasks, which is not easy to construct in all scenarios. The paper introduces an information-theoretic meta-regularizer which forces information extraction from the task data (D) by restricting information flow from meta-parameters (\theta) and input (x^*). Experimental evaluation with one gradient based and one contextual meta-learning method, on non-mutually-exclusive tasks bring out the mettle of the proposed regulariser. 

This paper illustrates, identifies, and formally defines a memorization problem in meta-learning -- the model can simply memorize meta-training tasks and ignore meta-training train sets. The paper proposes to optimize the mutual information between testing predictions and the training data (given input and meta model), and upper bound it by imposing a information bottleneck between output and input+model. Unlike related work, this paper specifically is able to generalize to meta-test even when the meta-train dataset is not made confusing enough (i.e. even when model can learn well from test data in meta-train alone), making it applicable to use cases where it is hard to make the dataset confusing.