higher is a pytorch library allowing users to obtain higher order gradients over losses spanning training loops rather than individual training steps.
Many (but not all) approaches self-qualifying as "meta-learning" in deep learning and reinforcement learning fit a common pattern of approximating the solution to a nested optimization problem. In this paper, we give a formalization of this shared pattern, which we call GIMLI, prove its general requirements, and derive a general-purpose algorithm for implementing similar approaches. Based on this analysis and algorithm, we describe a library of our design, higher, which we share with the community to assist and enable future research into these kinds of meta-learning approaches. We end the paper by showcasing the practical applications of this framework and library through illustrative experiments and ablation studies which they facilitate.READ FULL TEXT VIEW PDF
By searching for shared inductive biases across tasks, meta-learning pro...
Meta-learning researchers face two fundamental issues in their empirical...
Meta-learning (a.k.a. learning to learn) has recently emerged as a promi...
The field of meta-learning, or learning-to-learn, has seen a dramatic ri...
This paper briefly reviews the history of meta-learning and describes it...
Deep neural networks can achieve great successes when presented with lar...
We study the problem of learning associative memory – a system which is ...
higher is a pytorch library allowing users to obtain higher order gradients over losses spanning training loops rather than individual training steps.
Although it is by no means a new subfield of machine learning research(see e.g. Schmidhuber, 1987; Bengio, 2000; Hochreiter et al., 2001), there has recently been a surge of interest in meta-learning (e.g. Maclaurin et al., 2015; Andrychowicz et al., 2016; Finn et al., 2017). This is due to the methods meta-learning provides, amongst other things, for producing models that perform well beyond the confines of a single task, outside the constraints of a static dataset, or simply with greater data efficiency or sample complexity. Due to the wealth of options in what could be considered “meta-” to a learning problem, the term itself may have been used with some degree of underspecification. However, it turns out that many meta-learning approaches, in particular in the recent literature, follow the pattern of optimizing the “meta-parameters” of the training process by nesting one or more inner loops in an outer training loop. Such nesting enables training a model for several steps, evaluating it, calculating or approximating the gradients of that evaluation with respect to the meta-parameters, and subsequently updating these meta-parameters.
This paper makes three contributions. First, we propose a formalization of this general process, which we call Generalized Inner Loop Meta-Learning (Gimli), and show that it subsumes several recent approaches. The proposed formalism provides tooling for analysing the provable requirements of the meta-optimization process, and allows for describing the process in general terms. Second, we derive a general algorithm that supports the implementation of various kinds of meta-learning fitting within the Gimli
framework and its requirements. Third, based on this analysis and algorithm, we describe a lightweight PyTorch library that enables the straightforward implementation of any meta-learning approach that fits within theGimli framework in canonical PyTorch, such that existing codebases require minimal changes, supporting third party module implementations and a variety of optimizers. Through a set of indicative experiments, we showcase the sort of research directions that are facilitated by our formalization and the corresponding library.
The overarching aim of this paper is not—emphatically—to purport some notion of ownership or precedence in any sense over existing efforts by virtue of having proposed a unifying formulation. Rather, in pointing out similarities under such unification, it provides theoretical and practical tools for facilitating further research in this exciting domain.
Whereby “meta-learning” is taken to mean the process of “learning to learn”, we can describe it as a nested optimization problem according to which an outer loop optimizes meta-variables controlling the optimization of model parameters within an inner loop. The aim of the outer loop should be to improve the meta-variables such that the inner loop produces models which are more suitable according to some criterion. In this section, we will formalize this process, which we call Generalized Inner Loop Meta-Learning (Gimli). We will define our terms in Section 2.1, give a formal description of the inner and outer loop’s respective optimization problems in Section 2.2 and 2.3, followed by a description and proof of the requirements under which the process can be run in Section 2.4. Finally, in Section 2.5 we describe an algorithm which permits an efficient and exact implementation of Gimli, agnostic to the model and optimizers used (subject to the requirements of Section 2.4 being satisfied).
Without loss of generality, let us assume we wish to train a model parameterized by . Let
describe some collection of possibly unrelated “meta-parameters” describing some aspect of the process by which we train our model. These could be, for example the learning rate or some other real-valued hyperparameters, task loss weights in multi-task learning, or perhaps the initialization of the model weights at the beginning of training. For disambiguation, we will refer to the subset ofdescribing optimization parameters by , and those meta-parameters which parameterize aspects of the training loss calculation at every step (e.g. the loss itself, the task mixture, regularization terms, etc) by , i.e. . We will give several concrete examples in Section 3.
Let be a function of and
corresponding to the overall training objective we seek to minimize directly or indirectly (e.g. via an upper bound, a Monte Carlo estimate of an expectation, etc). Other elements of the objective such as the dataset, and hyperparameters or other aspects of training not covered by, are assumed to be implicit and held fixed in for notational simplicity. With this, the process by which we train a model to obtain test-time parameters can be formalized as shown in Equation 1111Throughout this paper, we will write in functional form as follows to facilitate formalizing nested optimization, with a variable and an expression (presumably a function of ):
We assume that this search will be performed using an iterative gradient-based method such as some form of gradient descent as formalized in Section 2.2, and thus that the derivative exists, as an obvious requirement.
Furthermore, and without loss of generality, let be a function exclusively of (except the specific case where describes some aspect of the model, e.g. initialization, as is done in MAML (Finn et al., 2017)) describing some objective we wish to measure the post-training performance of the model against. This could be a validation set from the same task the model was trained on, from a collection of other tasks, or some other measure of the quality of the model parameterized by . Typically, the aforementioned iterative process is not run to convergence, but rather to the point where an intermediate set of model parameters is considered satisfactory according to some criterion (e.g. best model under for a fixed budget of training steps, or after no improvement is seen for a certain number of training steps, etc.), and these intermediate parameters will serve as .
The process by which we typically estimate against decomposes into a sequence of updates of . At timestep , we compute from by first computing a step-specific loss . Note that this loss may itself also be a function of step-specific factors, such as the training data used for that timestep, which we leave implicit here for notational simplicity. Following this, we typically compute or estimate (e.g. as in reinforcement learning) the gradients of this loss with regard to
, by using algorithms such as backpropagation(Rumelhart et al., 1985). We then typically use an optimizer to “apply” these gradients to the parameters to obtain updated parameters . As such, optimization processes such as e.g. Adagrad (Duchi et al., 2011) may be stateful, in that they exploit gradient history to produce adaptive “local” learning rates. Because some aspects of the optimization process may be covered by our choice of , we denote this optimization step at time-step by as shown in Equation 2, where timestep-specific attributes of the optimizer are left implicit by our use of the step subscript.
For example, where we might use SGD as an optimizer, with the learning-rate being a meta-variable , we could instantiate equation 2 as follows:
From this we see that the optimization process used to train a variety of model types, with a variety of optimization methods, can be described as a function yielding test-time model parameters potentially as a function of parameter history and of meta-parameters (if any exist). While this may seem like a fairly trivial formalization of a ubiquitous training process, we will see in Section 2.4 that if a few key requirements are met, this process can be nested as the inner loop within an outer loop containing—amongst other things—a meta-training process. From this process, described in Section 2.3, we estimate values of which improve our training process against some external metric.
We now describe the outer loop optimization problem which wraps around the inner loop described in Section 2.2. Through this process, we seek a value which ensures that the training process produces parameters which perform best against some metric which we care about. The formalization and decomposition of this “meta-training process” into nested optimization problems is shown in Equation 4.
In this section, we introduce a formalization of an iterative process allowing us to approximate this nested optimization process. Furthermore, we describe a general iterative algorithm by which the process in Equation 4 can be approximated by gradient-based methods while jointly estimating according to the process in Equation 1.
An iterative process by which we can estimate given Equation 4 following the sort of decomposition of the training process described Equation 1 into the training process described in Equations 2–3 is described below. Essentially, an estimate of is obtained following steps training as outlined in Equation 3, which is then evaluated against . The gradient of this evaluation, is then obtained through backpropagation, and used to update . Using as time-step counter to symbolize the time-scale being different from that used in the “inner loop”, we formalize this update in Equation 5 where denotes the optimization process used to update using at that time-step.
—to be possible, a few key requirements must be met. We enumerate them here, and then discuss the conditions under which they are met, either analytically or through choice of model, loss function, or optimizer.
is a differentiable function of its input, i.e. the derivative exists.
The optimization process in Equation 2 is a differentiable222For stateful optimizers, we assume that, where the state is itself a function of previous values of the network parameters (e.g. moving averages of parameter weights), it is included in the computation of gradients of the meta-loss with regard to those parameters. function of and .
Either or both of the following conditions hold:
there exist continuous optimization hyperparameters (e.g. a learning rate ) covered by (e.g. ) and in Equation 2 is a differentiable function of , or
In the remainder of this section, we show that based on the assumptions outlined in Section 2.1, namely the existence of gradients on the validation objective with regard to model parameters and of gradients on the training objective with regard to both model parameters and meta-parameters , there exist gradients on the validation objective with regard to . We will then, in the next section, demonstrate how to implement this process by specifying an update algorithm for meta-variables.
Implementing an iterative process as described in Equation 5
will exploit the chain rule for partial derivatives in order to run backpropagation. The structure of the recurrence means we need to ensure thatexists for in order to compute, for all such , gradient paths . We can prove this exists in virtue of the chain rule for partial derivatives and the requirements above:
By the chain rule, exists if exists (and it does, by Requirement I) and exists.
Idem, exists by recursion over if for all , exists, which is precisely what Requirement 2 guarantees.
For , the gradients trivially exist as a consequence of Requirement IIIa.
Putting these both together, and having covered the union of and by exhaustion, we have shown that the gradients can be obtained by composition over the gradient paths for all . In Section 2.5 we show how to implement the exact and efficient calculation of . To complete this section, we indicate the conditions under which requirements I–III hold in practice.
is simply a function of the choice of evaluation metric used to evaluate the model after training as part of. If this is not a differentiable function of , e.g. BLEU (Papineni et al., 2002) in machine translation, then a proxy metric can be selected for meta-training (e.g. negative log-likelihood of held out data), or gradient estimation methods such as REINFORCE (Williams, 1992) can be used.
Requirement 2 is a function of the choice of optimizer, but is satisfied for most popular optimizers. We directly prove that this requirement holds for SGD (Robbins and Monro, 1951) and for Adagrad (Duchi et al., 2011) in Appendix A, and prove it by construction for a wider class of common optimizers in the implementation and tests of the software library described in Section 4.
Requirement IIIa is a function of the choice of hyperparameters and optimizer, but is satisfied for at least the learning rate in most popular optimizers. Requirement IIIb is a function of the choice of loss function (or class thereof), in that needs to exist and be a differentiable function of . Usually, this requirement is held where is a multiplicative modifier of . For algorithms such as Model Agnostic Meta-Learning (Finn et al., 2017, MAML), this requirement is equivalent to saying that the Hessian of the loss function with regard to the parameters exists.
In Algorithm 1, we present the algorithm which permits the computation of updates to meta-variables through the nested iterative optimization process laid out above. To clearly disentangle different gradient paths, we employ the mathematical fiction that is the “stop-gradient” operator, which is defined as an operator which maintains the truth of the following expression:
As will be shown below, this will allow us to decompose the computation of updates to the meta-variables through an arbitrarily complex training process, agnostic to the models and optimizers used (subject to the requirements of Section 2.4 being satisfied), into a series of local updates passing gradient with regard to the loss back through the inner loop steps. This is akin to backpropagation through time (BPTT; Rumelhart et al., 1985), a method which has been adapted to other nested optimization processes with various constraints or restrictions (Andrychowicz et al., 2016; Franceschi et al., 2017, 2018).
Each iteration through the loop defined by lines 1–17 does one gradient-based update of meta-parameters using the optimizer employed in line 16. Each such iteration, we first (line 3) copy the model and optimizer state (generally updated through some outer loop within which this update loop sits). We then (lines 4–7) compute a series of updates on a copy of the model, preserving the intermediate gradient computations , intermediate model parameters (sometimes confusingly referred to as “fast weights”, following Hinton and Plaut (1987), within the meta-learning literature), and all associated activations. These will be reused in the second stage (lines 10–15) to backpropagate higher-order gradients of the meta-loss, computed on line 9 through the optimization process that was run in lines 4–7. In particular, in lines 12 and 13, local (i.e. time step-specific) gradient calculations compute part of the gradient of and , which is stored in accumulators which contain the exact respective gradients by the end of loop. What permits this efficient local computation is the dynamic programming calculation of the partial derivative as function of only and timestep-specific gradients, implementing a second-order variant of BPTT.
In this section, we highlight some instances of meta-learning which are instances of Gimli, before discussing related approaches involving support for nested optimization, with applications to similar problems. The aim is not to provide a comprehensive literature review, which space would not permit. Rather, in pointing out similarity under our Gimli formulation, we aim to showcase that rich and diverse research has been done using this class of approaches, where yet more progress indubitably remains to be made. This is, we believe, the strongest motivation for the development of libraries such as the one we present in Section 4 to support the implementation of algorithms that fall under the general algorithm derived in Section 2.
Many of the papers referenced below contain excellent and thorough reviews of the literature most related to the type of meta-learning they approach. In the interest of brevity, we will not attempt such a review here, but rather focus on giving examples of a few forms of meta-learning that fit the Gimli framework (and thus are supported by the library presented in Section 4), and briefly explain why.
One popular meta-learning problem is that of learning to optimize hyperparameters through gradient-based methods (Bengio, 2000; Maclaurin et al., 2015; Luketina et al., 2016; Franceschi et al., 2017), as an alternative to grid/random search (Bergstra and Bengio, 2012) or Bayesian Optimization (Mockus et al., 1978; Pelikan et al., 1999; Bergstra et al., 2011; Snoek et al., 2012). Here, select continuous-valued hyperparameters are meta-optimized against a meta-objective, subject to the differentiability of the optimization step, and, where relevant, the loss function. This corresponds to Requirements 2 and IIIa of Section 2.4 being met, i.e. Gimli being run with select optimizer hyperparameters as part of .
A related problem is that of learning the optimizer wholesale as a parametric model(Hochreiter et al., 2001; Andrychowicz et al., 2016; Duan et al., 2016), typically based on recurrent architectures. Again, here the optimizer’s own parameters are the optimizer hyperparameters, and constitute the entirety of as used within Gimli. Requirements 2 and IIIa are trivially met through the precondition that such optimizers models have parameters with regard to which their output (and losses that are a function thereof) is differentiable.
More recently, meta-learning approaches such as MAML (Finn et al., 2017; Antoniou et al., 2018) and its variants/extensions have sought to use higher-order gradients to meta-learn model/policy initializations in few-shot learning settings. In Gimli, this corresponds to setting , which then is not an explicit function of in Equation 3, but rather is implicitly its argument through updates to the inner model over the unrolled optimization. All requirements in Section 2.4 must be satisfied (save IIIa, with Requirement IIIb further entailing that be defined such that the second derivative of the function with regard to exists (i.e. is non-zero).
Finally, recent work by Chebotar et al. (2019) has introduced the ML framework for learning unconstrained loss functions as parametric models, through exploiting second-order gradients of a meta-loss with regard to the parameters of the inner loss. This corresponds, in Gimli, to learning a parametric model of the loss parameterized by .
In a sense, many if not all of the approaches discussed in Section 3.1 qualify as “related work”, but here we will briefly discuss approaches to the general problem of formalizing and supporting implementations of problems that fit within the nested optimization specified by Gimli.
The first is work by Franceschi et al. (2018) which describes how several meta-learning and hyperparameter optimization approaches can be cast as a bi-level optimization process, akin to our own formalization in 2.3. This fascinating and relevant work is highly complementary to the formalization and discussion presented in our paper. Whereas we focus on the requirements according to which gradient-based solutions to approaches based on nested optimization problems can be found in order to drive the development of a library which permits such approaches to be easily and scalably implemented, their work focuses on analysis of the conditions under which exact gradient-based solutions to bi-level optimization processes can be approximated, and what convergence guarantees exist for such guarantees. In this sense, this is more relevant to those who wish to analyze and extend alternatives to first-order approximations of algorithms such as MAML, e.g. see work of Nichol and Schulman (2018) or Rajeswaran et al. (2019).
On the software front, the library learn2learn (Arnold et al., 2019)333To cite this effort, we have ordered authors as shown on the repository contributors page (https://github.com/learnables/learn2learn/graphs/contributors). We hope this will not offend. addresses similar problems to that which we will present in Section 4. This library focuses primarily on providing implementations of existing meta-learning algorithms and their training loops that can be extended with new models. In contrast, the library we present in Section 4 is “closer to the metal”, aiming to support the development of new meta-learning algorithms fitting the Gimli definitions with as little resort to non-canonical PyTorch as possible. A recent parallel effort, Torchmeta (Deleu et al., 2019) also provides a library aiming to assist the implementation of meta-learning algorithms, supplying useful data-loaders for meta-training. However, unlike our approach described in 4, it requires re-implementation of models using their functional/stateless building blocks, and for users to reimplement the optimizers in a differentiable manner.
In this section, we provide a high-level description of the design and capabilities of unnamedlib,444Available at https://github.com/facebookresearch/higher. a PyTorch (Paszke et al., 2017) library aimed at enabling implementations of Gimli with as little reliance on non-vanilla PyTorch as possible. In this section, we first discuss the obstacles that would prevent us from implementing this in popular deep learning frameworks, how we overcame these in PyTorch to implement Gimli. Additional features, helper functions, and other considerations when using/extending the library are provided in its documentation.
Many deep learning frameworks offer the technical functionality required to implement Gimli, namely the ability to take gradients of gradients. However, there are two aspects of how we implement and train parametric models in such frameworks which inhibit our ability to flexibly implement Algorithm 1.
The first obstacle is that models are typically implemented statefully (e.g. torch.nn in PyTorch, keras.layers
in Keras(Chollet and others, 2015), etc.), meaning that the model’s parameters are encapsulated in the model implementation, and are implicitly relied upon during the forward pass. Therefore while such models can be considered as functions theoretically, they are not pure functions practically, as their output is not uniquely determined by their explicit input, and equivalently the parameters for a particular forward pass typically cannot be trivially overridden or supplied at call time. This prevents us from tracking and backpropagating over the successive values of the model parameters within the inner loop described by Equation 3, through an implicit or explicit graph.
The second issue is that, as discussed at the end of Section 2.4 and in Appendix A, even though the operations used within popular optimizers are mathematically differentiable functions of the parameters, gradients, and select hyperparameters, these operations are not tracked in various framework’s implicit or explicit graph/gradient tape implementations when an optimization step is run. This is with good reason: updating model parameters in-place is memory efficient, as typically there is no need to keep references to the previous version of parameters. Ignoring the gradient dependency formed by allowing backpropagation through an optimization step essentially makes it safe to release memory allocated to historical parameters and intermediate model states once an update has been completed. Together, these obstacles essentially prevent us from practically satisfying Requirement 2 of Section 2.4.
As we wish to track and backpropagate through intermediate states of parameters during the inner loop, we keep a record of such states which can be referenced during the backward pass stage of the outer loop in Algorithm 1. The typical way this is done in implementations of meta-learning algorithms such as MAML is to rewrite a “stateless” version of the inner loop’s model, permitting the use, in each invocation of the model’s forward pass, of weights which are otherwise tracked on the gradient graph/tape. While this addresses the issue, it is an onerous and limiting solution, as exploring new models within such algorithms invariably requires their reimplementation in a stateless style. This typically prevents the researcher from experimenting with third-party codebases, complicated models, or those which requiring loading pre-trained weights, without addressing a significant and unwelcome engineering challenge.
A more generic solution, permitting the use of existing stateful modules (including with pre-loaded activations), agnostic to the complexity or origin of the code which defines them, is to modify the run-time instance of the model’s parent class to render them effectively function, a technique often referred to as “monkey-patching”. The high-level function unnamedlib.monkeypatch() does this by taking as argument a torch.nn.Module instance and the structure of its nested sub-modules. As it traverses this structure, it clones the parent classes of submodule instances, leaving their functionality intact save for that of the forward method which implements the forward pass. Here, it replaces the call to the forward method with one which first replaces the stateful parameters of the submodule with ones provided as additional arguments to the patched forward, before calling the original class’s bound forward method, which will now used the parameters provided at call time. This method is generic and derived from first-principles analysis of the torch.nn.Module implementation, ensuring that any first or third-party implementation of parametric models which are subclasses of torch.nn.Module and do not abuse the parent class at runtime will be supported by this recursive patching process.
Again, as part of our need to make the optimization process differentiable in order to satisfy Requirement 2 of Section 2.4, the typical solution is to write a version of SGD which does not modify parameters in-place, but treated as a differentiable function of the input parameters and hyperparameters akin to any other module in the training process. While this, again, is often considered a satisfactory solution in the meta-learning literature due to its simplicity, it too is limiting. Not only does the inability to experiment with other inner loop optimizers prevent research into the applicability of meta-learning algorithms to other optimization processes, the restriction to SGD also means that existing state-of-the-art methods used in practical domains cannot be extended using meta-learning methods such as those described in Section 3, lest they perform competitively when trained with SGD.
Here, while less generic, the solution provided by the high-level function unnamedlib.get_diff_optim() is to render a PyTorch optimizer instance differentiable by mapping its parent class to a differentiable reimplementation of the instance’s parent class. The reimplementation is typically a copy of the optimizer’s step logic, with in-place operations being replaced with gradient-tracking ones (a process which is syntactically simple to execute in PyTorch). To this, we add wrapper code which copies the optimizer’s state, and allows safe branching off of it, to permit “unrolling” of the optimization process within an inner loop (cf. the recurrence from Equation 3) without modifying the initial state of the optimizer (e.g. to permit several such unrolls, or to preserve state if inner loop optimizer is used elsewhere in the outer loop). Most of the optimizers in torch.optim are covered by this method. Here too, a runtime modification of the parent optimizer class could possibly be employed as was done for torch.nn.Modules, but this would involve modifying Python objects at a far finer level of granularity. We find that supporting a wide and varied class of optimizers is a sufficient compromise to enable further research.555 We also provide documentation as to how to write differentiable third party optimizers and supply helper functions such as unnamedlib.register_optim() to register them for use with the library at runtime.
In this section, we briefly present some results of experiments using select existing methods from Section 3.1, to show case how unnamedlib can be used to simply implement ablation studies and searches over model architectures, optimizers, and other aspects of an experiment. This could, naturally, be done without appeal to the library. However, in such cases, changing the model architecture or optimizer requires re-implementing the model functionally or optimization step differentiably. Here such changes require writing no new code (excluding the line where the model is defined).
As the first application for unnamedlib, we set up a simple meta-learning task where we meta-optimize the learning rate. Employing a handcrafted annealing schedule for learning rates has been the de facto approach to improving a learning algorithm. While scheduled annealing can help to boost the final performance, it usually requires significant hand-tuning of the schedule. In contrast, we adjust learning rates automatically using meta-learning, which unnamedlib enables for arbitary models and optimizers.
We take an image classification model
DenseNet-BC(k=12) (Huang et al., 2016), that provides competitive state-of-the-art results on CIFAR10, and modify its training procedure by replacing the multi-step annealing schedule of learning rate with a meta-optimizer. Specifically, we treat learning rate for each inner optimizer’s parameter group as a separate meta-parameter that we will meta-learn. Doing so allows individual model parameters to have finer learning rates, that are adjusted automatically. The Gimli algorithm provides for a clean implementation of such training procedure.
We first train two baseline variants of
DenseNet-BC(k=12) using setup from (Huang et al., 2016). In the first variant we keep the learning rate fixed to for all epochs, while the second configuration takes advantage of a manually designed multi-step annealing schedule, which drops learning rate by after and epochs. For the meta-learning variant, we split the training set into two disjoint pieces, one for training and another for validation, in proportion of . We then use per parameter group learning rates ( in total) for meta-optimization, initializing each learning rate to . We perform one meta-update step after each epoch, where we unroll inner optimizer for steps using batches from the training set, and compute meta-test error on the validation set over batches from the validation set. We use batch size of for meta-update, rather than as in the base training loop. We use Adam (Kingma and Ba, 2014) with default parameters as a choice for meta-optimizer. We average results over random seeds. Figure 1 demonstrates that our method is able reach the state-of-the-art performance faster.
The unnamedlib library enables the exploration of new MAML-like models and inner-loop optimizers, which historically has required non-trivial implementations of the fast-weights for the model parameters and inner optimizers as done in Antoniou et al. (2018); Deleu et al. (2019). These ablations can be important for squeezing the last few bits of accuracy on well-established tasks and baselines that are already near-optimal as shown in Chen et al. (2019), and is even more important for developing new approaches and tasks that deal with different kinds of data and require adaptation to be done over non-standard operations.
To illustrate how easy unnamedlib makes these ablations, in this section we take a closer look at different model architecture and optimizer choices for the MAML++ approach (Antoniou et al., 2018). MAML++ uses a VGG network with a SGD inner optimizer for the the Omniglot (Lake et al., 2015)
and Mini-Imagenet(Vinyals et al., 2016; Ravi and Larochelle, 2016) tasks. We start with the official MAML++ code and evaluation procedure and use unnamedlib to ablate across VGG, ResNet, and DenseNet models and SGD and Adam optimizers. We provide more details about these in Appendix B. We denote the combination of model and inner optimizer choice with
<model>+<opt>. One finding of standalone interest is that we have kept most of the features from MAML++, except we significantly increase the base
performance by using batch normalization in training mode everywhere as in(Finn et al., 2017)
instead of using per-timestep statistics and parameters as MAML++ proposes. In theory, this enables more inner optimization steps to be rolled out at test time, which otherwise is not possible with MAML++ because of the per-timestep information, for simplicity in this paper we have not explored this and keep every algorithm, optimizer, and mode to five inner optimization steps. When using Adam as the inner optimizer, we initialize the first and second moment statistics to the statistics from the outer optimizer, which is also Adam, and learn per-parameter-group learning rates and rolling averagecoefficients. Our results in Table 1 show that we are able to push the accuracy of MAML++ slightly up with this ablation. We note that this pushes the performance of MAML++ closer to that of state-of-the-art methods such as LEO (Rusu et al., 2018). Appendix B shows our full experimental results, and we note that in some cases Adam slightly outperforms SGD for a particular model.
To summarize, we have presented Gimli, a general formulation of a wide class of existing and potential meta-learning approaches, listed and proved the requirements that must be satisfied for such approaches to be possible, and specified a general algorithmic formulation of such approaches. We’ve described a lightweight library, unnamedlib, which extends PyTorch to enable the easy and natural implementation of such meta-learning approaches at scale. Finally we’ve demonstrated some of its potential applications. We hope to have made the case not only for the use of the mathematical and software tools we present here, but have also provided suitable encouragement for other researchers to use them and explore the boundaries of what can be done within this broad class of meta-learning approaches.
International Conference on Artificial Neural Networks, pp. 87–94. Cited by: §1, §3.1.
Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation-Volume 1, pp. 525–532. Cited by: §3.1.
Table 2 shows all of the architectures and optimizers we ablated. The table is missing some rows as we only report the results that successfully completed running three seeds within three days on our cluster.
We use the following model architectures, which closely resemble the vanilla PyTorch examples for these architectures but are modified to be smaller for the few-shot classification setting:
resnet-N is the ResNet architecture (He et al., 2016).
resnet-4 corresponds to the four blocks having
just a single layer, and
have respectively 2 and 3 layers in each block
densenet-8 is the DenseNet architecture (Huang et al., 2017)
with 2 layers in each block
We follow TADAM (Oreshkin et al., 2018) and do not use the initial convolutional projection layer common in the full-size variants of the ResNet and DenseNet.
We can also visualize how the learning rates and rolling momentum terms
(with Adam) change over time when they are being learned.
We show this in Figure 2
and Figure 3 for the 20-way 1-shot
Omniglot experiment with the
which is especially interesting as Adam outperforms SGD in
We find that most of the SGD learning rates are decreased to
near-zero except for a few select few that seem especially
important for the adaptation.
Adam exhibits similar behavior with the learning rates where
most except for a select for are zeroed for the adaptation,
and the rolling moment coefficients are particularly interesting
where the first moment coefficient becomes relatively
evenly spread throughout the space while splits many
parameter groups between low and high regions of the space.