Approximate Spectral Decomposition of Fisher Information Matrix for Simple ReLU Networks

11/30/2021
by   Yoshinari Takeishi, et al.
0

We investigate the Fisher information matrix (FIM) of one hidden layer networks with the ReLU activation function and obtain an approximate spectral decomposition of FIM under certain conditions. From this decomposition, we can approximate the main eigenvalues and eigenvectors. We confirmed by numerical simulation that the obtained decomposition is approximately correct when the number of hidden nodes is about 10000.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/01/2021

Approximation Properties of Deep ReLU CNNs

This paper is devoted to establishing L^2 approximation properties for d...
research
07/27/2021

Convergence of Deep ReLU Networks

We explore convergence of deep neural networks with the popular ReLU act...
research
08/09/2022

On the Activation Function Dependence of the Spectral Bias of Neural Networks

Neural networks are universal function approximators which are known to ...
research
10/15/2019

Matrix Spectral Factorization for SA4 Multiwavelet

In this paper, we investigate Bauer's method for the matrix spectral fac...
research
04/19/2023

Points of non-linearity of functions generated by random neural networks

We consider functions from the real numbers to the real numbers, output ...
research
07/25/2022

Decision-oriented two-parameter Fisher information sensitivity using symplectic decomposition

The eigenvalues and eigenvectors of the Fisher information matrix (FIM) ...
research
11/23/2022

Dual Graphs of Polyhedral Decompositions for the Detection of Adversarial Attacks

Previous work has shown that a neural network with the rectified linear ...

Please sign up or login with your details

Forgot password? Click here to reset