We’ve developed a simple meta-learning algorithm called Reptile which works by repeatedly sampling a task, performing stochastic gradient descent on it, and updating the initial parameters towards the final parameters learned on that task. Reptile is the application of the Shortest Descent algorithm to the meta-learning setting, and is mathematically similar to first-order MAML (which is a version
![Reptile: A scalable meta-learning algorithm](https://cdn-ak-scissors.b.st-hatena.com/image/square/612c6e1a7f2b29b69cf4c3cda8eac3e69d8956b0/height=288;version=1;width=512/https%3A%2F%2Fimages.openai.com%2Fblob%2Fdd315656-1fce-424d-8b36-e7065a9e8c0e%2Freptile.jpg%3Ftrim%3D385%252C0%252C402%252C0%26width%3D1000%26quality%3D80)