Related papers: Wavelet Compressibility of Compound Poisson Proces…
This work consists in the asymptotic analysis of the solution of Poisson equation in a bounded domain of $\mathbb{R}^{P}$ $(P=2,3)$ with a thin layer. We use a method based on hierarchical variational equations to derive asymptotic…
In the context of high-dimensional linear regression models, we propose an algorithm of exact support recovery in the setting of noisy compressed sensing where all entries of the design matrix are independent and identically distributed…
We consider the approximation of a convolution of possibly different probability measures by (compound) Poisson distributions and also by related signed measures of higher order. We present new total variation bounds having a better…
We investigate the limiting behavior of discrete determinantal point processes (DPPs) towards continuous DPPs when the size of the set to sample from goes to infinity. We propose a non-asymptotic characterization of this limit in terms of…
A mixed Gaussian fractional process $\{Y(t)\}_{t \in {\Bbb R}} = \{PX(t)\}_{t \in {\Bbb R}}$ is a multivariate stochastic process obtained by pre-multiplying a vector of independent, Gaussian fractional process entries $X$ by a nonsingular…
Let $\eta_t$ be a Poisson point process of intensity $t\geq 1$ on some state space $\Y$ and $f$ be a non-negative symmetric function on $\Y^k$ for some $k\geq 1$. Applying $f$ to all $k$-tuples of distinct points of $\eta_t$ generates a…
As a means of improving analysis of biological shapes, we propose an algorithm for sampling a Riemannian manifold by sequentially selecting points with maximum uncertainty under a Gaussian process model. This greedy strategy is known to be…
We prove weak convergence of triangular arrays to the compound Poisson limit using Tikhomirov's method. The result is applied to statistical estimation of the threshold parameter in autoregressive models.
This paper develops the use of wavelets as a basis set for the solution of physical problems exhibiting behavior over wide-ranges in length scale. In a simple diagrammatic language, this article reviews both the mathematical underpinnings…
We consider the problem of sparse atomic optimization, where the notion of "sparsity" is generalized to meaning some linear combination of few atoms. The definition of atomic set is very broad; popular examples include the standard basis,…
Gaussian process regression is a classical kernel method for function estimation and data interpolation. In large data applications, computational costs can be reduced using low-rank or sparse approximations of the kernel. This paper…
Fourier extension is an approximation method that alleviates the periodicity requirements of Fourier series and avoids the Gibbs phenomenon when approximating functions. We describe a similar extension approach using regular wavelet bases…
Sparse signal representations based on linear combinations of learned atoms have been used to obtain state-of-the-art results in several practical signal processing applications. Approximation methods are needed to process high-dimensional…
Compressive Sensing (CS) exploits the surprising fact that the information contained in a sparse signal can be preserved in a small number of compressive, often random linear measurements of that signal. Strong theoretical guarantees have…
The paper investigates uniform convergence of wavelet expansions of Gaussian random processes. The convergence is obtained under simple general conditions on processes and wavelets which can be easily verified. Applications of the developed…
A compound Poisson process whose randomized time is an independent Poisson process is called compound Poisson process with Poisson subordinator. We provide its probability distribution, which is expressed in terms of the Bell polynomials,…
It is a survey on recent results in constructive sparse approximation. Three directions are discussed here: (1) Lebesgue-type inequalities for greedy algorithms with respect to a special class of dictionaries, (2) constructive sparse…
Compressive Sensing (CS) is a new paradigm for the efficient acquisition of signals that have sparse representation in a certain domain. Traditionally, CS has provided numerous methods for signal recovery over an orthonormal basis. However,…
Bayesian hierarchical Poisson models are an essential tool for analyzing count data. However, designing efficient algorithms to sample from the posterior distribution of the target parameters remains a challenging task for this class of…
Gaussian processes are powerful models for probabilistic machine learning, but are limited in application by their $O(N^3)$ inference complexity. We propose a method for deriving parametric families of kernel functions with compact spatial…