Injectivity of ReLU networks: perspectives from statistical physics

02/27/2023
by   Antoine Maillard, et al.
0

When can the input of a ReLU neural network be inferred from its output? In other words, when is the network injective? We consider a single layer, x ↦ReLU(Wx), with a random Gaussian m × n matrix W, in a high-dimensional setting where n, m →∞. Recent work connects this problem to spherical integral geometry giving rise to a conjectured sharp injectivity threshold for α = m/n by studying the expected Euler characteristic of a certain random set. We adopt a different perspective and show that injectivity is equivalent to a property of the ground state of the spherical perceptron, an important spin glass model in statistical physics. By leveraging the (non-rigorous) replica symmetry-breaking theory, we derive analytical equations for the threshold whose solution is at odds with that from the Euler characteristic. Furthermore, we use Gordon's min–max theorem to prove that a replica-symmetric upper bound refutes the Euler characteristic prediction. Along the way we aim to give a tutorial-style introduction to key ideas from statistical physics in an effort to make the exposition accessible to a broad audience. Our analysis establishes a connection between spin glasses and integral geometry but leaves open the problem of explaining the discrepancies.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/25/2019

Computation of the Expected Euler Characteristic for the Largest Eigenvalue of a Real Non-central Wishart Matrix

We give an approximate formula for the distribution of the largest eigen...
research
03/25/2019

Computations of the Expected Euler Characteristic for the Largest Eigenvalue of a Real Wishart Matrix

We give an approximate formula of the distribution of the largest eigenv...
research
10/29/2020

Algorithmic pure states for the negative spherical perceptron

We consider the spherical perceptron with Gaussian disorder. This is the...
research
08/03/2023

Upper bounds on the 2-colorability threshold of random d-regular k-uniform hypergraphs for k≥ 3

For a large class of random constraint satisfaction problems (CSP), deep...
research
03/24/2023

Euler Characteristic Tools For Topological Data Analysis

In this article, we study Euler characteristic techniques in topological...
research
09/22/2020

The Ising antiferromagnet and max cut on random regular graphs

The Ising antiferromagnet is an important statistical physics model with...
research
07/18/2023

Convex Geometry of ReLU-layers, Injectivity on the Ball and Local Reconstruction

The paper uses a frame-theoretic setting to study the injectivity of a R...

Please sign up or login with your details

Forgot password? Click here to reset