Related papers: Interpolation Error Estimates for Mean Value Coord…
In this paper, we define the geometric median of a probability measure on a Riemannian manifold, give its characterization and a natural condition to ensure its uniqueness. In order to calculate the median in practical cases, we also…
We study in this paper the function approximation error of multivariate linear extrapolation. The sharp error bound of linear interpolation already exists in the literature. However, linear extrapolation is used far more often in…
In this technical note, we present the formulae of the derivatives of the Mean Value Coordinates based transformations, using an enclosing triangle mesh, acting as a cage for the deformation of an interior object.
For a function defined on a convex set in a Euclidean space, midpoint convexity is the property requiring that the value of the function at the midpoint of any line segment is not greater than the average of its values at the endpoints of…
We consider interpolation learning in high-dimensional linear regression with Gaussian data, and prove a generic uniform convergence guarantee on the generalization error of interpolators in an arbitrary hypothesis class in terms of the…
Let $B_n$ be the Euclidean unit ball in ${\mathbb R}^n$ given by the inequality $\|x\|\leq 1$, $\|x\|:=\left(\sum\limits_{i=1}^n x_i^2\right)^{\frac{1}{2}}$. By $C(B_n)$ we mean the space of continuous functions $f:B_n\to{\mathbb R}$ with…
Error bounds are central objects in optimization theory and its applications. They were for a long time restricted only to the theory before becoming over the course of time a field of itself. This paper is devoted to the study of error…
Mean value properties of solutions to the $m$-dimensional Helmholtz and modified Helmholtz equations are considered. An elementary derivation of these properties is given; it involves the Euler--Poisson--Darboux equation. Despite the…
This work derives a posteriori error estimate of polygonal finite element methods based on Wachspress barycentric coordinates. In particular, we prove that the classical residual-based a posteriori error estimator is both an upper and lower…
Recent results concerning solutions of the modified Helmholtz equation are reviewed; namely, various mean value properties and their corollaries, converse and inverse of these properties, and relations between these solutions and harmonic…
In this paper, we establish mean width inequalities of sections and projections of convex bodies for isotropic measures with complete equality conditions, which extends the recent work of Alonso-Guti\'{e}rrez and Brazitikos. Different from…
The paper discusses sharp sufficient conditions for interpolation and sampling for functions of n variables with convex spectrum. When n=1, the classical theorems of Ingham and Beurling state that the critical values in the estimates from…
We endeavour to estimate numerous multi-dimensional means of various probability distributions on a common space based on independent samples. Our approach involves forming estimators through convex combinations of empirical means derived…
This work considers the effect of averaging, and more generally extrapolation, of the iterates of gradient descent in smooth convex optimization. After running the method, rather than reporting the final iterate, one can report either a…
An error bound for Gaussian Interpolation which is better than the current exponential-type error bound is presented.
The techniques for polynomial interpolation and Gaussian quadrature are generalized to matrix-valued functions. It is shown how the zeros and rootvectors of matrix orthonormal polynomials can be used to get a quadrature formula with the…
In this article, we prove an asymptotic formula for the mean value of long smoothed Dirichlet polynomials with divisor coefficients. Our result has a main term that includes all lower order terms and a power saving error term. This is…
In this paper, we extend the previous convergence results for the generalized alternating projection method applied to subspaces in [arXiv:1703.10547] to hold also for smooth manifolds. We show that the algorithm locally behaves similarly…
In this paper we develop a general method for improving Jensen-type inequalities for convex and, even more generally, for piecewise convex functions. Our main result relies on the linear interpolation of a convex function. As a consequence,…
Counterexamples to some old-standing optimization problems in the smooth convex coercive setting are provided. We show that block-coordinate, steepest descent with exact search or Bregman descent methods do not generally converge. Other…