The effectiveness of connectionist models in emulating intelligent behaviour and solving significant practical problems is strictly related to the capability of the learning algorithms to find optimal or near-optimal solutions, and to generalize to new examples. This paper deals with optimal learning and provides a unified viewpoint of most significant results in the field. In particular, we exhibit a computational model such that the solution of all loading problems giving rise to unimodal error functions require the same time, thus suggesting that they belong to the same computational class.
Bianchini, M., S., F., Gori, M., M., P. (1995). Optimal Learning and the Class of Unimodal Error Surface Loading Problems. In Proceedings of MANNA ‘95.
Optimal Learning and the Class of Unimodal Error Surface Loading Problems
BIANCHINI, MONICA;GORI, MARCO;
1995-01-01
Abstract
The effectiveness of connectionist models in emulating intelligent behaviour and solving significant practical problems is strictly related to the capability of the learning algorithms to find optimal or near-optimal solutions, and to generalize to new examples. This paper deals with optimal learning and provides a unified viewpoint of most significant results in the field. In particular, we exhibit a computational model such that the solution of all loading problems giving rise to unimodal error functions require the same time, thus suggesting that they belong to the same computational class.File | Dimensione | Formato | |
---|---|---|---|
MANNA95.pdf
non disponibili
Tipologia:
Post-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
636.98 kB
Formato
Adobe PDF
|
636.98 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/28740
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo