3. (Sections  and ) Third, we extend the generalization result from [1]}, giving a Rademacher complexity bound on the generalization error of new tasks in the convex hull of existing meta-training tasks. In addition, we validate the superiority of our formulation, as well as convergence and generalization results, on sinusoid regression and representation learning settings.
