PL
 |
EN
Preferences help
Polish version English version Language
enabled [disable] Abstract
Number of results

Results found: 1

Number of results on page
first rewind previous Page / 1 next fast forward last
Search results
Search:
in the keywords:  convex optimization theory
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1
Content available Optimal training strategies for locally recurrent neural networks
Patan K., Patan M.
Journal of Artificial Intelligence and Soft Computing Research
|
2011
|
Vol. 1, No. 2
103--114
EN
The problem of determining an optimal training schedule for locally recurrent neural network is discussed. Specifically, the proper choice of the most informative measurement data guaranteeing the reliable prediction of neural network response is considered. Based on a scalar measure of performance defined on the Fisher information matrix related to the network parameters, the problem was formulated in terms of optimal experimental design. Then, its solution can be readily achieved via adaptation of effective numerical algorithms based on the convex optimization theory. Finally, some illustrative experiments are provided to verify the presented approach.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.