First-order ANIL provably learns representations despite overparametrization

2024-07-23

ICLR 2024International Conference on Learning Representations

First-order ANIL provably learns representations despite overparametrization

July 2024

Research context

Open in graph

Produces

Research objectConvergence guarantee

Representation recovery by first-order ANIL

In the linear infinite-task setting and under the stated initialization and step-size conditions, first-order ANIL asymptotically removes the component orthogonal to the true shared subspace, makes the learned initialization represent the zero function, and recovers a non-degenerate representation of the shared subspace despite overparameterization. An appendix refinement further gives a \(1/t\) decay rate for the squared orthogonal component.

Statement
\[\begin{gathered}\displaystyle \lim_{t\to\infty}\boldsymbol B_{\star,\perp}^{\top}\boldsymbol B_t=0,\qquad \lim_{t\to\infty}\boldsymbol B_t\boldsymbol w_t=0,\\[0.35em]\displaystyle \lim_{t\to\infty}\boldsymbol B_\star^\top\boldsymbol B_t\boldsymbol B_t^\top\boldsymbol B_\star=\boldsymbol\Lambda_\star\succ 0.\end{gathered}\]
\(t\)
outer-loop training iteration
\(\boldsymbol B_t\)
learned representation matrix at iteration \(t\)
\(\boldsymbol w_t\)
shared head initialization at iteration \(t\)
\(\boldsymbol B_\star\)
orthonormal basis for the true shared representation subspace
\(\boldsymbol B_{\star,\perp}\)
orthonormal basis for the complement of the true representation subspace
\(\boldsymbol\Lambda_\star\)
positive-definite limiting covariance on the true shared subspace
Research objectTheoretical guarantee

One-step adaptation in the intrinsic dimension

Once pretraining has reached the stated limit, the learned initialization represents the zero function. A single gradient step on a new task then satisfies a high-probability parameter-error bound governed by the true shared-subspace dimension rather than the ambient or overparameterized representation dimensions.

Statement
\[\left\|\widehat{\boldsymbol B}\boldsymbol w_{\mathrm{test}}-\boldsymbol B_\star\boldsymbol w_\star\right\|_2=\mathcal O\!\left(\frac{1+\overline\sigma^2/\lambda_{\min}(\boldsymbol\Sigma_\star)}{m_{\mathrm{in}}}\left\|\boldsymbol w_\star\right\|_2+\left\|\boldsymbol w_\star\right\|_2\sqrt{\frac{k}{m_{\mathrm{test}}}}+\sigma\sqrt{\frac{k}{m_{\mathrm{test}}}}\right)\]
\(m_{\mathrm{in}}\)
number of samples in each inner-loop update during pretraining
\(m_{\mathrm{test}}\)
number of observations from the new task
\(k\)
dimension of the true shared representation subspace
\(\overline\sigma^2\)
total task and observation-noise variance during pretraining
\(\sigma\)
sub-Gaussian observation-noise scale on the new task
\(\lambda_{\min}(\boldsymbol\Sigma_\star)\)
smallest eigenvalue of the task covariance
\(\widehat{\boldsymbol B}\)
representation matrix obtained after pretraining
\(\boldsymbol w_{\mathrm{test}}\)
new-task head after one gradient step
\(\boldsymbol B_\star\)
orthonormal basis for the true shared representation subspace
\(\boldsymbol w_\star\)
coordinates of the new task in the true shared subspace