Pith. sign in

REVIEW 1 cited by

Fixed points of nonnegative neural networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2106.16239 v9 pith:ZH5J6XVG submitted 2021-06-30 stat.ML cs.LG

classification stat.MLcs.LG
keywords nonnegativenetworksneuralfixedconditionspointpointsbiases
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Random weights of DNNs and emergence of fixed points

    cs.LG 2025-01 reject novelty 6.0 of 10

    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.

Pith tools