Related papers: Relevant Sampling of Band-limited Functions
In recent years, the use of sparse recovery techniques in the approximation of high-dimensional functions has garnered increasing interest. In this work we present a survey of recent progress in this emerging topic. Our main focus is on the…
In this paper the problem of assessing bounds on the accuracy of pilot-based estimation of a bandlimited frequency selective communication channel is tackled. Mean square error is taken as a figure of merit in channel estimation and a…
In this paper we use counting arguments to prove that the expected percentage coverage of a $d$ dimensional parameter space of size $n$ when performing $k$ trials with either Latin Hypercube sampling or Orthogonal sampling (when $n=p^d$) is…
The goal of importance sampling is to estimate the expected value of a given function with respect to a probability measure $\nu$ using a random sample of size $n$ drawn from a different probability measure $\mu$. If the two measures $\mu$…
The Shannon sampling theorem for bandlimited wide sense stationary random processes was established in 1957, which and its extensions to various random processes have been widely studied since then. However, truncation of the Shannon series…
The distribution function of the sum of i.i.d. random variables of the special form is considered. Such sum describes messages posterior probabilities for random coding in binary symmetric channel. Close non-asymptotic lower and upper…
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…
The asymptotic law for the expected nodal volume of random non-Gaussian monochromatic band-limited functions is determined in vast generality. Our methods combine microlocal analytic techniques and modern probability theory. A particularly…
The purpose of this paper is to extend the result of arXiv:1810.00823 to mixed H\"older functions on $[0,1]^d$ for all $d \ge 1$. In particular, we prove that by sampling an $\alpha$-mixed H\"older function $f : [0,1]^d \rightarrow…
We consider the question of what functions can be captured by ReLU networks with an unbounded number of units (infinite width), but where the overall network Euclidean norm (sum of squares of all weights in the system, except for an…
For the representation of spin-$s$ band-limited functions on the sphere, we propose a sampling scheme with optimal number of samples equal to the number of degrees of freedom of the function in harmonic space. In comparison to the existing…
The sampling of graph signals has recently drawn much attention due to the wide applications of graph signal processing. While a lot of efficient methods and interesting results have been reported to the sampling of band-limited or smooth…
We study the distributional behavior of additive arithmetic functions evaluated at integers drawn from the harmonic distribution. Our main result shows that a broad family of such functions converges in law to conditioned Dickman-type…
A notion of local $U$-statistic process is introduced and central limit theorems in various norms are obtained for it. This involves the development of several inequalities for $U$-processes that may be useful in other contexts. This local…
In this paper, a derandomized algorithm for sampling decoding is proposed to achieve near-optimal performance in lattice decoding. By setting a probability threshold to sample candidates, the whole sampling procedure becomes deterministic,…
The paper investigates possibility of recovery of sequences from their decimated subsequences. It is shown that this recoverability is associated with certain spectrum degeneracy of a new kind, and that a sequences of a general kind can be…
We consider approximation of functions of $s$ variables, where $s$ is very large or infinite, that belong to weighted anchored spaces. We study when such functions can be approximated by algorithms designed for functions with only very…
Randomized protocols are procedures that incorporate probabilistic choices during their execution and they play a central role in quantum algorithms, spanning Hamiltonian simulation, noise mitigation, and measurement tasks. In practical…
In the framework of generalized finite element methods for elliptic equations with rough coefficients, efficiency and accuracy of the numerical method depend critically on the use of appropriate basis functions. This work explores several…
In this note, we investigate the behaviour of suprema for band-limited spherical random fields. We prove upper and lower bound for the expected values of these suprema, by means of metric entropy arguments and discrete approximations; we…