We analyze the topological properties of the set of functions that can be implemented by neural networks of a fixed size. Surprisingly, this set has many undesirable properties. It is highly non-convex, except possibly for a few exotic activation functions. Moreover, the set is not closed with respect to Lᵖ Lp -norms, 0< p < ∞ 0<p<∞ , for all practically used activation functions, and also not closed with respect to the L^∞ L∞ -norm for all practically used activation functions except for the ReLU and the parametric ReLU. Finally, the function that maps a family of weights to the function computed by the associated network is not inverse stable for every practically used activation function. In other words, if f₁, f₂ f1,f2 are two functions realized by neural networks and if f₁, f₂ f1,f2 are close in the sense that f₁ - f₂ L^∞ ≤ ε ‖f1-f2‖L∞≤ε for ε > 0 ε>0 , it is, regardless of the size of ε ε , usually not possible to find weights w₁, w₂ w1,w2 close together such that each fᵢ fi is realized by a neural network with weights wᵢ wi . Overall, our findings identify potential causes for issues in the training procedure of deep learning such as no guaranteed convergence, explosion of parameters, and slow convergence.
No takes yet. Share an insight, caveat, or question.
Petersen et al. (2020) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: