Related papers: Structural Risk Minimization for $C^{1,1}(\mathbb{…

Let $C$ be a subset of $\mathbb{R}^n$ (not necessarily convex), $f:C\to\mathbb{R}$ be a function, and $G:C\to\mathbb{R}^n$ be a uniformly continuous function, with modulus of continuity $\omega$. We provide a necessary and sufficient…

Convex functionals are ubiquitous in applied analysis, appearing as value functions, risk measures, super-hedging prices, and loss functionals in machine learning. In many applications, however, the functional is only observed through…

Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the minimization of the sum of a (weakly) smooth function endowed…

We study monotonicity testing of functions $f \colon \{0,1\}^d \to \{0,1\}$ using sample-based algorithms, which are only allowed to observe the value of $f$ on points drawn independently from the uniform distribution. A classic result by…

We consider the problem of the uniform (in $L_\infty$) recovery of ridge functions $f(x)=\varphi(\langle a,x\rangle)$, $x\in B_2^n$, using noisy evaluations $y_1\approx f(x^1),\ldots,y_N\approx f(x^N)$. It is known that for classes of…

This article addresses structure-preserving smooth approximation of semiconcave functions. semiconcave functions are of particular interest because they naturally arise in a variety of variational problems, including {optimal feedback…

We study approximation and statistical learning properties of deep ReLU networks under structural assumptions that mitigate the curse of dimensionality. We prove minimax-optimal uniform approximation rates for $s$-H\"older smooth functions…

Consider the class of zero-mean functions with fixed $L^{\infty}$ and $L^1$ norms and exactly $N\in \mathbb{N}$ nodal points. Which functions $f$ minimize $W_p(f_+,f_-)$, the Wasserstein distance between the measures whose densities are the…

Let $\mathbb{H}$ be a Hilbert space, $E \subset \mathbb{H}$ be an arbitrary subset and $f: E \rightarrow \mathbb{R}, \: G: E \rightarrow \mathbb{H}$ be two functions. We give a necessary and sufficient condition on the pair $(f,G)$ for the…

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,…

Let $\mathcal{A}$ denote the class of all analytic functions $f$ in the unit disk $\mathbb{D}:=\{z\in\mathbb{C}: |z|<1\}$ such that $f(0)=f'(0)-1=0$. In this paper, we introduce a new subclass $\mathcal{C}_\theta(\gamma)$ of $\mathcal{A}$…

We deal with monotonic regression of multivariate functions $f: Q \to \mathbb{R}$ on a compact rectangular domain $Q$ in $\mathbb{R}^d$, where monotonicity is understood in a generalized sense: as isotonicity in some coordinate directions…

The approximation of Sobolev homeomorphisms by smooth diffeomorphisms is well understood in first-order spaces $W^{1,p}$, but remains largely open in the second-order space $W^{2,1}$ due to a fundamental tension between curvature control…

We study the problem of global maximization of a function f given a finite number of evaluations perturbed by noise. We consider a very weak assumption on the function, namely that it is locally smooth (in some precise sense) with respect…

The celebrated universal approximation theorems for neural networks roughly state that any reasonable function can be arbitrarily well-approximated by a network whose parameters are appropriately chosen real numbers. This paper examines the…

We study the necessary and sufficient complexity of ReLU neural networks---in terms of depth and number of weights---which is required for approximating classifier functions in $L^2$. As a model class, we consider the set $\mathcal{E}^\beta…

We show how Lasry-Lions's result on regularization of functions defined on $\mathbb{R}^n$ or on Hilbert spaces by sup-inf convolutions with squares of distances can be extended to (finite or infinite dimensional) Riemannian manifolds $M$ of…

Given a weighted graph with $N$ vertices, consider a real-valued regression problem in a semi-supervised setting, where one observes $n$ labeled vertices, and the task is to label the remaining ones. We present a theoretical study of…

The active regression problem of the single-index model is to solve $\min_x \lVert f(Ax)-b\rVert_p$, where $A$ is fully accessible and $b$ can only be accessed via entry queries, with the goal of minimizing the number of queries to the…

We show that $C^0$-fine approximation of convex functions by smooth (or real analytic) convex functions on $\R^d$ is possible in general if and only if $d=1$. Nevertheless, for $d\geq 2$ we give a characterization of the class of convex…