Related papers: New error bounds for Legendre approximations of di…
We propose a new estimator, the thresholded scaled Lasso, in high dimensional threshold regressions. First, we establish an upper bound on the $\ell_\infty$ estimation error of the scaled Lasso estimator of Lee et al. (2012). This is a…
In this paper we introduce new bounds on the approximation of functions in deep networks and in doing so introduce some new deep network architectures for function approximation. These results give some theoretical insight into the success…
This paper is concerned with the derivation of computable and guaranteed upper and lower bounds of the difference between the exact and the approximate solution of a boundary value problem for static Maxwell equations. Our analysis is based…
We use a recently developed method \cite{Costinetal}, \cite{Dubrovin} to find accurate analytic approximations with rigorous error bounds for the classic similarity solution of Blasius of the boundary layer equation in fluid mechanics, the…
We study the problem of agnostic learning under the Gaussian distribution. We develop a method for finding hard families of examples for a wide class of problems by using LP duality. For Boolean-valued concept classes, we show that the…
Using the Moore--Penrose pseudoinverse, this work generalizes the gradient approximation technique called centred simplex gradient to allow sample sets containing any number of points. This approximation technique is called the…
The problem of finding upper bounds for L-functions at the edge of the critical strip has a long and interesting history. Here, the situation for classical L-functions such as Dirichlet L-functions is relatively well understood. The reason…
We consider an overdetermined problem for Laplace equation on a disk with partial boundary data where additional pointwise data inside the disk have to be taken into account. After reformulation, this ill-posed problem reduces to a bounded…
We prove a new bound on the average sensitivity of polynomial threshold functions. In particular we show that a polynomial threshold function of degree $d$ in at most $n$ variables has average sensitivity at most…
We present a brief survey of existing mistake bounds and introduce novel bounds for the Perceptron or the kernel Perceptron algorithm. Our novel bounds generalize beyond standard margin-loss type bounds, allow for any convex and Lipschitz…
We consider a finite volume scheme with two-point flux approximation (TPFA) to approximate a Laplace problem when the solution exhibits no more regularity than belonging to $H^1_0(\Omega)$. We establish in this case some error bounds for…
We derive two related novel bounds on single-variable marginal probability distributions in factor graphs with discrete variables. The first method propagates bounds over a subtree of the factor graph rooted in the variable, and the second…
The paper is devoted to a detailed analysis of nonlocal error bounds for nonconvex piecewise affine functions. We both improve some existing results on error bounds for such functions and present completely new necessary and/or sufficient…
This paper introduces a novel error estimator for the Proper Generalized Decomposition (PGD) approximation of parametrized equations. The estimator is intrinsically random: It builds on concentration inequalities of Gaussian maps and an…
We find that the solution of the polar angular differential equation can be written as the universal associated Legendre polynomials. Its generating function is applied to obtain an analytical result for a class of interesting integrals…
We express a certain complex-valued solution of Legendre's differential equation as the product of an oscillatory exponential function and an integral involving only nonoscillatory elementary functions. By calculating the logarithmic…
We obtain the best approximation in $L^1(\R)$, by entire functions of exponential type, for a class of even functions that includes $e^{-\lambda|x|}$, where $\lambda >0$, $\log |x|$ and $|x|^{\alpha}$, where $-1 < \alpha < 1$. We also give…
The present work was primarily motivated by our findings in the literature of some flaws within the proof of the second-order Legendre necessary optimality condition for fractional calculus of variations problems. Therefore we were eager to…
We give a general strategy to construct superoscillating/growing functions using an orthogonal polynomial expansion of a bandlimited function. The degree of superoscillation/growth is controlled by an anomalous expectation value of a…
We introduce a new quantification of nonuniform ellipticity in variational problems via convex duality, and prove higher differentiability and $2d$-smoothness results for vector valued minimizers of possibly degenerate functionals. Our…