Abstract

A study of the approximation capabilities of single hidden layer neural networks leads to a strong motivation for investigating constructive learning techniques as a means of realizing established error bounds. Learning characteristics employed by constructive algorithms provide ideas for development of new algorithms applicable to the function approximation problem. A novel constructive algorithm, the iterative incremental function approximation (IIFA) algorithm is presented in detail. The algorithm operates in polynomial time and is demonstrated on one and two dimensional function approximation problems.

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 call

Disclaimer: 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.