Related papers: $L^p$ sampling numbers for the Fourier-analytic Ba…
We prove several characterizations of the Hardy spaces for Fourier integral operators $\mathcal{H}^{p}_{FIO}(\mathbb{R}^{n})$, for $1<p<\infty$. First we characterize $\mathcal{H}^{p}_{FIO}(\mathbb{R}^{n})$ in terms of…
We derive sparse bounds for the bilinear spherical maximal function in any dimension $d\geq 1$. When $d\geq 2$, this immediately recovers the sharp $L^p\times L^q\to L^r$ bound of the operator and implies quantitative weighted norm…
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…
We consider the spaces $A_p(\mathbb T^m)$ of functions $f$ on the $m$ -dimensional torus $\mathbb T^m$ such that the sequence of the Fourier coefficients $\hat{f}=\{\hat{f}(k), ~k \in \mathbb Z^m\}$ belongs to $l^p(\mathbb Z^m), ~1\leq…
In metric of spaces $L_{s}, \ 1< s\leq\infty$, we obtain exact order estimates of best approximations and approximations by Fourier sums of classes of convolutions the periodic functions that belong to unit ball of space $L_{1}$, with…
For a class $F$ of complex-valued functions on a set $D$, we denote by $g_n(F)$ its sampling numbers, i.e., the minimal worst-case error on $F$, measured in $L_2$, that can be achieved with a recovery algorithm based on $n$ function…
We prove convergence rates of linear sampling recovery of functions in abstract Bochner spaces satisfying weighted summability of their generalized polynomial chaos expansion coefficients. The underlying algorithm is a function-valued…
We consider fast, provably accurate algorithms for approximating functions on the $d$-dimensional torus, $f: \mathbb{ T }^d \rightarrow \mathbb{C}$, that are sparse (or compressible) in the Fourier basis. In particular, suppose that the…
This paper presents some results on a well-known problem in Algebraic Signal Sampling and in other areas of applied mathematics: reconstruction of piecewise-smooth functions from their integral measurements (like moments, Fourier…
We show that independent and uniformly distributed sampling points are as good as optimal sampling points for the approximation of functions from the Sobolev space $W_p^s(\Omega)$ on bounded convex domains $\Omega\subset \mathbb{R}^d$ in…
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…
Katz and Sarnak conjectured a correspondence between the $n$-level density statistics of zeros from families of $L$-functions with eigenvalues from random matrix ensembles. In many cases the sums of smooth test functions, whose Fourier…
We address the problem of minimizing a smooth function $f^0(x)$ over a compact set $D$ defined by smooth functional constraints $f^i(x)\leq 0,~ i = 1,\ldots, m$ given noisy value measurements of $f^i(x)$. This problem arises in…
Let $X$ be a supermartingale starting from $0$ which has only nonnegative jumps. For each $0<p<1$ we determine the best constants $c_p$, $C_p$ and $\mathfrak{c}_p$ such that $$ \,\,\,\,\sup_{t\geq 0}\left|\left|X_t\right|\right|_p\leq…
We obtain exact for order estimates of best uniform approximations and uniform approximations by Fourier sums of classes of convolutions the periodic functions belong to unit balls of spaces $L_{p}, \ {1\leq p<\infty}$, with generating…
We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…
For a real-valued function $f$ on a metric measure space $(X,d,\mu)$ the Hardy-Littlewood maximal-function of $f$ is given by the following `supremum-norm':…
This paper investigates the approximation properties of shallow neural networks with activation functions that are powers of exponential functions. It focuses on the dependence of the approximation rate on the dimension and the smoothness…
For the space of functions that can be approximated by linear chirps, we prove a reconstruction theorem by random sampling at arbitrary rates.
We study the elliptic maximal functions defined by averages over ellipses and rotated ellipses which are multi-parametric variants of the circular maximal function. We prove that those maximal functions are bounded on $L^p$ for some $p\neq…