3 papers
cs.CC2020
The Lagrangian remainder of Taylor's series, distinguishes time complexities to polynomials or not
Nikolaos P. Bakas, Elias Kosmatopoulos, Mihalis Nicolaou +1
The purpose of this letter is to investigate the time complexity consequences of the truncated Taylor series, known as Taylor Polynomials \cite{bakas2019taylor,Katsoprinakis2011,Ne…
math.NA2019
Taylor Polynomials in High Arithmetic Precision as Universal Approximators
Nikolaos P. Bakas
Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this…
cs.LG2019
A Gradient Free Neural Network Framework Based on Universal Approximation Theorem
Nikolaos P. Bakas, Andreas Langousis, Mihalis Nicolaou +1
We present a numerical scheme for computation of Artificial Neural Networks (ANN) weights, which stems from the Universal Approximation Theorem, avoiding laborious iterations. The…