scispace - formally typeset
Search or ask a question

Showing papers by "Ivan Petrović published in 2001"


Journal Article
TL;DR: It is shown that optimal CMAC network parameters can be found via convex optimization technique for standard | 2 approximation this is equivalent to the solution of Quadratic Program (QP), while for | 1 or | ∞ approximation solving Linear Program (LP) suffices.
Abstract: Simplicity of structure and learning algorithm play an important role in the real-time application of neural networks. The Cerebellar Model Articulation Controller (CMAC) neural network, with associative memory type of organization and Hebbian learning rule, satisfies these two conditions. But, Hebbian rule gives poor performance during off-line identification, which is used as a preparation phase for on-line implementation. In this paper we show that optimal CMAC network parameters can be found via convex optimization technique. For standard | 2 approximation this is equivalent to the solution of Quadratic Program (QP), while for | 1 or | ∞ approximation solving Linear Program (LP) suffices. In both cases physical constraints on parameter values can be included in an easy and straightforward way.

4 citations