Related papers: An Improved Error Bound for Gaussian Interpolation
In this paper we prove an optimal error estimate for the H(curl)-conforming projection based p-interpolation operator introduced in [L. Demkowicz and I. Babuska, p interpolation error estimates for edge finite elements of variable order in…
In order to improve the performance of Bayesian optimisation, we develop a modified Gaussian process upper confidence bound (GP-UCB) acquisition function. This is done by sampling the exploration-exploitation trade-off parameter from a…
This paper addresses the Bayesian optimization problem (also referred to as the Bayesian setting of the Gaussian process bandit), where the learner seeks to minimize the regret under a function drawn from a known Gaussian process (GP).…
We present a simple, PDE-based proof of the result [M. Johnson, 2001] that the error estimates of [J. Duchon, 1978] for thin plate spline interpolation can be improved by $h^{1/2}$. We illustrate that ${\mathcal H}$-matrix techniques can…
Prior information can be incorporated in matrix completion to improve estimation accuracy and extrapolate the missing entries. Reproducing kernel Hilbert spaces provide tools to leverage the said prior information, and derive more reliable…
Generalization error bounds are critical to understanding the performance of machine learning models. In this work, building upon a new bound of the expected value of an arbitrary function of the population and empirical risk of a learning…
This paper presents a novel systematic methodology to obtain new simple and tight approximations, lower bounds, and upper bounds for the Gaussian Q-function, and functions thereof, in the form of a weighted sum of exponential functions.…
Interpolation by various types of splines is the standard procedure in many applications. In this paper we shall discuss harmonic spline "interpolation" (on the lines of a grid) as an alternative to polynomial spline interpolation (at…
We improve the known upper bound for short exponential sums and increase the range on which a sharp upper bound is known.
We show that a recent interpolative new proof of the Bohnenblust--Hille inequality, when suitably handled, recovers its best known constants. This seems to be unexpectedly surprising since the known interpolative approaches only provide…
In this paper we investigate polynomial interpolation using orthogonal polynomials. We use weight functions associated with orthogonal polynomials to define a weighted form of Lagrange interpolation. We introduce an upper bound of error…
In a similar fashion to estimates shown for Harmonic, Wachspress, and Sibson coordinates in [Gillette et al., AiCM, doi:10.1007/s10444-011-9218-z], we prove interpolation error estimates for the mean value coordinates on convex polygons…
In this note, pointwise best-possible (lower and upper) bounds on the set of copulas with a given value of the Gini's gamma coefficient are established. It is shown that, unlike the best-possible bounds on the set of copulas with a given…
We obtain explicit lower bounds on multiplicative order of elements that have more general form than finite field Gauss period. In a partial case of Gauss period this bound improves the previous bound of O.Ahmadi, I.E.Shparlinski and…
The aim of this paper is a construction of quartic parametric polynomial interpolants of a circular arc, where two boundary points of a circular arc are interpolated. For every unit circular arc of inner angle not greater than $\pi$ we find…
We study in details the isoperimetric profile of product probability measures with tails between the exponential and the Gaussian regime. In particular we exhibit many examples where coordinate half-spaces are approximate solutions of the…
The goal of this work is to introduce a local and a global interpolator in Jacobi-weighted spaces, with optimal order of approximation in the context of the $p$-version of finite element methods. Then, an a posteriori error indicator of the…
We outline the super-resolution reconstruction problem posed as a maximization of probability. We then introduce an interpolation method based on polygonal pixel overlap, express it as a linear operator, and use it to improve…
For nonautonomous, nonuniformly elliptic integrals with so-called $(p,q)$-growth conditions, we show a general interpolation property allowing to get basic higher integrability results for H\"older continuous minimizers under improved…
We propose an extrapolation technique that allows accuracy improvement of the discrete dipole approximation computations. The performance of this technique was studied empirically based on extensive simulations for 5 test cases using many…