Meta-Learning Requires Meta-Augmentation

By Janarthanan Rajendran, A. Irpan, Eric Jang. 2020

110 citations recorded by the source corpus.

Meta-learning algorithms aim to learn two components: a model that predicts targets for a task, and a base learner that quickly updates that model when given examples from a new task. This additional level of learning can be powerful, but it also creates another potential source for overfitting, since we can now overfit in either the model or the base learner. We describe both of these forms of metalearning overfitting, and demonstrate that they appear experimentally in common meta-learning benchmarks. We then use an information-theoretic framework to discuss meta-augmentation, a way to add randomness that discourages the base learner and model from learning trivial solutions that do not generalize to new tasks. We demonstrate that meta-augmentation produces large complementary benefits to recently proposed meta-regularization techniques.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Han-Jia Ye
  2. Wei-Lun Chao
  3. Tatsunori B. Hashimoto
  4. Stefan Zohren
  5. Stephen J. Roberts
  6. De-chuan Zhan
  7. Percy Liang
  8. Shikhar Murty

In Computer Vision and Pattern Recognition

  1. Han-Jia Ye
  2. Wei-Lun Chao
  3. De-chuan Zhan
  4. Tatsunori B. Hashimoto
  5. Stefan Zohren
  6. Bernt Schiele
  7. Shikhar Murty
  8. Stephen J. Roberts

Citations in the corpus