Related papers: Lipschitz behavior of the robust regularization
Lipschitz constants for the width and diameter functions of a convex body in $\mathbb R^n$ are found in terms of its diameter and thickness (maximum and minimum of both functions). Also, a dual approach to thickness is proposed.
We construct Lipschitz $Q$-valued functions which approximate carefully integral currents when their cylindrical excess is small and they are almost minimizing in a suitable sense. This result is used in two subsequent works to prove the…
A crucial property for achieving secure, trustworthy and interpretable deep learning systems is their robustness: small changes to a system's inputs should not result in large changes to its outputs. Mathematically, this means one strives…
Smoothness and low dimensional structures play central roles in improving generalization and stability in learning and statistics. This work combines techniques from semi-infinite constrained learning and manifold regularization to learn…
We consider semi-stable, radially symmetric, and decreasing solutions of a reaction equation involving the p-Laplacian, where the reaction term is a locally Lipschitz function, and the domain is the unit ball. For this class of radial…
We prove global Lipschitz regularity for a wide class of convex variational integrals among all functions in $W^{1,1}$ with prescribed (sufficiently regular) boundary values, which are not assumed to satisfy any geometrical constraint (as…
We study a generalization of the manifold-valued Rudin-Osher-Fatemi (ROF) model, which involves an initial datum $f$ mapping from a curved compact surface with smooth boundary to a complete, connected and smooth $n$-dimensional Riemannian…
Benjamini, Yadin, and Yehudayoff (2007) showed that if the maximum degree of a graph $G$ is 'sub-logarithmic,' then the typical range of random $\mathbb Z$-homomorphisms is super-constant. Furthermore, they showed that there is a sharp…
In the present paper, a systematic study is made of quantitative semicontinuity (a.k.a. Lipschitzian) properties of certain multifunctions, which are defined as a solution map associated to a family of parameterized ``split" feasibility…
This paper addresses the problem of estimating a convex regression function under both the sup-norm risk and the pointwise risk using B-splines. The presence of the convex constraint complicates various issues in asymptotic analysis,…
The Lipschitz constant of a network plays an important role in many applications of deep learning, such as robustness certification and Wasserstein Generative Adversarial Network. We introduce a semidefinite programming hierarchy to…
We provide some necessary and sufficient conditions for a proper lower semicontinuous convex function, defined on a real Banach space, to be locally or globally Lipschitz continuous. Our criteria rely on the existence of a bounded selection…
We discuss the possibility to represent smooth nonnegative matrix-valued functions as finite linear combinations of fixed matrices with positive real-valued coefficients whose square roots are Lipschitz continuous. This issue is reduced to…
We introduce the concept of strong high-order approximate minimizers for nonconvex optimization problems. These apply in both standard smooth and composite non-smooth settings, and additionally allow convex or inexpensive constraints. An…
We provide sharp worst-case evaluation complexity bounds for nonconvex minimization problems with general inexpensive constraints, i.e.\ problems where the cost of evaluating/enforcing of the (possibly nonconvex or even disconnected)…
To improve the robustness of deep classifiers against adversarial perturbations, many approaches have been proposed, such as designing new architectures with better robustness properties (e.g., Lipschitz-capped networks), or modifying the…
The Lipschitz space of an infinite (locally-finite) graph is defined as the set of functions on the vertices of the graph such that the differences of the values between adjacent vertices remain bounded. In this paper we prove that this set…
The local Lipschitz constant of a neural network is a useful metric with applications in robustness, generalization, and fairness evaluation. We provide novel analytic results relating the local Lipschitz constant of nonsmooth vector-valued…
We introduce the Lipschitz matrix: a generalization of the scalar Lipschitz constant for functions with many inputs. Among the Lipschitz matrices compatible a particular function, we choose the smallest such matrix in the Frobenius norm to…
We consider the linear elliptic systems or equations in divergence form with periodically oscillating coefficients. We prove the large-scale boundary Lipschitz estimate for the weak solutions in domains satisfying the so-called…