Related papers: Bounds on Kolmogorov widths and sampling recovery …

The aim of this work is to introduced the concept of the best one-sided approximation of unbounded functions in weighted space by using algebraic operators in terms the average modulus of smoothness. We also show an estimate of the degree…

In this paper we study the Gelfand and Kolmogorov numbers of Sobolev embeddings between weighted function spaces of Besov and Triebel-Lizorkin type with polynomial weights. The sharp asymptotic estimates are determined in the so-called…

We study the large-width asymptotics of random fully connected neural networks with weights drawn from $\alpha$-stable distributions, a family of heavy-tailed distributions arising as the limiting distributions in the Gnedenko-Kolmogorov…

The coding theorem for Kolmogorov complexity states that any string sampled from a computable distribution has a description length close to its information content. A coding theorem for resource-bounded Kolmogorov complexity is the key to…

We present an inverse problem which uses the renormalized area functional on minimal submanifolds to recover the expansion of asymptotically hyperbolic, conformally compact metrics which are partially even to high order. We use a rigidity…

In this article, we study approximation properties of the variation spaces corresponding to shallow neural networks with a variety of activation functions. We introduce two main tools for estimating the metric entropy, approximation rates,…

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…

This article studies the achievable guarantees on the error rates of certain learning algorithms, with particular focus on refining logarithmic factors. Many of the results are based on a general technique for obtaining bounds on the error…

Infinite-dimensional, holomorphic functions have been studied in detail over the last several decades, due to their relevance to parametric differential equations and computational uncertainty quantification. The approximation of such…

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

We prove that any unconditional set in $\mathbb{R}^N$ that is invariant under cyclic shifts of coordinates is rigid in $\ell_q^N$, $1\le q\le 2$, i.e. it can not be well approximated by linear spaces of dimension essentially smaller than…

We study $L_q$-approximation and integration for functions from the Sobolev space $W^s_p(\Omega)$ and compare optimal randomized (Monte Carlo) algorithms with algorithms that can only use iid sample points, uniformly distributed on the…

Estimates for Kolmogorov and linear widths of some weighted Sobolev classes on a John domain are obtained.

This short note presents a linear algebraic approach to proving dimension lower bounds for linear methods that solve $L^2$ function approximation problems. The basic argument has appeared in the literature before (e.g., Barron, 1993) for…

We find two-sides estimates for the best uniform approximations of classes of convolutions of $2\pi$-periodic functions from unit ball of the space $L_p, 1 \le p <\infty,$ with fixed kernels, modules of Fourier coefficients of which satisfy…

We provide a comprehensive study of interrelations between different measures of smoothness of functions on various domains and smoothness properties of approximation processes. Two general approaches to this problem have been developed:…

In this series of articles, we analyse the level-sets of length functions on the moduli space of compact hyperbolic surfaces of fixed genus. This work ultimately culminates in a proof that typical hyperbolic surfaces have an optimal…

In this paper we find the orders of decay for Kolmogorov widths of some Besov classes related to $W^1_1$ (the behaviour of the widths for $W^1_1$ remains unknown): $$ d_n(B^1_{1,\theta}[0,1],L_q[0,1])\asymp…

Several imaging algorithms including patch-based image denoising, image time series recovery, and convolutional neural networks can be thought of as methods that exploit the manifold structure of signals. While the empirical performance of…

We study weighted Chebyshev polynomials on compact subsets of the complex plane with respect to a bounded weight function. We establish existence and uniqueness of weighted Chebyshev polynomials and derive weighted analogs of Kolmogorov's…