Abstract
Finding an optimal network size is one of the major concerns when building a neural network. In using the local extended Kalman filter (EKF) algorithm, we propose an efficient approach that combines EKF training and pruning as a whole. In particular, the covariance matrix obtained along with the local EKF training can be utilized to indicate the importance of the network weights. As a result, the network size can be determined adaptively to keep pace with the changes in input characteristics. The effectiveness of this algorithm is demonstrated on generalized XOR logic function and handwritten digit recognition.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
