Related papers: Multivariate exact and falsified sampling approxim…

We propose a multi-shell sampling grid and develop corresponding transforms for the accurate reconstruction of the diffusion signal in diffusion MRI by expansion in the spherical polar Fourier (SPF) basis. The transform is exact in the…

We establish asymptotic estimates for the least upper bounds of approximations in the uniform metric by Fourier sums of order $n-1$ of classes of $2\pi$-periodic Weyl--Nagy differentiable functions, $W^r_{\beta,p}, 1\le p\le \infty,…

Let $B^p_{\sigma}$, $1\le p<\infty$, $\sigma>0$, denote the space of all $f\in L^p(\mathbb{R})$ such that the Fourier transform of $f$ (in the sense of distributions) vanishes outside $[-\sigma,\sigma]$. The classical sampling theorem…

We consider the problem of estimating an arbitrary smooth functional of $k \geq 1 $ distribution functions (d.f.s.) in terms of random samples from them. The natural estimate replaces the d.f.s by their empirical d.f.s. Its bias is…

In this paper, we focus on the approximation of smooth functions $f: [-\pi, \pi] \rightarrow \mathbb{C}$, up to an unresolvable global phase ambiguity, from a finite set of Short Time Fourier Transform (STFT) magnitude (i.e., spectrogram)…

We consider conditional tests for non-negative discrete exponential families. We develop two Markov Chain Monte Carlo (MCMC) algorithms which allow us to sample from the conditional space and to perform approximated tests. The first…

The approximation properties of the finite element method can often be substantially improved by choosing smooth high-order basis functions. It is extremely difficult to devise such basis functions for partitions consisting of arbitrarily…

In terms of the best approximations of functions and generalized moduli of smoothness, direct and inverse approximation theorems are proved for Besicovitch almost periodic functions whose Fourier exponent sequences have a single limit point…

Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fundamental in many applications like diagnosis, natural…

We provide sufficient conditions on a family of functions $(\phi_\alpha)_{\alpha\in A}:\mathbb{R}^d\to\mathbb{R}$ for sampling of multivariate bandlimited functions at certain nonuniform sequences of points in $\mathbb{R}^d$. We consider…

Let $F$ be a class of functions on a probability space $(\Omega,\mu)$ and let $X_1,...,X_k$ be independent random variables distributed according to $\mu$. We establish high probability tail estimates of the form $\sup_{f \in F} |\{i :…

The approximation of smooth functions with a spectral basis typically leads to rapidly decaying coefficients where the rate of decay depends on the smoothness of the function and vice-versa. The optimal number of degrees of freedom in the…

Gravitational-wave astronomers often wish to characterize the expected parameter-estimation accuracy of future observations. The Fisher matrix provides a lower bound on the spread of the maximum-likelihood estimator across noise…

Information divergences allow one to assess how close two distributions are from each other. Among the large panel of available measures, a special attention has been paid to convex $\varphi$-divergences, such as Kullback-Leibler,…

Recently we developed a new sampling methodology based on incomplete cosine expansion of the sinc function and applied it in numerical integration in order to obtain a rational approximation for the complex error function $w\left(z \right)…

We consider 1-dimensional location estimation, where we estimate a parameter $\lambda$ from $n$ samples $\lambda + \eta_i$, with each $\eta_i$ drawn i.i.d. from a known distribution $f$. For fixed $f$ the maximum-likelihood estimate (MLE)…

Given a finite number of samples of a continuous set-valued function F, mapping an interval to compact subsets of the real line, we develop good approximations of F, which can be computed efficiently.

We study distributed low rank approximation in which the matrix to be approximated is only implicitly represented across the different servers. For example, each of $s$ servers may have an $n \times d$ matrix $A^t$, and we may be interested…

Certain applications such as Magnetic Resonance Imaging (MRI) require the reconstruction of functions from Fourier spectral data. When the underlying functions are piecewise-smooth, standard Fourier approximation methods suffer from the…

Given a loss function $F:\mathcal{X} \rightarrow \R^+$ that can be written as the sum of losses over a large set of inputs $a_1,\ldots, a_n$, it is often desirable to approximate $F$ by subsampling the input points. Strong theoretical…