Cart (Loading....) | Create Account
Close category search window
 

Encoding unique global minima in nested neural networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Baram, Y. ; Dept. of Comput. Sci., Technion-Israel Inst. of Sci. & Technol., Haifa, Israel

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

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 4 )

Date of Publication:

Jul 1991

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.