Universality criteria for broken-isomorphism physical neural networks
Identify the necessary and sufficient architectural and dynamical features that enable universal computation or universal function approximation in broken-isomorphism physical neural networks, i.e., analog systems trained directly in their native physics without enforcing operation-by-operation mathematical isomorphism to digital neural networks.
References
One complication with broken-isomorphism PNNs is that it is often unknown what features are required for universal computation or universal function approximation.
The flexibility of the paradigm leaves open further constructions: with a continuous value set W, for instance, the same scheme may provide a substrate for analog computing. We currently offer no proof or formal guarantee in that direction.
It does, however, reframe a question we cannot yet answer: whether the better route to intelligence on silicon is to build highly simplified models of biological neural networks, as artificial neural networks do, or to construct an artificial physics from which arbitrary structure can emerge.
More broadly, an open question is whether excitonic networks are universal approximators in the limit $N\rightarrow\infty$, given that the degree of the rational input-output relation grows without bound with system size and rational functions are known to approximate a broad class of functions.