Heavy-tailed random weights in square feedforward DNNs produce multiple stable fixed point attractors, while Gaussian weights yield a single fixed point, with a non-monotone dependence on depth.
Fixed points of nonnegative neural networks
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We use fixed point theory to analyze nonnegative neural networks, which we define as neural networks that map nonnegative vectors to nonnegative vectors. We first show that nonnegative neural networks with nonnegative weights and biases can be recognized as monotonic and (weakly) scalable mappings within the framework of nonlinear Perron-Frobenius theory. This fact enables us to provide conditions for the existence of fixed points of nonnegative neural networks having inputs and outputs of the same dimension, and these conditions are weaker than those recently obtained using arguments in convex analysis. Furthermore, we prove that the shape of the fixed point set of nonnegative neural networks with nonnegative weights and biases is an interval, which under mild conditions degenerates to a point. These results are then used to obtain the existence of fixed points of more general nonnegative neural networks. From a practical perspective, our results contribute to the understanding of the behavior of autoencoders, and we also offer valuable mathematical machinery for future developments in deep equilibrium models.
fields
cs.LG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Random weights of DNNs and emergence of fixed points
Heavy-tailed random weights in square feedforward DNNs produce multiple stable fixed point attractors, while Gaussian weights yield a single fixed point, with a non-monotone dependence on depth.