English
Related papers

Related papers: Structure-Preserving Reconstruction of Convex Lips…

200 papers

In this paper we introduce the class of infinite infimal convolution functionals and apply these functionals to the regularization of ill-posed inverse problems. The proposed regularization involves an infimal convolution of a continuously…

Optimization and Control · Mathematics 2024-12-17 Kristian Bredies , Marcello Carioni , Martin Holler , Yury Korolev , Carola-Bibiane Schönlieb

It is well-known that any matrix $A$ has an LU decomposition. Less well-known is the fact that it has a 'Toeplitz decomposition' $A = T_1 T_2 \cdots T_r$ where $T_i$'s are Toeplitz matrices. We will prove that any continuous function $f :…

Machine Learning · Computer Science 2022-11-28 Yucong Liu , Simiao Jiao , Lek-Heng Lim

We study regression of $1$-Lipschitz functions under a log-concave measure $\mu$ on $\mathbb{R}^d$. We focus on the high-dimensional regime where the sample size $n$ is subexponential in $d$, in which distribution-free estimators are…

Probability · Mathematics 2025-09-15 Pierre Bizeul , Boaz Klartag

We shown that every continuous local functional on the space of finite convex functions on $\mathbb{R}^n$ is a valuation. This relation is used to establish a homogeneous decomposition for the class of polynomial local functionals as well…

Functional Analysis · Mathematics 2025-12-18 Jonas Knoerr

The geometric problem of estimating an unknown compact convex set from evaluations of its support function arises in a range of scientific and engineering applications. Traditional approaches typically rely on estimators that minimize the…

Statistics Theory · Mathematics 2021-02-26 Yong Sheng Soh , Venkat Chandrasekaran

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…

Machine Learning · Statistics 2021-01-12 Matt Jordan , Alexandros G. Dimakis

To minimize or upper-bound the value of a function "robustly", we might instead minimize or upper-bound the "epsilon-robust regularization", defined as the map from a point to the maximum value of the function within an epsilon-radius. This…

Optimization and Control · Mathematics 2010-06-10 Adrian S. Lewis , C. H. Jeffrey Pang

The main contribution of this paper is that every convex function with non-empty relative algebraic interior of its domain is Lipschitz and subdifferentiable in some algebraic sense without any additional topological constraints. The…

Optimization and Control · Mathematics 2016-11-09 Dmytro Voloshyn

Functional data that are nonnegative and have a constrained integral can be considered as samples of one-dimensional density functions. Such data are ubiquitous. Due to the inherent constraints, densities do not live in a vector space and,…

Statistics Theory · Mathematics 2016-01-13 Alexander Petersen , Hans-Georg Müller

We consider frames F in a given Hilbert space, and we show that every F may be obtained in a constructive way from a reproducing kernel and an orthonormal basis in an ambient Hilbert space. The construction is operator-theoretic, building…

Classical Analysis and ODEs · Mathematics 2007-05-23 Palle E. T. Jorgensen

Neural implicit surfaces are a promising tool for geometry processing that represent a solid object as the zero level set of a neural network. Usually trained to approximate a signed distance function of the considered object, these methods…

Computer Vision and Pattern Recognition · Computer Science 2024-07-16 Guillaume Coiffier , Louis Bethune

We study in this paper a smoothness regularization method for functional linear regression and provide a unified treatment for both the prediction and estimation problems. By developing a tool on simultaneous diagonalization of two positive…

Statistics Theory · Mathematics 2012-11-13 Ming Yuan , T. Tony Cai

We consider the problem of maximizing a convex function over a closed convex set in a real Hilbert space. For linear functions, we show that a single orthogonal projection suffices to obtain an approximate solution. For continuous convex…

Optimization and Control · Mathematics 2026-02-23 Pedro Felzenszwalb , Heon Lee

We consider deep neural networks with a Lipschitz continuous activation function and with weight matrices of variable widths. We establish a uniform convergence analysis framework in which sufficient conditions on weight matrices and bias…

Machine Learning · Computer Science 2023-06-05 Yuesheng Xu , Haizhang Zhang

We analyse the convergence of sampling algorithms for functions in reproducing kernel Hilbert spaces (RKHS). To this end, we discuss approximation properties of kernel regression under minimalistic assumptions on both the kernel and the…

Machine Learning · Statistics 2025-04-21 Armin Iske

The problem of recovering a moment-determinate multivariate function $f$ via its moment sequence is studied. Under mild conditions on $f$, the point-wise and $L_1$-rates of convergence for the proposed constructions are established. The…

Statistics Theory · Mathematics 2023-12-08 Robert Mnatsakanov , Rafik Aramyan , Farhad Jafari

We develop a version of Herbrand's theorem for continuous logic and use it to prove that definable functions in infinite-dimensional Hilbert spaces are piecewise approximable by affine functions. We obtain similar results for definable…

Logic · Mathematics 2011-07-20 Isaac Goldbring

Let $X$ be a separable real Hilbert space. We show that for every Lipschitz function $f:X\rightarrow\mathbb{R}$, and for every $\epsilon>0$, there exists a Lipschitz, real analytic function $g:X\rightarrow\mathbb{R}$ such that…

Functional Analysis · Mathematics 2015-03-23 D. Azagra , R. Fry , L. Keener

Given a convex set $C$ in a real vector space $E$ and two points $x,y\in C$, we investivate which are the possible values for the variation $f(y)-f(x)$, where $f:C\longrightarrow [m,M]$ is a bounded convex function. We then rewrite the…

Optimization and Control · Mathematics 2015-03-18 Joon Kwon

This paper presents a stochastic block-coordinate proximal Newton method for minimizing the sum of a blockwise Lipschitz-continuously differentiable function and a separable nonsmooth convex function. At each iteration, the method randomly…

Optimization and Control · Mathematics 2026-03-25 Hong Zhu , Xun Qian