Nearly Exponential Neural Networks Approximation in Lp Spaces
نویسندگان
چکیده
منابع مشابه
Lp approximation of Sigma-Pi neural networks
A feedforward Sigma-Pi neural network with a single hidden layer of m neurons is given by mSigma(j=1) cjg (nPi(k=1) xk-thetak(j)/lambdak(j)) where cj, thetak(j), lambdak are elements of R. In this paper, we investigate the approximation of arbitrary functions f: Rn-->R by a Sigma-Pi neural network in the Lp norm. An Lp locally integrable function g(t) can approximate any given function, if and ...
متن کاملQuantum approximation I. Embeddings of finite-dimensional Lp spaces
We study approximation of embeddings between finite dimensional Lp spaces in the quantum model of computation. For the quantum query complexity of this problem matching (up to logarithmic factors) upper and lower bounds are obtained. The results show that for certain regions of the parameter domain quantum computation can essentially improve the rate of convergence of classical deterministic or...
متن کاملON APPROXIMATION OF LINEAR FUNCTIONALS ON Lp SPACES
In a recent paper certain approximations to continuous nonlinear functionals de-ned on an L p space (1 < p < 1) are shown to exist. These approximations may be realized by sigmoidal neural networks employing a linear input layer that implements nite sums of integrals of a certain type. In another recent paper similar approximation results are obtained using elements of a general class of contin...
متن کاملTotally probabilistic Lp spaces
In this paper, we introduce the notion of probabilistic valued measures as a generalization of non-negative measures and construct the corresponding Lp spaces, for distributions p > "0. It is alsoshown that if the distribution p satises p "1 then, as in the classical case, these spaces are completeprobabilistic normed spaces.
متن کاملL∞-Approximation in Korobov spaces with exponential weights
We study multivariate L∞-approximation for a weighted Korobov space of periodic functions for which the Fourier coefficients decay exponentially fast. The weights are defined, in particular, in terms of two sequences a = {aj} and b = {bj} of positive real numbers bounded away from zero. We study the minimal worstcase error eL∞−app,Λ(n, s) of all algorithms that use n information evaluations fro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JOURNAL OF UNIVERSITY OF BABYLON for Pure and Applied Sciences
سال: 2017
ISSN: 2312-8135,1992-0652
DOI: 10.29196/jub.v26i1.359