Deep ReLU networks -- injectivity capacity upper bounds

We study deep ReLU feed forward neural networks (NN) and their injectivity abilities. The main focus is on precisely determining the so-called injectivity capacity. For any given hidden layers architecture, it is defined as the minimal ratio between number of network's outputs and inputs which ensures unique recoverability of the input from a realizable output. A strong recent progress in precisely studying single ReLU layer injectivity properties is here moved to a deep network level. In particular, we develop a program that connects deep l-layer net injectivity to an l-extension of the ℓ0 spherical perceptrons, thereby massively generalizing an isomorphism between studying single layer injectivity and the capacity of the so-called (1-extension) ℓ0 spherical perceptrons discussed in [82]. Random duality theory (RDT) based machinery is then created and utilized to statistically handle properties of the extended ℓ0 spherical perceptrons and implicitly of the deep ReLU NNs. A sizeable set of numerical evaluations is conducted as well to put the entire RDT machinery in practical use. From these we observe a rapidly decreasing tendency in needed layers' expansions, i.e., we observe a rapid expansion saturation effect. Only 4 layers of depth are sufficient to closely approach level of no needed expansion -- a result that fairly closely resembles observations made in practical experiments and that has so far remained completely untouchable by any of the existing mathematical methodologies.