Related papers: Accurate approximations for the complex error func…
We consider the problem of finding the set of architectural parameters for a chosen deep neural network which is optimal under three metrics: parameter size, inference speed, and error rate. In this paper we state the problem formally, and…
To strengthen the effectiveness of approximate reasoning in fuzzy modus ponens (FMP) and fuzzy modus tollens (FMT) problems, three approximate reasoning schemes with aggregation functions are developed and their validity is respectively…
In this paper, several modifications are introduced to the functional approximation method iterLap to reduce the approximation error, including stopping rule adjustment, proposal of new residual function, starting point selection for…
We describe a framework in which is possible to develop and implement algorithms for the approximation of invariant measures of dynamical systems with a given bound on the error of the approximation. Our approach is based on a general…
We present improved numerical approximations to the exact Poissonian confidence limits for small numbers n of observed events following the approach of Gehrels (1986). Analytic descriptions of all parameters used in the approximations are…
Assuming we are in a Word-RAM model with word size $w$, we show that we can construct in $o(w)$ time an error correcting code with a constant relative positive distance that maps numbers of $w$ bits into $\Theta(w)$-bit numbers, and such…
We analyze the Lanczos method for matrix function approximation (Lanczos-FA), an iterative algorithm for computing $f(\mathbf{A}) \mathbf{b}$ when $\mathbf{A}$ is a Hermitian matrix and $\mathbf{b}$ is a given vector. Assuming that $f :…
In this paper, we describe an algorithm for approximating functions of the form $f(x)=\int_{a}^{b} x^{\mu} \sigma(\mu) \, d \mu$ over $[0,1]$, where $\sigma(\mu)$ is some signed Radon measure, or, more generally, of the form $f(x) =…
The goal of this paper is to critically evaluate a heuristic algorithm for the Inverse Banzhaf Index problem by Laruelle and Widgr\'en. Few qualitative results are known about the approximation quality of the heuristics for this problem.…
Laplace approximation is a very useful tool in Bayesian inference and it claims a nearly Gaussian behavior of the posterior. \cite{SpLaplace2022} established some rather accurate finite sample results about the quality of Laplace…
We derive an approximation error bound that holds simultaneously for a function and all its derivatives up to any prescribed order. The bounds apply to elementary functions, including multivariate polynomials, the exponential function, and…
Despite the risk of misspecification they are tied to, parametric models continue to be used in statistical practice because they are accessible to all. In particular, efficient estimation procedures in parametric models are simple to…
The Gr\"unwald and shifted Gr\"unwald formulas for the function $y(x)-y(b)$ are first order approximations for the Caputo fractional derivative of the function $y(x)$ with lower limit at the point $b$. We obtain second and third order…
Given a text $T$ of length $n$ and a pattern $P$ of length $m$, the approximate pattern matching problem asks for computation of a particular \emph{distance} function between $P$ and every $m$-substring of $T$. We consider a…
The approximation of a general $d$-variate function $f$ by the shifts $\phi(\cdot-\xi)$, $\xi\in\Xi\subset \Rd$, of a fixed function $\phi$ occurs in many applications such as data fitting, neural networks, and learning theory. When…
The Ozaki-II scheme is an emulation method that leverages the Chinese Remainder Theorem to compute high-precision matrix multiplication via a sequence of low-precision matrix multiplications. In this scheme, the attainable numerical…
In this article, we introduce a recurrence formula which only involves two adjacent values of the Riemann zeta function at integer arguments. Based on the formula, an algorithm to evaluate $\zeta$-values(i.e. the values of Riemann zeta…
Purpose of writing this paper is to solve a transcendental function containing a product of a variable and its double exponential by a unique method of approximation. If the value of the said product is given, then its inverse function is…
In this article, we deal with the efficient computation of the Wright function in the cases of interest for the expression of solutions of some fractional differential equations. The proposed algorithm is based on the inversion of the…
Sparse tensor best rank-1 approximation (BR1Approx), which is a sparsity generalization of the dense tensor BR1Approx, and is a higher-order extension of the sparse matrix BR1Approx, is one of the most important problems in sparse tensor…