相关论文: Local Lipschitz Filters for Bounded-Range Function…

Extending functions from boundary values plays an important role in various applications. In this thesis we consider discrete and continuous formulations of the problem based on $p$-Laplacians, in particular for $p=\infty$ and tight…

In this paper, we analyze the mirror descent algorithm for non-smooth optimization problems in which the objective function is relatively strongly convex, without relying on the standard Lipschitz continuity assumption commonly used in the…

We propose a local Legendre frame (LLF) method for function approximation from equispaced data on a finite interval. Motivated by the difficulty of stable high-order polynomial approximation at equispaced points, especially in the presence…

We generalize and analyse the method for computing lower bounds of the principal eigenvalue proposed in our previous paper (I. Sebestova, T. Vejchodsky, SIAM J. Numer. Anal. 2014). This method is suitable for symmetric elliptic eigenvalue…

The paper presents a new descent algorithm for locally Lipschitz continuous functions $f:X\to\mathbb{R}$. The selection of a descent direction at some iteration point $x$ combines an approximation of the set-valued gradient of $f$ on a…

We introduce the generalized notion of semicontinuity of a function defined on a topological space and derive the useful classification of the so-called Lipschitz derivatives of functions defined on a metric space. Secondly, we investigate…

We consider the task of locally correcting, and locally list-correcting, multivariate linear functions over the domain $\{0,1\}^n$ over arbitrary fields and more generally Abelian groups. Such functions form error-correcting codes of…

Probability functions appear in constraints of many optimization problems in practice and have become quite popular. Understanding their first-order properties has proven useful, not only theoretically but also in implementable algorithms,…

Graph algorithms are widely used for decision making and knowledge discovery. To ensure their effectiveness, it is essential that their output remains stable even when subjected to small perturbations to the input because frequent output…

This paper is dedicated to the spectral optimization problem \begin{equation*} \min \big\{ \lambda_1(\Omega)+\cdots+\lambda_k(\Omega) + \Lambda|\Omega| \ : \ \Omega \subset D \text{ quasi-open} \big\} \end{equation*} where…

A Random Vector Functional Link (RVFL) network is a depth-2 neural network with random inner weights and biases. Only the outer weights of such an architecture are to be learned, so the learning process boils down to a linear optimization…

We prove in this article that functions satisfying a dynamic programming principle have a local interior Lipschitz type regularity. This DPP is partly motivated by the connection to the normalized parabolic $p$-Laplace operator.

We initiate a program of average smoothness analysis for efficiently learning real-valued functions on metric spaces. Rather than using the Lipschitz constant as the regularizer, we define a local slope at each point and gauge the function…

In Euclidean space of dimension 2 or 3, we study a minimum time problem associated with a system of real-analytic vector fields satisfying H\"ormander's bracket generating condition, where the target is a nonempty closed set. We show that,…

We prove a tight lower bound (up to constant factors) on the sample complexity of any non-interactive local differentially private protocol for optimizing a linear function over the simplex. This lower bound also implies a tight lower bound…

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…

In this paper, we determine analytical bounds on the local Lipschitz constants of of affine functions composed with rectified linear units (ReLUs). Affine-ReLU functions represent a widely used layer in deep neural networks, due to the fact…

We construct a differentiable locally Lipschitz function $f$ in $\mathbb{R}^{N}$ with the property that for every convex body $K\subset \mathbb{R}^N$ there exists $\bar x \in \mathbb{R}^N$ such that $K$ coincides with the set $\partial_L…

We propose a novel Branch-and-Bound method for reachability analysis of neural networks in both open-loop and closed-loop settings. Our idea is to first compute accurate bounds on the Lipschitz constant of the neural network in certain…

We consider bandit optimization of a smooth reward function, where the goal is cumulative regret minimization. This problem has been studied for $\alpha$-H\"older continuous (including Lipschitz) functions with $0<\alpha\leq 1$. Our main…