IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v99y2000i1p385-40110.1023-a1019240304484.html
   My bibliography  Save this article

A Learning Framework for Neural Networks Using Constrained Optimization Methods

Author

Listed:
  • Stavros Perantonis
  • Nikolaos Ampazis
  • Vassilis Virvilis

Abstract

Conventional supervised learning in neural networks is carried out by performing unconstrained minimization of a suitably defined cost function. This approach has certain drawbacks, which can be overcome by incorporating additional knowledge in the training formalism. In this paper, two types of such additional knowledge are examined: Network specific knowledge (associated with the neural network irrespectively of the problem whose solution is sought) or problem specific knowledge (which helps to solve a specific learning task). A constrained optimization framework is introduced for incorporating these types of knowledge into the learning formalism. We present three examples of improvement in the learning behaviour of neural networks using additional knowledge in the context of our constrained optimization framework. The two network specific examples are designed to improve convergence and learning speed in the broad class of feedforward networks, while the third problem specific example is related to the efficient factorization of 2-D polynomials using suitably constructed sigma-pi networks. Copyright Kluwer Academic Publishers 2000

Suggested Citation

  • Stavros Perantonis & Nikolaos Ampazis & Vassilis Virvilis, 2000. "A Learning Framework for Neural Networks Using Constrained Optimization Methods," Annals of Operations Research, Springer, vol. 99(1), pages 385-401, December.
  • Handle: RePEc:spr:annopr:v:99:y:2000:i:1:p:385-401:10.1023/a:1019240304484
    DOI: 10.1023/A:1019240304484
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1019240304484
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1023/A:1019240304484?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Manuel Castejón-Limas & Joaquín Ordieres-Meré & Ana González-Marcos & Víctor González-Castro, 2011. "Effort estimates through project complexity," Annals of Operations Research, Springer, vol. 186(1), pages 395-406, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:99:y:2000:i:1:p:385-401:10.1023/a:1019240304484. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.