Related papers: Lipschitz constant $\log{n}$ almost surely suffice…

Robustness of deep neural networks against adversarial perturbations is a pressing concern motivated by recent findings showing the pervasive nature of such vulnerabilities. One method of characterizing the robustness of a neural network…

We study expansion/contraction properties of some common classes of mappings of the Euclidean space ${\mathbb R}^n, n\ge 2\,,$ with respect to the distance ratio metric. The first main case is the behavior of M\"obius transformations of the…

It is well established that to ensure or certify the robustness of a neural network, its Lipschitz constant plays a prominent role. However, its calculation is NP-hard. In this note, by taking into account activation regions at each layer…

This paper examines the asymptotic convergence properties of Lipschitz interpolation methods within the context of bounded stochastic noise. In the first part of the paper, we establish probabilistic consistency guarantees of the classical…

This paper is devoted to the proof of Lipschitz regularity, down to the microscopic scale, for solutions of an elliptic system with highly oscillating coefficients, over a highly oscillating Lipschitz boundary. The originality of this…

We consider the stability of Robust Optimization problems with respect to perturbations in their uncertainty sets. We focus on Linear Optimization problems, including those with a possibly infinite number of constraints, also known as…

Under general assumptions on the target distribution $p^\star$, we establish a sharp Lipschitz regularity theory for flow-matching vector fields and diffusion-model scores, with optimal dependence on time and dimension. As applications, we…

We prove that every bi-Lipschitz embedding of the unit circle into the plane can be extended to a bi-Lipschitz map of the unit disk with linear bounds on the constants involved. This answers a question raised by Daneri and Pratelli.…

Let $\Gamma_d$ be the largest constant such that every finite collection of cubes in $\mathbb{R}^d$ whose sides are parallel to the coordinate axes admits a disjoint sub-collection occupying a fraction $\Gamma_d$ of its volume. Vitali's…

We prove the local Lipschitz continuity of sub-elliptic harmonic maps between certain singular spaces, more specifically from the $n$-dimensional Heisenberg group into $CAT(0)$ spaces. Our main theorem establishes that these maps have the…

The Lipschitz bound, a technique from robust statistics, can limit the maximum changes in the output concerning the input, taking into account associated irrelevant biased factors. It is an efficient and provable method for examining the…

We consider the problem of minimax estimation of the entropy of a density over Lipschitz balls. Dropping the usual assumption that the density is bounded away from zero, we obtain the minimax rates $(n\ln n)^{-s/(s+d)} + n^{-1/2}$ for…

In many real-world applications, it is undesirable to drastically change the problem solution after a small perturbation in the input, as unstable outputs can lead to costly transaction fees, privacy and security concerns, reduced user…

We compute the best constant in the embedding of $W^{N,1}({\mathbb R}^N)$ into $L^\infty({\mathbb R}^N)$, extending a result of Humbert and Nazaret in dimensions one and two to any $N$. The main tool is the identification of $\log |x|$ as a…

This paper addresses Lipschitzian stability issues that play an important role in both theoretical and numerical aspects of variational analysis, optimization, and their applications. We particularly concentrate on the so-called relaxed…

The unit-distance graph on the $n$-dimensional integer lattice $\mathbb{Z}^n$ is called the $n$-dimensional grid. We attempt to maximize the girth of a $k$-regular (possibly induced) subgraph of the $n$-dimensional grid, and provide…

We report on new techniques and results in the regularity theory of general non-uniformly elliptic variational integrals. By means of a new potential theoretic approach we reproduce, in the non-uniformly elliptic setting, the optimal…

Fixed-point equations with Lipschitz operators have been studied for more than a century, and are central to problems in mathematical optimization, game theory, economics, and dynamical systems, among others. When the Lipschitz constant of…

We prove that for every $n\in \mathbb{N}$ there exists a metric space $(X,d_X)$, an $n$-point subset $S\subseteq X$, a Banach space $(Z,\|\cdot\|_Z)$ and a $1$-Lipschitz function $f:S\to Z$ such that the Lipschitz constant of every function…

We initiate the study of the inherent tradeoffs between the size of a neural network and its robustness, as measured by its Lipschitz constant. We make a precise conjecture that, for any Lipschitz activation function and for most datasets,…