M ETA -L EARNING P ROBABILISTIC I NFERENCE F OR P REDICTION
A BSTRACT
This paper introduces a new framework for data efﬁcient and versatile learning.
Speciﬁcally: 1) We develop ML-PIP, a general framework for Meta-Learning approximate Probabilistic Inference for Prediction.
ML-PIP extends existing probabilistic interpretations of meta-learning to cover a broad class of methods.
We introduce V ERSA , an instance of the framework employing a ﬂexible and versatile amortization network that takes few-shot learning datasets as inputs, with arbitrary numbers of shots, and outputs a distribution over task-speciﬁc parameters in a single forward pass.
V ERSA substitutes optimization at test time with forward passes through inference networks, amortizing the cost of inference and relieving the need for second derivatives during training.
We evaluate V ERSA on benchmark datasets where the method sets new state-of-the-art results, handles arbitrary numbers of shots, and for classiﬁcation, arbitrary numbers of classes at train and test time.
The power of the approach is then demonstrated through a challenging few-shot ShapeNet view reconstruction task.
I NTRODUCTION
Many applications require predictions to be made on myriad small, but related datasets.
In such cases, it is natural to desire learners that can rapidly adapt to new datasets at test time.
These applications have given rise to vast interest in few-shot learning (Fei-Fei et al., 2006; Lake et al., 2011), which emphasizes data efﬁciency via information sharing across related tasks.
Despite recent advances, notably in meta-learning based approaches (Ravi and Larochelle, 2017; Vinyals et al., 2016; Edwards and Storkey, 2017; Finn et al., 2017; Lacoste et al., 2018), there remains a lack of general purpose methods for ﬂexible, data-efﬁcient learning.
Due to the ubiquity of recent work, a unifying view is needed to understand and improve these methods.
Existing frameworks (Grant et al., 2018; Finn et al., 2018) are limited to speciﬁc families of approaches.
In this paper we develop a framework for meta-learning approximate probabilistic inference for prediction (ML-PIP), providing this view in terms of amortizing posterior predictive distributions.
In Section 4, we show that ML-PIP re-frames and extends existing point-estimate probabilistic interpretations of meta-learning (Grant et al., 2018;
Finn et al., 2018) to cover a broader class of methods, including gradient based meta-learning (Finn et al., 2017; Ravi and Larochelle, 2017), metric based meta-learning (Snell et al., 2017), amortized MAP inference (Qiao et al., 2017) and conditional probability modelling (Garnelo et al., 2018a;b).
The framework incorporates three key elements.
First, we leverage shared statistical structure between tasks via hierarchical probabilistic models developed for multi-task and transfer learning (Heskes, ; Bakker and Heskes, 2003).
Second, we share information between tasks about how to learn and perform inference using meta-learning (Naik and Mammone, 1992; Thrun and Pratt, 2012;
Schmidhuber, 1987).
Since uncertainty is rife in small datasets, we provide a procedure for metalearning probabilistic inference.
Third, we enable fast learning that can ﬂexibly handle a wide range of tasks and learning settings via amortization (Kingma and Welling, 2014; Rezende et al., 2014).
Building on the framework, we propose a new method – V ERSA – which substitutes optimization procedures at test time with forward passes through inference networks.
This amortizes the cost of inference, resulting in faster test-time performance, and relieves the need for second derivatives during training.
V ERSA employs a ﬂexible amortization network that takes few-shot learning datasets, and outputs a distribution over task-speciﬁc parameters in a single forward pass.
The network can handle arbitrary numbers of shots, and for classiﬁcation, arbitrary numbers of classes at train and test time (see Section 3).
In Section 5, we evaluate V ERSA on (i) standard benchmarks where the method sets new state-of-the-art results, (ii) settings where test conditions (shot and way) differ from training, and (iii) a challenging one-shot view reconstruction task.
M ETA -L EARNING P ROBABILISTIC I NFERENCE F OR P REDICTION
We now present the framework that consists of (i) a multi-task probabilistic model, and (ii) a method for meta-learning probabilistic inference.
2. P ROBABILISTIC M ODEL
Two principles guide the choice of model.
First, the use of discriminative models to maximize predictive performance on supervised learning tasks (Ng and Jordan, 2002).
Second, the need to leverage shared statistical structure between tasks (i.e. multi-task learning).
These criteria are met by the standard multi-task directed graphical model shown in Fig.
1 that employs shared parameters θ , which are common to all tasks, and task speciﬁc parameters { ψ ( t ) }
Tt =1 .
Inputs are denoted x and outputs y .
Training data D ( t )
=
{ ( x ( t ) n , y ( t ) n ) } N t n =1 , and test data { (˜ x ( t ) m , ˜ y ( t ) m ) } M t m =1 are explicitly distinguished for each task t , as this is key for few-shot learning.
[Figure]
Let X ( t ) and Y ( t ) denote all the inputs and outputs (both test and train) for task t .
The joint probability of the outputs and task speciﬁc parameters for T tasks, given the inputs and global parameters is:
[Equation]
In the next section, the goal is to meta-learn fast and accurate approximations to the posterior predictive distribution p (˜ y ( t ) | ˜ x
( t ) , θ )
= (cid:82) p (˜ y ( t ) | ˜ x ( t ) , ψ ( t ) , θ ) p ( ψ ( t ) | ˜ x ( t ) , D ( t ) , θ )
d ψ ( t ) for unseen tasks t .
2. P ROBABILISTIC I NFERENCE
This section provides a framework for meta-learning approximate inference that is a simple reframing and extension of existing approaches (Finn et al., 2017; Grant et al., 2018).
We will employ point estimates for the shared parameters θ since data across all tasks will pin down their value.
Distributional estimates will be used for the task-speciﬁc parameters since only a few shots constrain them.
Once the shared parameters are learned, the probabilistic solution to few-shot learning in the model above comprises two steps.
First, form the posterior distribution over the task-speciﬁc parameters p ( ψ ( t ) | ˜ x ( t ) , D ( t ) , θ ) .
Second, compute the posterior predictive p (˜ y ( t ) | ˜ x
( t ) , θ ) .
These steps will require approximation and the emphasis here is on performing this quickly at test time.
We will describe the form of the approximation, the optimization problem used to learn it, and how to implement this efﬁciently below.
In what follows we initially suppress dependencies on the inputs ˜ x and shared parameters θ to reduce notational clutter, but will reintroduce these at the end of the section.
Speciﬁcation of the approximate posterior predictive distribution.
Our framework approximates the posterior predictive distribution by an amortized distribution q φ (˜ y | D ) .
That is, we learn a feed-forward inference network with parameters φ that takes any training dataset D ( t ) and test input ˜ x as inputs and returns the predictive distribution over the test output ˜ y ( t ) .
We construct this by amortizing the approximate posterior q φ ( ψ | D ) and then form the approximate posterior predictive distribution using:
[Equation]
This step may require additional approximation e.g. Monte Carlo sampling.
The amortization will enable fast predictions at test time.
The form of these distributions is identical to those used in amortized variational inference (Edwards and Storkey, 2017; Kingma and Welling, 2014).
In this work, we use a factorized Gaussian distribution for q φ ( ψ | D ( t ) ) with means and variances set by the amortization network.
However, the training method described next is different.
Meta-learning the approximate posterior predictive distribution.
The quality of the approximate posterior predictive for a single task will be measured by the KL-divergence between the true and approximate posterior predictive distribution KL [ p (˜ y | D ) [Equation] q φ (˜ y | D )] .
The goal of learning will be to minimize the expected value of this KL averaged over tasks,
[Equation]
Training will therefore return parameters φ that best approximate the posterior predictive distribution in an average KL sense.
So, if the approximate posterior q φ ( ψ | D ) is rich enough, global optimization will recover the true posterior p ( ψ | D ) (assuming p ( ψ | D ) obeys identiﬁability conditions (Casella and Berger, 2002)).
Thus, the amortized procedure meta-learns approximate inference that supports accurate prediction.
Appendix A provides a generalized derivation of the framework, grounded in
Bayesian decision theory (Jaynes, 2003).
The right hand side of Eq.
(2) indicates how training could proceed: (i) select a task t at random, (ii) sample some training data D ( t ) , (iii) form the posterior predictive q φ ( ·| D ( t ) ) and, (iv) compute the log-density log q φ (˜ y ( t ) | D ( t ) ) at test data
˜ y ( t ) not included in D ( t ) .
Repeating this process many times and averaging the results would provide an unbiased estimate of the objective which can then be optimized.
This perspective also makes it clear that the procedure is scoring the approximate inference procedure by simulating approximate Bayesian held-out log-likelihood evaluation.
Importantly, while an inference network is used to approximate posterior distributions, the training procedure differs signiﬁcantly from standard variational inference.
In particular, rather than minimizing KL( q φ ( ψ | D ) (cid:107) p ( ψ | D ))
, our objective function directly focuses on the posterior predictive distribution and minimizes KL( p (˜ y | D ) (cid:107) q φ (˜ y | D )) .
End-to-end stochastic training.
Armed by the insights above we now layout the full training procedure.
We reintroduce inputs and shared parameters θ
and the objective becomes:
[Equation]
We optimize the objective over the shared parameters θ as this will maximize predictive performance (i [Equation] e., Bayesian held out likelihood).
An end-to-end stochastic training objective for θ and φ is:
[Equation]
| | w (1) t ··· w ( C ) t | |    
Linear Classiﬁer h
θ (˜ x ) ˜ x θ
[Figure]
| [Figure] ,θ,ψ t )
Feature extraction
Softmax output
[Figure]
Amortization Network q φ h θ (cid:16) x (1)1 (cid:17) ...
h θ (cid:16) x
[Figure]
(cid:17) φ pre φ pre h (1) h (1) k h (1) φ post q ( w (1) t ) individual feature extraction instancepooling regression onto weights and { ˜ y ( t ) m , ˜ x
( t ) m , D ( t ) } ∼ p (˜ y, ˜ x, D ) , where p represents the data distribution (e.g., sampling tasks and splitting them into disjoint training data D and test data { (˜ x ( t ) m , ˜ y ( t ) m ) } M t m =1 ). This type of training therefore uses episodic train / test splits at meta-train time.
We have also approximated the integral over ψ using L Monte Carlo samples. The local reparametrization (Kingma et al., 2015) trick enables optimization.
Interestingly, the learning objective does not require an explicit speciﬁcation of the prior distribution over parameters, p ( ψ ( t ) | θ ) , learning it implicitly through q φ ( ψ | D, θ ) instead.
In summary, we have developed an approach for Meta-Learning Probabilistic Inference for Prediction (ML-PIP).
A simple investigation of the inference method with synthetic data is provided in
Section 5.1.
In Section 4 we will show that this formulation uniﬁes a number of existing approaches, but ﬁrst we discuss a particular instance of the ML-PIP framework that supports versatile learning.
V ERSATILE A MORTIZED I NFERENCE
A versatile system is one that makes inferences both rapidly and ﬂexibly.
By rapidly we mean that test-time inference involves only simple computation such as a feed-forward pass through a neural network.
By ﬂexibly we mean that the system supports a variety of tasks – including variable numbers of shots or numbers of classes in classiﬁcation problems – without retraining.
Rapid inference comes automatically with the use of a deep neural network to amortize the approximate posterior distribution q .
However, it typically comes at the cost of ﬂexibility: amortized inference is usually limited to a single speciﬁc task.
Below, we discuss design choices that enable us to retain ﬂexibility.
Inference with sets as inputs.
The amortization network takes data sets of variable size as inputs whose ordering we should be invariant to.
We use permutation-invariant instance-pooling operations to process these sets similarly to Qi et al.
(2017) and as formalized in Zaheer et al.
The instance-pooling operation ensures that the network can process any number of training observations.
V ERSA for Few-Shot Image Classiﬁcation.
For few-shot image classiﬁcation, our parameterization of the probabilistic model is inspired by early work from Heskes (2000); Bakker and Heskes (2003) and recent extensions to deep learning (Bauer et al., 2017; Qiao et al., 2017).
A feature extractor neural network h θ
( x ) ∈ R
d θ , shared across all tasks, feeds into a set of task-speciﬁc linear classiﬁers with softmax outputs and weights and biases ψ ( t ) =
{ W ( t ) , b ( t ) } (see Fig. 2).
A naive amortization requires the approximate posterior q φ ( ψ | D, θ ) to model the distribution over full weight matrices in R d θ × C (and biases).
This requires the speciﬁcation of the number of few-shot classes C ahead of time and limits inference to this chosen number.
Moreover, it is difﬁcult to metalearn systems that directly output large matrices as the output dimensionality is high.
We therefore propose specifying q φ ( ψ | D, θ ) in a context independent manner such that each weight vector ψ c depends only on examples from class c , by amortizing individual weight vectors associated with a
˜ x ψ ( t )
Generator θ p (˜ y | ˜ x,θ,ψ ( t ) )
( y ( t ) 1 ,x ( t )1 ) ( y ( t ) k ,x ( t ) k )
φ φ
Amortization Network φ y ( t )...
y ( t )
k
φ pre φ pre h ( t ) x
( t ) h ( t ) k x ( t )
k
φ mid φ mid ˜ h ( t ) ˜
h ( t ) k h ( t ) φ post ψ ( t )
[Figure]
instancepooling
[Figure]
single softmax output instead of the entire weight matrix directly.
To reduce the number of learned parameters, the amortization network operates directly on the extracted features h θ ( x ) :
[Equation]
Note that in our implementation, end-to-end training is employed, i.e., we backpropagate to θ through the inference network.
Here k c is the number of observed examples in class c and ψ c = { w c , b c } denotes the weight vector and bias of the linear classiﬁer associated with that class.
Thus, we construct the classiﬁcation matrix ψ ( t ) by performing C feed-forward passes through the inference network q φ ( ψ | D, θ ) (see Fig. 2).
The assumption of context independent inference is an approximation.
In Appendix B, we provide theoretical and empirical justiﬁcation for its validity.
Our theoretical arguments use insights from
Density Ratio Estimation (Mohamed, 2018; Sugiyama et al., 2012), and we empirically demonstrate that full approximate posterior distributions are close to their context independent counterparts.
Critically, the context independent approximation addresses all the limitations of a naive amortization mentioned above: (i) the inference network needs to amortize far fewer parameters whose number does not scale with number of classes C (a single weight vector instead of the entire matrix); (ii) the amortization network can be meta-trained with different numbers of classes per task, and (iii) the number of classes C can vary at test-time.
V ERSA for Few-Shot Image Reconstruction (Regression).
We consider a challenging few-shot learning task with a complex (high dimensional and continuous) output space.
We deﬁne view reconstruction as the ability to infer how an object looks from any desired angle based on a small set of observed views.
We frame this as a multi-output regression task from a set of training images with known orientations to output images with speciﬁed orientations.
Our generative model is similar to the generator of a GAN or the decoder of a VAE:
A latent vector ψ ( t ) ∈ R d ψ , which acts as an object-instance level input to the generator, is concatenated with an angle representation and mapped through the generator to produce an image at the speciﬁed orientation.
In this setting, we treat all parameters θ of the generator network as global parameters (see Appendix E. for full details of the architecture), whereas the latent inputs ψ ( t ) are the task-speciﬁc parameters.
We use a Gaussian likelihood in pixel space for the outputs of the generator.
To ensure that the output means are between zero and one, we use a sigmoid activation after the ﬁnal layer.
φ parameterizes an amortization network that ﬁrst processes the image representations of an object, concatenates them with their associated view orientations, and processes them further before instance-pooling.
From the pooled representations, q φ ( ψ | D, θ ) produces a distribution over vectors ψ ( t ) .
This process is illustrated in Fig.
ML-PIP U NIFIES D ISPARATE R ELATED W ORK
In this section, we continue in the spirit of Grant et al.
(2018), and recast a broader class of metalearning approaches as approximate inference in hierarchical models.
We show that ML-PIP uniﬁes a number of important approaches to meta-learning, including both gradient and metric based variants, as well as amortized MAP inference and conditional modelling approaches (Garnelo et al., 2018a).
We lay out these connections, most of which rely on point estimates for the task-speciﬁc parameters corresponding to q ( ψ ( t ) | D ( t ) , θ )
= δ (cid:0) ψ ( t ) − ψ ∗ ( D ( t ) , θ ) (cid:1) .
In addition, we compare previous approaches to V ERSA .
Gradient-Based Meta-Learning.
Let the task-speciﬁc parameters ψ ( t ) be all the parameters in a neural network.
Consider a point estimate formed by taking a step of gradient ascent of the training loss, initialized at ψ 0 and with learning rate η .
[Equation]
This is an example of semi-amortized inference (Kim et al., 2018b), as the only shared inference parameters are the initialization and learning rate, and optimization is required for each task (albeit only for one step).
Importantly, Eq.
(6) recovers Model-agnostic meta-learning
(Finn et al., 2017), providing a perspective as semi-amortized ML-PIP.
This perspective is complementary to that of
Grant et al.
(2018) who justify the one-step gradient parameter update employed by MAML through
MAP inference and the form of the prior p ( ψ | θ ) .
Note that the episodic meta-train / meta-test splits do not fall out of this perspective.
Instead we view the update choice as one of amortization which is trained using the predictive KL and naturally recovers the test-train splits.
More generally, multiple gradient steps could be fed into an RNN to compute ψ ∗ which recovers Ravi and Larochelle (2017).
In comparison to these methods, besides being distributional over ψ , V ERSA relieves the need to back-propagate through gradient based updates during training and compute gradients at test time, as well as enables the treatment of both local and global parameters which simpliﬁes inference.
Metric-Based Few-Shot Learning.
Let the task-speciﬁc parameters be the top layer softmax weights and biases of a neural network ψ ( t )
= { w ( t ) c , b ( t
) c } Cc =1 .
The shared parameters are the lower layer weights.
Consider amortized point estimates for these parameters constructed by averaging the top-layer activations for each class,
[Equation]
These choices lead to the following predictive distribution:
[Equation]
which recovers prototypical networks (Snell et al., 2017) using a Euclidean distance function d with the ﬁnal hidden layer being the embedding space
In comparison, V ERSA is distributional and it uses a more ﬂexible amortization function that goes beyond averaging of activations.
Amortized MAP inference.
Qiao et al.
(2017) proposed a method for predicting weights of classes from activations of a pre-trained network to support i) online learning on a single task to which new few-shot classes are incrementally added, ii) transfer from a high-shot classiﬁcation task to a separate low-shot classiﬁcation task.
This is an example usage of hyper-networks (Ha et al., 2016) to amortize learning about weights, and can be recovered by the ML-PIP framework by pre-training θ and performing MAP inference for ψ .
V ERSA goes beyond point estimates and although its amortization network is similar in spirit, it is more general, employing end-to-end training and supporting full multi-task learning by sharing information between many tasks.
Conditional models trained via maximum likelihood.
In cases where a point estimate of the task-speciﬁc parameters are used the predictive becomes
[Equation]
In such cases the amortization network that computes ψ ∗ ( D, θ ) can be equivalently viewed as part of the model speciﬁcation rather than the inference scheme.
From this perspective, the ML-PIP training procedure for φ and θ is equivalent to training a conditional model p (˜ y | ψ ∗ φ ( D, θ ) , θ ) via maximum likelihood estimation, establishing a strong connection to neural processes (Garnelo et al., 2018a;b).
Comparison to Variational Inference (VI).
Standard application of amortized VI (Kingma and
Welling, 2014; Rezende et al., 2014; Kingma et al., 2015; Blundell et al., 2015) for ψ in the multi-task discriminative model optimizes the Monte Carlo approximated free-energy w.r.t.
φ and θ :
[Equation]
where ψ ( t ) l ∼ q φ ( ψ | D ( t ) , θ ) .
In addition to the conceptual difference from ML-PIP (discussed in
Section 2.1), this differs from the ML-PIP objective by i) not employing meta train / test splits, and ii) including the KL for regularization instead.
In Section 5, we show that V ERSA signiﬁcantly improves over standard VI in the few-shot classiﬁcation case and compare to recent VI/meta-learning hybrids.
E XPERIMENTS AND R ESULTS
We evaluate V ERSA on several few-shot learning tasks.
We begin with toy experiments to investigate the properties of the amortized posterior inference achieved by V ERSA .
We then report few-shot classiﬁcation results using the Omniglot and mini ImageNet datasets in Section 5.2, and demonstrate
V ERSA ’s ability to retain high accuracy as the shot and way are varied at test time.
In Section 5.3, we examine V ERSA ’s performance on a one-shot view reconstruction task with ShapeNet objects.
5. P OSTERIOR I NFERENCE WITH T OY D ATA
To investigate the approximate inference performed by our training procedure, we run the following experiment.
We ﬁrst generate data from a Gaussian distribution with a mean that varies across tasks:
[Equation]
We generate T = 250 tasks in two separate experiments, having N ∈ { 5 , 10 } train observations and M = 15 test observations.
We introduce the inference network q φ ( ψ | D ( t ) )
=
N ( ψ ; µ ( t ) q , σ ( t )2 q ) , amortizing inference as:
[Equation]
The learnable parameters φ = { w µ , b µ , w σ , b σ } are trained with the objective function in Eq.
The model is trained to convergence with Adam (Kingma and Ba, 2015) using mini-batches of tasks from the generated dataset.
Then, a separate set of tasks is generated from the same generative process, and the posterior q φ ( ψ | D ) is inferred with the learned amortization parameters.
The true posterior over ψ is Gaussian with a mean that depends on the task, and may be computed analytically.
Fig.
4 shows the approximate posterior distributions inferred for unseen test sets by the trained amortization networks.
The evaluation shows that the inference procedure is able to recover accurate posterior distributions over ψ , despite minimizing a predictive KL divergence in data space.
5. F EW - SHOT C LASSIFICATION
We evaluate V ERSA on standard few-shot classiﬁcation tasks in comparison to previous work.
Specifically, we consider the Omniglot (Lake et al., 2011) and mini ImageNet (Ravi and Larochelle, 2017) datasets which are C -way classiﬁcation tasks with k c examples per class.
V ERSA follows the implementation in Sections 2 and 3, and the approximate inference scheme in Eq.
We follow the experimental protocol established by Vinyals et al.
(2016) for Omniglot and Ravi and Larochelle [Equation] (2017) for mini Imagenet, using equivalent architectures for h θ .
Training is carried out in an episodic manner: for each task, k c examples are used as training inputs to infer q φ ( ψ ( c )
| D, θ ) for each class, and an additional set of examples is used to evaluate the objective function.
Full details of data preparation and network architectures are provided in Appendix D.
Table 3 details few-shot classiﬁcation performance for V ERSA as well as competitive approaches.
The tables include results for only those approaches with comparable training procedures and convolutional feature extraction architectures.
Approaches that employ pre-training and/or residual networks (Bauer et al., 2017; Qiao et al., 2017; Rusu et al., 2018; Gidaris and Komodakis, 2018; Oreshkin et al., 2018;
Garcia and Bruna, 2017; Lacoste et al., 2018) have been excluded so that the quality of the learning algorithm can be assessed separately from the power of the underlying discriminative model.
For Omniglot, the training, validation, and test splits have not been speciﬁed for previous methods, affecting the comparison.
V ERSA achieves a new state-of-the-art results (67.37% - up 1.38% over the previous best) on 5-way - 5-shot classiﬁcation on the mini ImageNet benchmark and (97.66% - up 0.02%) on the 20-way - 1 shot Omniglot benchmark for systems using a convolution-based network architecture and an end-to-end training procedure.
V ERSA is within error bars of state-of-the-art on three other benchmarks including 5-way - 1-shot mini ImageNet, 5-way - 5-shot Omniglot, and 5-way - 1-shot Omniglot.
Results on the Omniglot 20 way - 5-shot benchmark are very competitive with, but lower than other approaches.
While most of the methods evaluated in Table 3 adapt all of the learned parameters for new tasks, V ERSA is able to achieve state-of-the-art performance despite adapting only the weights of the top-level classiﬁer.
Comparison to standard and amortized VI.
To investigate the performance of our inference procedure [Table] we compare it in terms of log-likelihood (Table 1) and accuracy (Table 3) to training the same model using both amortized and non-amortized VI (i
[Table]
e., Eq.
Derivations and further experimental details are provided in Appendix C. V ERSA improves substantially over amortized VI even though the same amortization network is used for both.
This is due to VI’s tendency to under-ﬁt, especially for small numbers of data points (Trippe and Turner, 2018; Turner and Sahani, 2011) which is compounded when using inference networks (Cremer et al., 2018).
Using non-amortized VI
[Table]
improves performance substantially, but does not reach the level of V ERSA and forming the posterior is signiﬁcantly slower as it requires many forward / backward passes through the network.
This is similar in spirit to MAML (Finn et al., 2017), though MAML dramatically reduces the number of required iterations by ﬁnding good global initializations e.g., ﬁve gradient steps for mini ImageNet.
This is in contrast to the single forward pass required by V ERSA .
Versatility.
V ERSA allows us to vary the number of classes C and shots k c between training and testing (Eq.
Fig.
5a shows that a model trained for a particular C -way retains very high accuracy as C is varied.
For example, when V ERSA is trained for the 20-Way, 5-Shot condition, at test-time it can handle C = 100 way conditions and retain an accuracy of approximately 94%.
Fig.
5b shows similar robustness as the number of shots k c is varied.
V ERSA therefore demonstrates considerable ﬂexibility and robustness to the test-time conditions [Figure] but at the same time it is efﬁcient as it only requires forward passes through the network.
The time taken to evaluate 1000 test tasks with a 5-way, 5-shot mini ImageNet trained model using MAML ( https://github.com/cbfinn/maml ) is 302.9 seconds whereas V ERSA took 53.5 seconds on a NVIDIA Tesla P100-PCIE-16GB GPU.
This is more than 5 × speed advantage in favor of V ERSA while bettering MAML in accuracy by 4.26%.
[Figure]
[Figure] v2 (Chang et al., 2015) is a database of 3D objects covering 55 common object categories with ∼ 51,300 unique objects.
For our experiments, we use 12 of the largest object categories.
We concatenate all instances from all 12 of the object categories together to obtain a dataset of 37, objects.
This dataset is then randomly shufﬂed and we use 70% of the objects for training, 10% for validation, and 20% for testing.
For each object, we generate 36 views of size 32 × 32 pixels spaced evenly every 10 degrees in azimuth around the object.
We evaluate V ERSA by comparing it to a conditional variational autoencoder (C-VAE) with view angles as labels (Kingma et al., 2014; Narayanaswamy et al., 2017) and identical architectures.
We train V ERSA in an episodic manner and the C-VAE in batch-mode on all 12 object classes at once.
We train on a single view selected at random and use the remaining views to evaluate the objective function.
For full experimentation details see Appendix E. Fig.
6 shows views of unseen objects from the test set generated from a single shot with V ERSA as well as a C-VAE and compares both to ground truth views.
Both V ERSA and the C-VAE capture the correct orientation of the object in the generated images.
However, V ERSA produces images that contain much more detail and are visually sharper than the C-VAE images.
Although important information is missing due to occlusion in the single shot, V ERSA is often able to accurately impute this information presumably due to learning the statistics of these objects.
Table 2 provides quantitative comparison results between V ERSA with varying shot and the C-VAE.
The quantitative metrics all show the superiority of V ERSA over a
C-VAE.
As the number of shots increase to 5, the measurements show a corresponding improvement.
[Table]
[Table] [Table]
[Table]
C ONCLUSIONS
We have introduced ML-PIP, a probabilistic framework for meta-learning.
ML-PIP uniﬁes a broad class of recently proposed meta-learning methods, and suggests alternative approaches.
Building on ML-PIP, we developed V ERSA , a few-shot learning algorithm that avoids the use of gradient based optimization at test time by amortizing posterior inference of task-speciﬁc parameters.
We evaluated V ERSA on several few-shot learning tasks and demonstrated state-of-the-art performance and compelling visual results on a challenging 1-shot view reconstruction task
[Table]
[Table]
shot
C-VAE
V ERSA
Ground Truth shot
C-VAE
V ERSA
Ground Truth
C-VAE
V ERSA
Ground Truth shot
C-VAE
V ERSA
Ground Truth shot shot
C-VAE
V ERSA
Ground Truth shot
C-VAE
V ERSA
Ground Truth shot
C-VAE
V ERSA
Ground Truth shot
C-VAE
V ERSA
Ground Truth shot
C-VAE
V ERSA
Ground Truth shot
C-VAE
V ERSA
Ground Truth shot
C-VAE
V ERSA
Ground Truth shot
C-VAE
V ERSA
Ground Truth
A CKNOWLEDGEMENTS
We thank Ravi and Larochelle for providing the miniImageNet dataset, and Yingzhen Li, Niki Kilbertus, Will Tebbutt, Maria Lomelli and Robert Pinsler for their useful feedback. J.G. acknowledges funding from a Samsung Doctoral Scholarship.
M
B. acknowledges funding by the EPSRC and a
Qualcomm European Scholarship in Technology. R E.T. acknowledges support from EPSRC grants
EP/M0269571 and EP/L000776/1.
A B AYESIAN D ECISION T HEORETIC G ENERALIZATION OF ML-PIP
A generalization of the new inference framework presented in Section 2 is based upon Bayesian decision theory (BDT).
BDT provides a recipe for making predictions ˆ y for an unknown test variable ˜
y
by combining information from observed training data D ( t ) (here from a single task t ) and a loss function L (˜ y, ˆ y ) that encodes the cost of predicting ˆ y when the true value is ˜ y (Berger, 2013; Jaynes, 2003).
In BDT an optimal prediction minimizes the expected loss (suppressing dependencies on the inputs and θ to reduce notational clutter):
[Equation]
where p (˜ y | D ( t ) ) = (cid:90) p (
[Equation]
|
[Equation]
) p ( ψ ( t ) | D ( t ) )
d
[Equation]
( t ) (A.1) is the Bayesian predictive distribution and p ( ψ ( t ) | D ( t ) )
the posterior distribution of ψ ( t ) given the training data from task t .
BDT separates test and training data and so is a natural lens through which to view recent episodic approaches to training that utilize many internal training/test splits (Vinyals et al., 2016).
Based on this insight, what follows is a fairly dense derivation of an ultimately simple stochastic variational objective for meta-learning probabilistic inference that is rigorously grounded in Bayesian inference and decision theory.
Distributional BDT.
We generalize BDT to cases where the goal is to return a full predictive distribution q ( · ) over the unknown test variable ˜
y rather than a point prediction.
The quality of q is quantiﬁed through a distributional loss function L (˜ y, q ( · )) .
Typically, if ˜ y (the true value of the underlying variable) falls in a low probability region of q ( · ) the loss will be high, and vice versa.
The optimal predictive q ∗ is found by optimizing the expected distributional loss with q constrained to a distributional family Q :
[Equation]
Amortized variational training.
Here, we amortize q to form quick predictions at test time and learn parameters by minimizing average expected loss over tasks .
Let φ be a set of shared variational parameters such that q (˜ y )
=
q φ (˜ y | D ) (or q φ for shorthand).
Now the approximate predictive distribution can take any training dataset D ( t ) as an argument and directly perform prediction of ˜ y ( t ) .
The optimal variational parameters are found by minimizing the expected distributional loss across tasks
[Equation]
Here the variables D, ˜ x and ˜ y are placeholders for integration over all possible datasets, test inputs and outputs.
Note that Eq.
(A.3) can be stochastically approximated by sampling a task t and randomly partitioning into training data D and test data { ˜ x m , ˜ y m } Mm =1 , which naturally recovers episodic minibatch training over tasks and data (Vinyals et al., 2016;
Ravi and Larochelle, 2017).
Critically, this does not require computation of the true predictive distribution.
It also emphasizes the meta-learning aspect of the procedure, as the model is learning how to infer predictive distributions from training tasks.
Loss functions.
We employ the log-loss: the negative log density of q φ at ˜ y .
In this case,
[Equation]
+ H [ p (˜ y | D )]] , (A.4) where KL[ p ( y ) (cid:107) q ( y )] is the KL-divergence, and H [ p ( y )] is the entropy of p .
Eq.
(A.4) has the elegant property that the optimal q φ is the closest member of Q (in a KL sense) to the true predictive p (˜ y | D ) , which is unsurprising as the log-loss is a proper scoring rule (Huszar, 2013).
This is reminiscent of the sleep phase in the wake-sleep algorithm (Hinton et al., 1995).
Exploration of alternative proper scoring rules (Dawid, 2007) and more task-speciﬁc losses (Lacoste-Julien et al., 2011) is left for future work.
Speciﬁcation of the approximate predictive distribution.
Next, we consider the form of q φ .
Motivated by the optimal predictive distribution, we replace the true posterior by an approximation:
[Equation]
B J USTIFICATION FOR C ONTEXT -I NDEPENDENT A PPROXIMATION
In this section we lay out both theoretical and empirical justiﬁcations for the context-independent approximation detailed in Section 3.
B. T HEORETICAL A RGUMENT – D ENSITY R ATIO E STIMATION
A principled justiﬁcation for the approximation is best understood through the lens of density ratio estimation (Mohamed, 2018; Sugiyama et al., 2012).
We denote the conditional density of each class as p ( x | y
= c ) and assume equal a priori class probability p ( y = c ) = 1 /C .
Density ratio theory then uses Bayes’ theorem to show that the optimal softmax classiﬁer can be expressed in terms of the conditional densities (Mohamed, 2018;
Sugiyama et al., 2012):
[Equation]
This implies that the optimal classiﬁer will construct estimators for the conditional density for each class, that is exp( h ( x ) (cid:62) w c ) ∝ p ( x | y = c ) .
Importantly for our approximation, notice that these estimates are constructed independently for each class, similarly to training a naive Bayes classiﬁer.
V ERSA mirrors this optimal form using:
[Equation]
where w c ∼ q φ ( w |{ x n | y n = c } ) for each class in a given task.
Under ideal conditions (i.e., if one could perfectly estimate p (˜ x | y = c ) ), the context-independent assumption holds, further motivating our design.
B. E MPIRICAL J USTIFICATION
Here we detail a simple experiment to evaluate the validity of the context-independent inference assumption.
The goal of the experiment is to examine if weights may be context-independent without imposing the assumption on the amortization network.
To see this, we randomly generate ﬁfty tasks from a dataset, where classes may appear a number of times in different tasks.
We then perform free-form (non-amortized) variational inference on the weights for each of the tasks, with a Gaussian variational distribution:
[Equation]
If the assumption is reasonable, we may expect the distribution of the weights of a speciﬁc class to be similar regardless of the additional classes in the task.
We examine 5-way classiﬁcation in the MNIST dataset.
We randomly sample and ﬁx ﬁfty such tasks.
We train the model twice using the same feature extraction network used in the few-shot classiﬁcation experiments, and ﬁx the d θ to be 16 and 2.
We then train the model in an episodic manner by minibatching tasks at each iteration.
The model is trained to convergence, and achieves 99% accuracy on held out test examples for the tasks.
After training is complete we examine the optimized µ ( t ) φ for each class in each task.
Fig.
B.1a shows a t-SNE (Maaten and Hinton, 2008) plot for the 16-dimensional weights.
We see that when reduced to 2-dimensions, the weights cluster according to class.
Fig.
B.1b visualizes the weights in their original space.
In this plot, weights from the same class are grouped together, and clear similarity patterns are evident across the image, showing that weights from the same class have similar means across tasks.
Fig.
B.2 details the task weights in 2-dimensional space.
Here, each pentagon represents the weight means learned for one training task, where the nodes of the pentagon are colored according to the class the weights represent.
In Fig.
B.2a we see that overall,
[Figure] [Figure]
the classes cluster in 2-dimensional space as well.
However, there is some overlap (e.g., classes ‘1’ and ‘2’), and that for some tasks a class-weight may appear away from the cluster.
Fig.
B.2b shows the same plot, but only for tasks that contain both class ‘1’ and ‘2’.
Here we can see that for these tasks, class ‘2’ weights are all located away from their cluster.
This implies that each class-weights are typically well-approximated as being independent of the task.
However, if the model lacks capacity to properly assign each set of class weights to different regions of space, for tasks where classes from similar regions of space appear, the inference procedure will ‘move’ one of the class weights to an ‘empty’ region of the space.
C V ARIATIONAL I NFERENCE D ERIVATIONS FOR THE M ODEL
We derive a VI-based objective for our probabilistic model.
By “amortized” VI we mean that q φ ( ψ | D ( t ) , θ ) is parameterized by a neural network with a ﬁxed-sized φ .
Conversely, “non-amortized”
VI refers to local parameters φ ( t ) that are optimized independently (at test time) for each new task t , such that q ( ψ | D ( t ) , θ ) =
N ( ψ | µ φ ( t ) , Σ φ ( t ) ) .
However, the derivation of the objective function does not change between these options.
For a single task t , an evidence lower bound (ELBO; (Wainwright and Jordan, 2008)) may be expressed as:
[Equation]
We can then derive a stochastic estimator to optimize Eq.
(C.1) by sampling D ( t ) ∼ p ( D ) (approximated with a training set of tasks) and simple Monte Carlo integration over ψ such that ψ ( l ) ∼ q φ ( ψ | D
t ) , θ ) :
[Equation]
Eq.
(C.2) differs from our objective function in Eq.
(4) in two important ways: (i) Eq.
(4) does not contain a KL term for q φ ( ψ | D ( t ) , θ ) (nor any other form of prior distribution over ψ , and (ii) Eq.
(C.1) does not distinguish between training and test data within a task, and therefore does not explicitly encourage the model to generalize in any way.
D E XPERIMENTATION D ETAILS
In this section we provide comprehensive details on the few-shot classiﬁcation experiments.
D.
O MNIGLOT
F EW - SHOT C LASSIFICATION T RAINING P ROCEDURE
Omniglot (Lake et al., 2011) is a few-shot learning dataset consisting of 1623 handwritten characters (each with 20 instances) derived from 50 alphabets.
We follow a pre-processing and training procedure akin to that deﬁned in (Vinyals et al., 2016).
First the images are resized to 28 × 28 pixels and then character classes are augmented with rotations of 90 degrees.
The training, validation and test sets consist of a random split of 1100, 100, and 423 characters, respectively.
When augmented this results in 4400 training, 400 validation, and 1292 test classes, each having 20 character instances.
For C -way, k c -shot classiﬁcation, training proceeds in an episodic manner.
Each training iteration consists of a batch of one or more tasks.
For each task C classes are selected at random from the training set.
During training, k c character instances are used as training inputs and 15 character instances are used as test inputs.
The validation set is used to monitor the progress of learning and to select the best model to test, but does not affect the training process.
Final evaluation of the trained model is done on 600 randomly selected tasks from the test set.
During evaluation, k c character instances are used as training inputs and k c character instances are used as test inputs.
We use the Adam (Kingma and Ba, 2015) optimizer with a constant learning rate of 0.0001 with 16 tasks per batch to train all models.
The 5-way - 5-shot and 5-way - 1-shot models are trained for 80,000 iterations while the 20-way5-shot model is trained for 60,000 iterations, and the 20-way - 1-shot model is trained for 100, iterations.
In addition, we use a Gaussian form for q and set the number of ψ samples to L = 10 .
D. mini I MAGE NET F EW - SHOT C LASSIFICATION T RAINING P ROCEDURE
mini ImageNet (Vinyals et al., 2016) is a dataset of 60,000 color images that is sub-divided intoclasses, each with 600 instances.
The images have dimensions of 84 × 84 pixels.
For our experiments, we use the 64 training, 16 validation, and 20 test class splits deﬁned by (Ravi and Larochelle, 2017).
Training proceeds in the same episodic manner as with Omniglot.
We use the Adam (Kingma and Ba, 2015) optimizer and a Gaussian form for q and set the number of ψ samples to L = 10 .
For the 5-way - 5-shot model, we train using 4 tasks per batch for 100,000 iterations and use a constant learning rate of 0.0001.
For the 5-way - 1-shot model, we train with 8 tasks per batch for 50,000 iterations and use a constant learning rate of 0.00025.
D. F EW - SHOT C LASSIFICATION N ETWORK A RCHITECTURES
Tables D.1 to D.4 detail the neural network architectures for the feature extractor θ , amortization network φ , and linear classiﬁer ψ , respectively.
The feature extraction network is very similar to that used in (Vinyals et al., 2016).
The output of the amortization network yields mean-ﬁeld Gaussian parameters for the weight distributions of the linear classiﬁer ψ .
When sampling from the weight distributions, we employ the local-reparameterization trick (Kingma et al., 2015), that is we sample from the implied distribution over the logits rather than directly from the variational distribution.
To reduce the number of learned parameters, we share the feature extraction network θ with the pre-processing phase of the amortizaion network ψ .
Omniglot Shared Feature Extraction Network ( θ ): ˜ x
→ h θ (˜ x )
Output size
Layers [Table]
14 × 14 ×conv2d ( 3 × 3 , stride 1, SAME, RELU), dropout, pool ( 2 × 2 , stride 2, SAME) 7 × 7 ×conv2d ( 3 × 3 , stride 1, SAME, RELU), dropout, pool ( 2 × 2 , stride 2, SAME) 4 × 4 ×conv2d ( 3 × 3 , stride 1, SAME, RELU), dropout, pool ( 2 × 2 , stride 2, SAME) 2 × 2 ×
[Table]
conv2d ( 3 × 3 , stride 1, SAME, RELU),
[Table]
, pool (
[Table]
[Table]
SAME
[Table]
ﬂatten mini ImageNet Shared Feature Extraction Network ( θ ): ˜ x
→ h θ (˜ x )
Output size
Layers
[Table]
ﬂatten
E
S HAPE N ET E XPERIMENTATION D ETAILS
E.
V IEW R ECONSTRUCTION T RAINING P ROCEDURE AND N ETWORK A RCHITECTURES
ShapeNetCore v2 (Chang et al., 2015) is an annotated database of 3D objects covering 55 common object categories with ∼ 51,300 unique objects.
For our experiments, we use 12 of the largest object categories.
Refer to Table E.1 for a complete list.
We concatenate all instances from all 12 of the
[Table] [Table]
object categories together to obtain a dataset of 37,108 objects.
This concatenated dataset is then randomly shufﬂed and we use 70% of the objects (25,975 in total) for training, 10% for validation (3,710 in total)
[Table]
and 20% (7423 in total) for testing.
For each object
[Table]
we generate V = 36 , 128 ×pixel image views spaced evenly every 10 degrees in azimuth around the object.
We then convert the rendered images to gray-scale and reduce their size to be 32 × 32 pixels.
Again, we train our model in an episodic manner.
Each training iteration consists a batch of one or more tasks.
For each task an object is selected at random from the training set.
We train on a single view selected at random from the V = 36 views associated with each object and use the remaining 35 views to evaluate the objective function.
We then generate 36 views of the object with a modiﬁed version of our amortization network which is shown diagrammatically in Fig. 3.
To evaluate the system, we generate views and compute quantitative metrics over the entire test set.
Tables E.2 to E.4 describe the network architectures for the encoder, amortization
[Table]
and generator networks, respectively.
To train, we use the Adam (Kingma and Ba, 2015) optimizer with a constant learning rate of 0.0001 with 24 tasks per batch for 500, training iterations.
In addition, we set d φ = 256 , d ψ = 256 and number of ψ samples to
[Table]
[Table] [Table] [Table]
[Table]
3 × 3 , stride 2, SAME, RELU) 8 × 8 ×deconv2d ( 3 × 3 , stride 2, SAME, RELU) {+
+} × 16 ×deconv2d ( 3 × 3 , stride 2, SAME, RELU) 32 × 32 ×deconv2d ( 3 × 3 , stride 2, SAME, sigmoid)