pith. sign in

arxiv: 1812.06080 · v3 · pith:545D5DF3new · submitted 2018-12-14 · 💻 cs.LG · stat.ML

Reconciling meta-learning and continual learning with online mixtures of tasks

classification 💻 cs.LG stat.ML
keywords learningmeta-learningapproachhierarchicalinductivetaskswhenadvantageous
0
0 comments X
read the original abstract

Learning-to-learn or meta-learning leverages data-driven inductive bias to increase the efficiency of learning on a novel task. This approach encounters difficulty when transfer is not advantageous, for instance, when tasks are considerably dissimilar or change over time. We use the connection between gradient-based meta-learning and hierarchical Bayes to propose a Dirichlet process mixture of hierarchical Bayesian models over the parameters of an arbitrary parametric model such as a neural network. In contrast to consolidating inductive biases into a single set of hyperparameters, our approach of task-dependent hyperparameter selection better handles latent distribution shift, as demonstrated on a set of evolving, image-based, few-shot learning benchmarks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.