Related papers: Characterization theorem for best polynomial splin…
We prove the analogue of the Martingale Convergence Theorem for polynomial spline sequences. Given a natural number $k $ and a sequence $(t_i)$ of knots in $[0,1]$ with multiplicity $\le k-1$, we let $P_n $ be the orthogonal projection onto…
The purpose of this paper is to present the critical cases of the trace theorems for the restriction of functions to closed surfaces, and to give the asymptotics for the norms of the traces under dilations of the surface. We also discuss…
We consider a homogeneous, constant rank differential operator $\mathcal{A}$ and prove a characterisation theorem for $\mathcal{A}$-quasiaffine functions in the spirit of Ball, Currie and Olver (1981); i.e. functions such that \[ f(v) =…
We present a general variational framework for the training of freeform nonlinearities in layered computational architectures subject to some slope constraints. The regularization that we add to the traditional training loss penalizes the…
We examine the necessary and sufficient complexity of neural networks to approximate functions from different smoothness spaces under the restriction of encodable network weights. Based on an entropy argument, we start by proving lower…
We prove an analogue of the classical Bernstein theorem concerning the rate of polynomial approximation of piecewise analytic functions on a compact subset of the real line.
In the recent paper [2], it was proved that the closure of the planar diffeomorphisms in the Sobolev norm consists of the functions which are non-crossing (NC), i.e., the functions which can be uniformly approximated by continuous…
This paper discusses some geometric ideas associated with knots in real projective 3-space $\mathbb{R}P^3$. These ideas are borrowed from classical knot theory. Since knots in $\mathbb{R}P^3$ are classified into three disjoint classes, -…
We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…
We provide the first positive result on the nonsmooth optimization landscape of robust principal component analysis, to the best of our knowledge. It is the object of several conjectures and remains mostly uncharted territory. We identify a…
We construct a family of monotone and convex $C^1$ integro cubic splines under a strictly convex position of the dataset. Then, we find an optimal spline by considering its approximation properties. Finally, we give some examples to…
The theory of Chebyshev (uniform) approximation for univariate polynomial and piecewise polynomial functions has been studied for decades. The optimality conditions are based on the notion of alternating sequence. However, the extension the…
Approximate stationarity conditions provide necessary optimality conditions without requiring additional assumptions by demanding that a perturbed stationarity system possesses solutions as the involved perturbations tend to zero. Together…
A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…
We use the famous knot-theoretic consequence of Freedman's disc theorem---knots with trivial Alexander polynomial bound a locally-flat disc in the 4-ball---to prove the following generalization. The degree of the Alexander polynomial of a…
In this paper we consider the minimization of a continuous function that is potentially not differentiable or not twice differentiable on the boundary of the feasible region. By exploiting an interior point technique, we present first- and…
A new nonparametric approach for system identification has been recently proposed where the impulse response is seen as the realization of a zero--mean Gaussian process whose covariance, the so--called stable spline kernel, guarantees that…
The phenomenon, known as "supersmoothness" was first observed for bivariate splines and attributed to the polynomial nature of splines. Using only standard tools from multivatiate calculus, we show that if we continuously glue two smooth…
In this work we consider the problem of recovering non-uniform splines from their projection onto spaces of algebraic polynomials. We show that under a certain Chebyshev-type separation condition on its knots, a spline whose inner-products…
We obtain a necessary and sufficient condition for the orthomartingale-coboundary decomposition. We establish a sufficient condition for the approximation of the partial sums of a strictly stationary random fields by those of stationary…