Related papers: The Behavior of Error Bounds via Moreau Envelopes
In this paper, we study bounds of expected $L_2-$discrepancy to give mean square error of uniform integration approximation for functions in Sobolev space $\mathcal{H}^{\mathbf{1}}(K)$, where $\mathcal{H}$ is a reproducing Hilbert space…
For the non-conforming Crouzeix-Raviart boundary elements from [Heuer, Sayas: Crouzeix-Raviart boundary elements, Numer. Math. 112, 2009], we develop and analyze a posteriori error estimators based on the $h-h/2$ methodology. We discuss the…
We consider singularly perturbed boundary value problems with a simple interior turning point whose solutions exhibit an interior layer. These problems are discretised using higher order finite elements on layer-adapted graded meshes…
In this paper, we propose a new upper bound on the error probability performance of maximum-likelihood (ML) detection. The proposed approach provides a much tighter upper bound when compared to the traditionally used union bound, especially…
This paper studies one-dimensional Ornstein-Uhlenbeck processes, with the distinguishing feature that they are reflected on a single boundary (put at level 0) or two boundaries (put at levels 0 and d>0). In the literature they are referred…
The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…
We characterize the geometrically doubling condition of a metric space in terms of the uniform $L^1$-boundedness of superaveraging operators, where uniform refers to the existence of bounds independent of the measure being considered.
We establish Euclidean-type lower bounds for the codimension-1 Hausdorff measure of sets that separate points in doubling and linearly locally contractible metric manifolds. This gives a quantitative topological isoperimetric inequality in…
This paper provides statistical guarantees on the accuracy of dynamical models learned from dependent data sequences. Specifically, we develop uniform error bounds that apply to quantized models and imperfect optimization algorithms…
This paper investigates simple bilevel optimization problems where we minimize an upper-level objective over the optimal solution set of a convex lower-level objective. Existing methods for such problems either only guarantee asymptotic…
We prove tight H\"olderian error bounds for all $p$-cones. Surprisingly, the exponents differ in several ways from those that have been previously conjectured; moreover, they illuminate $p$-cones as a curious example of a class of objects…
In the present paper we prove several results concerning the existence of low-discrepancy point sets with respect to an arbitrary non-uniform measure $\mu$ on the $d$-dimensional unit cube. We improve a theorem of Beck, by showing that for…
This paper proposes hybrid high-order eigensolvers for the computation of guaranteed lower eigenvalue bounds. These bounds display higher order convergence rates and are accessible to adaptive mesh-refining algorithms. The involved…
We present an error bound for a least squares version of the kernel based meshless finite difference method for elliptic differential equations on smooth compact manifolds of arbitrary dimension without boundary. In particular, we obtain…
Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…
We consider the problem of estimating probability density functions based on sample data, using a finite mixture of densities from some component class. To this end, we introduce the $h$-lifted Kullback--Leibler (KL) divergence as a…
In this work, the probability of an event under some joint distribution is bounded by measuring it with the product of the marginals instead (which is typically easier to analyze) together with a measure of the dependence between the two…
We present a novel autoencoder-based approach for designing codes that provide unequal error protection (UEP) capabilities. The proposed design is based on a generalization of an autoencoder loss function that accommodates both message-wise…
We derive concentration inequalities for the supremum norm of the difference between a kernel density estimator (KDE) and its point-wise expectation that hold uniformly over the selection of the bandwidth and under weaker conditions on the…
We study the approximation properties of a harmonic function $u \in H\sp{1-k}(\Omega)$, $k > 0$, on relatively compact sub-domain $A$ of $\Omega$, using the Generalized Finite Element Method. For smooth, bounded domains $\Omega$, we obtain…