pith. sign in

arxiv: cond-mat/0109053 · v1 · submitted 2001-09-04 · ❄️ cond-mat.dis-nn · q-bio

Higher-Order Neutral Networks, Polya Polynomials, and Fermi Cluster Diagrams

classification ❄️ cond-mat.dis-nn q-bio
keywords higher-orderclusternetworksaccordingaddressedanalogyanalysisapplied
0
0 comments X
read the original abstract

The problem of controlling higher-order interactions in neural networks is addressed with techniques commonly applied in the cluster analysis of quantum many-particle systems. For multi-neuron synaptic weights chosen according to a straightforward extension of the standard Hebbian learning rule, we show that higher-order contributions to the stimulus felt by a given neuron can be readily evaluated via Poly\`a's combinatoric group-theoretical approach or equivalently by exploiting a precise formal analogy with fermion diagrammatics.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.