Abstract
We consider fully connected neural networks near saturation, trained by a modified Edinburgh algorithm, with sign constraints on the synaptic couplings. We study the domains of attraction of the stored patterns for both the balanced and the unbalanced case (excess of positive over negative constraints). A comparison with the dilute network is also included.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
