Geometry and generalization: eigenvalues as predictors of where a network will fail to generalize
From MaRDI portal
Publication:2148963
Abstract: We study the deformation of the input space by a trained autoencoder via the Jacobians of the trained weight matrices. In doing so, we prove bounds for the mean squared errors for points in the input space, under assumptions regarding the orthogonality of the eigenvectors. We also show that the trace and the product of the eigenvalues of the Jacobian matrices is a good predictor of the MSE on test points. This is a dataset independent means of testing an autoencoder's ability to generalize on new input. Namely, no knowledge of the dataset on which the network was trained is needed, only the parameters of the trained model.
Recommendations
- Geometry of learning in multilayer perceptrons
- Geometry of learning: Visualizing the performance of neural network supervised training methods
- Geometrical aspects of discrimination by multilayer perceptrons
- High-dimensional dynamics of generalization error in neural networks
- scientific article; zbMATH DE number 2095982
- scientific article; zbMATH DE number 4211541
- A singular Riemannian geometry approach to deep neural networks. I: Theoretical foundations
- Hausdorff dimension, heavy tails, and generalization in neural networks*
Cites work
This page was built for publication: Geometry and generalization: eigenvalues as predictors of where a network will fail to generalize
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148963)