Results 11 to 20 of about 5,139 (262)
Scale-Free Fractal Interpolation
An iterated function system that defines a fractal interpolation function, where ordinate scaling is replaced by a nonlinear contraction, is investigated here.
María A. Navascués +2 more
doaj +1 more source
Hyperbolic Tangent Like Relied Banach Space Valued Neural Network Multivariate Approximations
Here we examine the multivariate quantitative approximations of Banach space valued continuous multivariate functions on a box or ℝN , N ∈ ℕ, by the multivariate normalized, quasi-interpolation, Kantorovich type and quadrature type neural network ...
Anastassiou George A.
doaj +1 more source
An Iterative Process for Approximating Subactions [PDF]
We describe a procedure based on the iteration of an initial function by an appropriated operator, acting on continuous functions, in order to get a fixed point. This fixed point will be a calibrated subaction for the doubling map on the circle and a fixed Lipschitz potential.
Ferreira, Hermes H. +2 more
openaire +2 more sources
We consider linear ill‐posed problems in Hilbert spaces with noisy right hand side and given noise level. For approximation of the solution the Tikhonov method or the iterated variant of this method may be used.
Toomas Raus, Uno Hämarik
doaj +1 more source
Graph-based approximate message passing iterations
Abstract Approximate message passing (AMP) algorithms have become an important element of high-dimensional statistical inference, mostly due to their adaptability and concentration properties, the state evolution (SE) equations. This is demonstrated by the growing number of new iterations proposed for increasingly complex problems ...
Gerbelot, Cédric, Berthier, Raphaël
openaire +4 more sources
This paper aims to present a new pathwise approximation method, which gives approximate solutions of order 32$\begin{array}{} \displaystyle \frac{3}{2} \end{array}$ for stochastic differential equations (SDEs) driven by multidimensional Brownian motions.
Alhojilan Yazid
doaj +1 more source
Approximated multi-agent fitted Q iteration
We formulate an efficient approximation for multi-agent batch reinforcement learning, the approximated multi-agent fitted Q iteration (AMAFQI). We present a detailed derivation of our approach. We propose an iterative policy search and show that it yields a greedy policy with respect to multiple approximations of the centralized, learned Q-function. In
Antoine Lesage-Landry +1 more
openaire +3 more sources
New rule for choice of the regularization parameter in (iterated) tikhonov method
We propose a new a posteriori rule for choosing the regularization parameter α in (iterated) Tikhonov method for solving linear ill‐posed problems in Hilbert spaces. We assume that data are noisy but noise level δ is given.
Toomas Raus, Uno Hämarik
doaj +1 more source
Approximation and Complexity II: Iterated Integration [PDF]
We introduce two classes of real analytic functions W U on an interval. Starting with rational functions to construct functions in W we allow the application of three types of operations: addition, integration and multiplication by a polynomial with rational coe cients.
openaire +3 more sources
Iterative Approximate Cross-Validation
Cross-validation (CV) is one of the most popular tools for assessing and selecting predictive models. However, standard CV suffers from high computational cost when the number of folds is large. Recently, under the empirical risk minimization (ERM) framework, a line of works proposed efficient methods to approximate CV based on the solution of the ERM ...
Luo, Yuetian +2 more
openaire +2 more sources

