Optimality of pocket algorithm (Articolo in rivista)

Type
Label
  • Optimality of pocket algorithm (Articolo in rivista) (literal)
Anno
  • 1996-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1007/3-540-61510-5_87 (literal)
Alternative label
  • M. Muselli (1996)
    Optimality of pocket algorithm
    in Lecture notes in computer science
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • M. Muselli (literal)
Pagina inizio
  • 507 (literal)
Pagina fine
  • 512 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 1112 (literal)
Rivista
Note
  • Google Scholar (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • M. Muselli: CNR-IEIIT, Genova, Italy (literal)
Titolo
  • Optimality of pocket algorithm (literal)
Abstract
  • Many constructive methods use the pocket algorithm as a basic component in the training of multilayer perceptrons. This is mainly due to the good properties of the pocket algorithm confirmed by a proper convergence theorem which asserts its optimality. Unfortunately the original proof holds vacuously and does not ensure the asymptotical achievement of an optimal weight vector in a general situation. This inadequacy can be overcome by a different approach that leads to the desired result. Moreover, a modified version of this learning method, called pocket algorithm with ratchet, is shown to obtain an optimal configuration within a finite number of iterations independently of the given training set. (literal)
Prodotto di
Autore CNR

Incoming links:


Prodotto
Autore CNR di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
data.CNR.it