Results 31 to 40 of about 373,199 (312)
Taylor Polynomials in a High Arithmetic Precision as Universal Approximators
Function approximation is a fundamental process in a variety of problems in computational mechanics, structural engineering, as well as other domains that require the precise approximation of a phenomenon with an analytic function. This work demonstrates
Nikolaos Bakas
doaj +1 more source
Comparing policy gradient and value function based reinforcement learning methods in simulated electrical power trade [PDF]
In electrical power engineering, reinforcement learning algorithms can be used to model the strategies of electricity market participants. However, traditional value function based reinforcement learning algorithms suffer from convergence issues when ...
Burt, Graeme +7 more
core +1 more source
The Principle of Localization at the Class of Functions Integrable in the Riemann for the Processes of Lagrange - Sturm - Liouville [PDF]
Let us say that the principle of localization holds at the class of functions $F$ at point $x_0 \in [0, \pi]$ for the Lagrange\,--\,Sturm\,--\,Liouville interpolation process $L_n^{SL}(f,x)$ if $\lim_{n \rightarrow \infty}\left|L_n^{SL}(f, x_0)-L_n^{SL ...
Aleksandr Yurievich Trynin +1 more
doaj +1 more source
Hardness of submodular cost allocation : lattice matching and a simplex coloring conjecture [PDF]
We consider the Minimum Submodular Cost Allocation (MSCA) problem. In this problem, we are given k submodular cost functions f1, ... , fk: 2V -> R+ and the goal is to partition V into k sets A1, ..., Ak so as to minimize the total cost sumi = 1,k fi(Ai).
Vondrák, Jan, Ene, Alina
core +1 more source
Dual Taylor Series, Spline Based Function and Integral Approximation and Applications
In this paper, function approximation is utilized to establish functional series approximations to integrals. The starting point is the definition of a dual Taylor series, which is a natural extension of a Taylor series, and spline based series ...
Roy M. Howard
doaj +1 more source
Approximation by Extreme Functions
For a topological space \(T\) and a real normed space \(X\) let \(Y= C(T,X)\), the normed space of all \(X\)-valued bounded continuous functions on \(T\) endowed with the supremum norm. Let \(Y^{-1}=\{f\in Y:f\) does not vanish in any \(t\in T\}\). For \(f\in Y\), let \(\alpha(f)= d(f,Y^{-1})\) and let \(m(f)= \inf \{\|f(t)\|: t\in T\}\).
Jiménez-Vargas, A +2 more
openaire +2 more sources
Approximation of Convex Functions
It is known [\textit{M. Ghomi}, Proc. Am. Math. Soc. 130, No.~8, 2255--2259 (2002; Zbl 0999.26008)] that every convex function on an open interval \(I\) can be uniformly approximated by convex \(C^\infty\)-functions on every compact subinterval \([a,b]\) of \(I\). Ghomi's approach requires the knowledge of Lebesgue integral and convolutions. The aim of
openaire +2 more sources
A Deep-Network Piecewise Linear Approximation Formula
The mathematical foundation of deep learning is the theorem that any continuous function can be approximated within any specified accuracy by using a neural network with certain non-linear activation functions. However, this theorem does not tell us what
Gengsheng L. Zeng
doaj +1 more source
ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen +23 more
wiley +1 more source
Random vector functional link networks for function approximation on manifolds
The learning speed of feed-forward neural networks is notoriously slow and has presented a bottleneck in deep learning applications for several decades. For instance, gradient-based learning algorithms, which are used extensively to train neural networks,
Deanna Needell +4 more
doaj +1 more source

