Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Hamiltonian neural networks”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

Encoding unique global minima in nested neural networks

Nested neural networks are constructed from outer products of patterns over (-1,0,1)N, whose nonzero bits define subnetworks and the subcodes stored in them. The set of permissible words, which are network-size binary patterns composed of subcode words that agree in their common bits, is characterized, and their number is derived. It is shown that if the bitwise products of the subcode words are linearly independent, the permissible words are the unique global minima of the Hamiltonian associated with the network.

Baram, Yoram↗

Ground-state coding in partially connected neural networks

Patterns over (-1,0,1) define, by their outer products, partially connected neural networks, consisting of internally strongly connected, externally weakly connected subnetworks. The connectivity patterns may have highly organized structures, such as lattices and fractal trees or nests. Subpatterns over (-1,1) define the subcodes stored in the subnetwork, that agree in their common bits. It is first shown that the code words are locally stable stares of the network, provided that each of the subcodes consists of mutually orthogonal words or of, at most, two words. Then it is shown that if each of the subcodes consists of two orthogonal words, the code words are the unique ground states (absolute minima) of the Hamiltonian associated with the network. The regions of attraction associated with the code words are shown to grow with the number of subnetworks sharing each of the neurons. Depending on the particular network architecture, the code sizes of partially connected networks can be vastly greater than those of fully connected ones and their error correction capabilities can be significantly greater than those of the disconnected subnetworks. The codes associated with lattice-structured and hierarchical networks are discussed in some detail.

Baram, Yoram↗