An Optimization Approach to Design of Generalized BSB Neural Associative Memories
Abstract
This article is concerned with the synthesis of the optimally performing GBSB (generalized brain-state-in-a-box) neural associative memory given a set of desired binary patterns to be stored as asymptotically stable equilibrium points. Based on some known qualitative properties and newly observed fundamental properties of the GBSB model, the synthesis problem is formulated as a constrained optimization problem. Next, we convert this problem into a quasi-convex optimization problem called GEVP (generalized eigenvalue problem). This conversion is particularly useful in practice, because GEVPs can be efficiently solved by recently developed interior point methods. Design examples are given to illustrate the proposed approach and to compare with existing synthesis methods.
Cite
Text
Park and Park. "An Optimization Approach to Design of Generalized BSB Neural Associative Memories." Neural Computation, 2000. doi:10.1162/089976600300015457Markdown
[Park and Park. "An Optimization Approach to Design of Generalized BSB Neural Associative Memories." Neural Computation, 2000.](https://mlanthology.org/neco/2000/park2000neco-optimization/) doi:10.1162/089976600300015457BibTeX
@article{park2000neco-optimization,
title = {{An Optimization Approach to Design of Generalized BSB Neural Associative Memories}},
author = {Park, Jooyoung and Park, Yonmook},
journal = {Neural Computation},
year = {2000},
pages = {1449-1462},
doi = {10.1162/089976600300015457},
volume = {12},
url = {https://mlanthology.org/neco/2000/park2000neco-optimization/}
}