Logo eprints

A Comparison between Fixed-Basis and Variable-Basis Schemes for Function Approximation and Functional Optimization

Gnecco, Giorgio A Comparison between Fixed-Basis and Variable-Basis Schemes for Function Approximation and Functional Optimization. Journal of Applied Mathematics, 2012. pp. 1-17. ISSN 1110-757X (2012)

[img]
Preview
PDF - Published Version
Available under License Creative Commons Attribution.

Download (1MB) | Preview

Abstract

Fixed-basis and variable-basis approximation schemes are compared for the problems of function approximation and functional optimization (also known as infinite programming). Classes of problems are investigated for which variable-basis schemes with sigmoidal computational units perform better than fixed-basis ones, in terms of the minimum number of computational units needed to achieve a desired error in function approximation or approximate optimization. Previously known bounds on the accuracy are extended, with better rates, to families of

Item Type: Article
Identification Number: 10.1155/2012/806945
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Research Area: Computer Science and Applications
Depositing User: Giorgio Gnecco
Date Deposited: 13 Sep 2013 12:03
Last Modified: 16 Sep 2013 12:02
URI: http://eprints.imtlucca.it/id/eprint/1723

Actions (login required)

Edit Item Edit Item