Asymptotics of Learning with Deep Structured (Random) Features
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929379812048896 |
|---|---|
| author | Schröder, Dominik Dmitriev, Daniil Cui, Hugo Loureiro, Bruno |
| author_facet | Schröder, Dominik Dmitriev, Daniil Cui, Hugo Loureiro, Bruno |
| contents | For a large class of feature maps we provide a tight asymptotic characterisation of the test error associated with learning the readout layer, in the high-dimensional limit where the input dimension, hidden layer widths, and number of training samples are proportionally large. This characterization is formulated in terms of the population covariance of the features. Our work is partially motivated by the problem of learning with Gaussian rainbow neural networks, namely deep non-linear fully-connected networks with random but structured weights, whose row-wise covariances are further allowed to depend on the weights of previous layers. For such networks we also derive a closed-form formula for the feature covariance in terms of the weight matrices. We further find that in some cases our results can capture feature maps learned by deep, finite-width neural networks trained under gradient descent. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_13999 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Asymptotics of Learning with Deep Structured (Random) Features Schröder, Dominik Dmitriev, Daniil Cui, Hugo Loureiro, Bruno Machine Learning Disordered Systems and Neural Networks Statistics Theory For a large class of feature maps we provide a tight asymptotic characterisation of the test error associated with learning the readout layer, in the high-dimensional limit where the input dimension, hidden layer widths, and number of training samples are proportionally large. This characterization is formulated in terms of the population covariance of the features. Our work is partially motivated by the problem of learning with Gaussian rainbow neural networks, namely deep non-linear fully-connected networks with random but structured weights, whose row-wise covariances are further allowed to depend on the weights of previous layers. For such networks we also derive a closed-form formula for the feature covariance in terms of the weight matrices. We further find that in some cases our results can capture feature maps learned by deep, finite-width neural networks trained under gradient descent. |
| title | Asymptotics of Learning with Deep Structured (Random) Features |
| topic | Machine Learning Disordered Systems and Neural Networks Statistics Theory |
| url | https://arxiv.org/abs/2402.13999 |