Generalization of Model-Agnostic Meta-Learning Algorithms: Recurring and Unseen Tasks

O. Bousquet and A. Elisseeff, “Stability and generalization,” Journal of machine learning research

2002

Earlier work this paper cites.

Springer, 2004

Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course · 2004

Earlier work this paper cites.

E. Hazan, A. Agarwal, and S. Kale, “Logarithmic regret algorithms for online convex optimization,” Machine Learning

2007

Earlier work this paper cites.

A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro, “Robust stochastic approximation approach to stochastic programming,” SIAM Journal on Optimization

2009

Earlier work this paper cites.

A. Rakhlin, O. Shamir, and K. Sridharan, “Making gradient descent optimal for strongly convex stochastic optimization,” arXiv preprint arXiv:1109.5647

Original

2011

Earlier work this paper cites.

F. Den Hollander, “Probability theory: The coupling method,” Lecture notes available online (http://websites. math. leidenuniv. nl/probability/lecturenotes/CouplingLectures. pdf)

2012

Earlier work this paper cites.

M. Andrychowicz, M. Denil, S. Gómez, M. W. Hoffman, D. Pfau, T. Schaul, B. Shillingford, and N. de Freitas, “Learning to learn by gradient descent by gradient descent,” in Advances in Neural Information Processing Systems 29

2016

Earlier work this paper cites.

M. Hardt, B. Recht, and Y. Singer, “Train faster, generalize better: Stability of stochastic gradient descent,” in International Conference on Machine Learning

2016

Earlier work this paper cites.

C. Finn, P. Abbeel, and S. Levine, “Model-agnostic meta-learning for fast adaptation of deep networks,” in Proceedings of the 34th International Conference on Machine Learning

2017

Earlier work this paper cites.

B. Baker, O. Gupta, N. Naik, and R. Raskar, “Designing neural network architectures using reinforcement learning,” in International Conference on Learning Representations

2017

Earlier work this paper cites.

B. Zoph and Q. V. Le, “Neural architecture search with reinforcement learning,” in International Conference on Learning Representations

2017

Earlier work this paper cites.

S. Ravi and H. Larochelle, “Optimization as a model for few-shot learning,” in International Conference on Learning Representations

2017

Earlier work this paper cites.

Z. Li, F. Zhou, F. Chen, and H. Li, “Meta-SGD: Learning to learn quickly for few-shot learning,” arXiv preprint arXiv:1707.09835

Original

2017

Cited alongside, same era.

A. Nichol, J. Achiam, and J. Schulman, “On first-order meta-learning algorithms,” arXiv preprint arXiv:1803.02999

Original

2018

Cited alongside, same era.

B. Zoph, V. Vasudevan, J. Shlens, and Q. V. Le, “Learning transferable architectures for scalable image recognition,” in Proceedings of the IEEE conference on computer vision and pattern recognition

2018

Cited alongside, same era.

E. Grant, C. Finn, S. Levine, T. Darrell, and T. Griffiths, “Recasting gradient-based meta-learning as hierarchical bayes,” in International Conference on Learning Representations

2018

Cited alongside, same era.

A. Nichol, J. Achiam, and J. Schulman, “On first-order meta-learning algorithms,” arXiv preprint arXiv:1803.02999

R. Bassily, V. Feldman, K. Talwar, and A. Guha Thakurta, “Private stochastic convex optimization with optimal rates,” Advances in Neural Information Processing Systems

2019

Later among the works it cites.

A. Fallah, A. Mokhtari, and A. Ozdaglar, “On the convergence theory of gradient-based model-agnostic meta-learning algorithms,” in International Conference on Artificial Intelligence and Statistics

2020

Later among the works it cites.

R. Xu, L. Chen, and A. Karbasi, “Meta learning in the continuous time limit,” arXiv preprint arXiv:2006.10921

Original

2020

Later among the works it cites.

K. Ji, J. Yang, and Y. Liang, “Multi-step model-agnostic meta-learning: Convergence and improved algorithms,” arXiv preprint arXiv:2002.07836

Original

2020

Later among the works it cites.