Related papers: On Error Bound Moduli for Locally Lipschitz and Re…
Shape estimation and object reconstruction are common problems in image analysis. Mathematically, viewing objects in the image plane as random sets reduces the problem of shape estimation to inference about sets. Currently existing…
We analyze the local accuracy of the virtual element method. More precisely, we prove an error bound similar to the one holding for the finite element method, namely, that the local $H^1$ error in a interior subdomain is bounded by a term…
We provide novel theoretical results regarding local optima of regularized $M$-estimators, allowing for nonconvexity in both loss and penalty functions. Under restricted strong convexity on the loss and suitable regularity conditions on the…
Submodularity is a key property in discrete optimization. Submodularity has been widely used for analyzing the greedy algorithm to give performance bounds and providing insight into the construction of valid inequalities for mixed-integer…
An algorithm is proposed, analyzed, and tested for minimizing locally Lipschitz objective functions that may be nonconvex and/or nonsmooth. The algorithm, which is built upon the gradient-sampling methodology, is designed specifically for…
This paper presents a tractable algorithm for estimating an unknown Lipschitz function from noisy observations and establishes an upper bound on its convergence rate. The approach extends max-affine methods from convex shape-restricted…
This paper provides a general result on controlling local Rademacher complexities, which captures in an elegant form to relate the complexities with constraint on the expected norm to the corresponding ones with constraint on the empirical…
In this work, we develop a level-set subdifferential error bound condition aiming towards convergence rate analysis of a variable Bregman proximal gradient (VBPG) method for a broad class of nonsmooth and nonconvex optimization problems. It…
A loss function measures the discrepancy between the true values (observations) and their estimated fits, for a given instance of data. A loss function is said to be proper (unbiased, Fisher consistent) if the fits are defined over a unit…
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…
In this paper we prove the Lipschitz regularity for local minimizers of convex variational integrals of the form \[ \mathfrak{F}( v, \Omega )= \int_{\Omega} \! F(x, Dv(x)) \, dx, \] where, for ${n > 2}$ and $N\ge 1$, $\Omega$ is a bounded…
We prove that intersections and unions of independent random sets in finite spaces achieve a form of Lipschitz continuity. More precisely, given the distribution of a random set $\Xi$, the function mapping any random set distribution to the…
We survey a few concentration inequalities for submodular and fractionally subadditive functions of independent random variables, implied by the entropy method for self-bounding functions. The power of these concentration bounds is that…
The hyperbolic lattice point problem asks to estimate the size of the orbit $\Gamma z$ inside a hyperbolic disk of radius $\cosh^{-1}(X/2)$ for $\Gamma$ a discrete subgroup of $\hbox{PSL}_2(R)$. Selberg proved the estimate $O(X^{2/3})$ for…
We consider the behaviour of holomorphic functions on a bounded open subset of the plane, satisfying a Lipschitz condition with exponent $\alpha$, with $0<\alpha<1$, in the vicinity of an exceptional boundary point where all such functions…
The optimal local Lipschitz regularity for scalar almost-minimizers of Alt-Caffarelli-type functionals $$ \mathcal{F}({v}; \Omega) = \int_\Omega \varphi(x,\left|\nabla v(x) \right|)+ \lambda \chi_{\{{v} >0\}} (x) \, \mathrm{d}x\,, $$ with…
In this paper we analyze the local and global boundary rigidity problem for general Riemannian manifolds with boundary $(M,g)$. We show that the boundary distance function, i.e., $d_g|_{\partial M\times\partial M}$, known near a point $p\in…
We consider the problem of minimizing the Lagrangian $\int [F(\nabla u)+f\,u]$ among functions on $\Omega\subset\mathbb{R}^N$ with given boundary datum $\varphi$. We prove Lipschitz regularity up to the boundary for solutions of this…
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…
Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper bound on the distance from the origin to a feasible point.…