Adaptive Gradient-Based Meta-Learning Methods

By Mikhail Khodak, Maria-Florina Balcan, Ameet Talwalkar. 2019

397 citations recorded by the source corpus.

We build a theoretical framework for designing and understanding practical meta-learning methods that integrates sophisticated formalizations of task-similarity with the extensive literature on online convex optimization and sequential prediction algorithms. Our approach enables the task-similarity to be learned adaptively, provides sharper transfer-risk bounds in the setting of statistical learning-to-learn, and leads to straightforward derivations of average-case regret bounds for efficient algorithms in settings where the task-environment changes dynamically or the tasks share a certain geometric structure. We use our theory to modify several popular meta-learning algorithms and improve their meta-test-time performance on standard problems in few-shot learning and federated learning.

Subfields: Artificial Intelligence, Computational Mechanics, Optimization & Training, Meta & Continual Learning

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. Peter Richtárik
  2. Jakub Konecný
  3. Martin Jaggi
  4. Qiang Yang
  5. Sergey Levine
  6. Dacheng Tao
  7. Michael I. Jordan
  8. Aryan Mokhtari

In Computational Mechanics

  1. Peter Richtárik
  2. Jakub Konecný
  3. Jason D. Lee
  4. Michael I. Jordan
  5. Martin Jaggi
  6. Sebastian U. Stich
  7. Aryan Mokhtari
  8. Simon Shaolei Du

In Optimization & Training

  1. Peter Richtárik
  2. Jakub Konecný
  3. Martin Jaggi
  4. Sebastian U. Stich
  5. Aryan Mokhtari
  6. Virginia Smith
  7. Jianyu Wang
  8. Gauri Joshi

In Meta & Continual Learning

  1. Aryan Mokhtari
  2. Chelsea Finn
  3. Sergey Levine
  4. Alireza Fallah
  5. Asuman E. Ozdaglar
  6. Dacheng Tao
  7. Mikhail Khodak
  8. Ameet Talwalkar

Citations in the corpus