Result: Dependence of Computational Models on Input Dimension: Tractability of Approximation and Optimization Tasks.

The role of input dimension d is studied in approximating, in various norms, target sets of d-variable functions using linear combinations of adjustable computational units. Results from the literature, which emphasize the number n of terms in the linear combination, are reformulated, and in some cases improved, with particular attention to dependence on d. For worst-case error, upper bounds are given in the factorized form \xi(d)\kappa(n), where \kappa is nonincreasing (typically \kappa(n) \sim n^-1/2). Target sets of functions are described for which the function \xi is a polynomial. Some important cases are highlighted where \xi decreases to zero as d \to \infty. For target functions, extent (e.g., the size of domains in \BBR^d where they are defined), scale (e.g., maximum norms of target functions), and smoothness (e.g., the order of square-integrable partial derivatives) may depend on d, and the influence of such dimension-dependent parameters on model complexity is considered. Results are applied to approximation and solution of optimization problems by neural networks with perceptron and Gaussian radial computational units. [ABSTRACT FROM PUBLISHER]

Copyright of IEEE Transactions on Information Theory is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)