Related papers: Wavelet Compressibility of Compound Poisson Proces…

Random feature methods have been successful in various machine learning tasks, are easy to compute, and come with theoretical accuracy bounds. They serve as an alternative approach to standard neural networks since they can represent…

We develop a framework that we call compressive rate estimation. We assume that the composite channel gain matrix (i.e. the matrix of all channel gains between all network nodes) is compressible which means it can be approximated by a…

Though quasi-Newton methods have been extensively studied in the literature, they either suffer from local convergence or use a series of line searches for global convergence which is not acceptable in the distributed setting. In this work,…

We study the use of sampling for efficiently mining the top-K frequent itemsets of cardinality at most w. To this purpose, we define an approximation to the top-K frequent itemsets to be a family of itemsets which includes (resp., excludes)…

In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor…

We analyze the convergence of compressive sensing based sampling techniques for the efficient evaluation of functionals of solutions for a class of high-dimensional, affine-parametric, linear operator equations which depend on possibly…

Bayesian Reinforcement Learning (RL) is capable of not only incorporating domain knowledge, but also solving the exploration-exploitation dilemma in a natural way. As Bayesian RL is intractable except for special cases, previous work has…

This paper is devoted to theoretical aspects on optimality of sparse approximation. We undertake a quantitative study of new types of greedy-like bases that have recently arisen in the context of nonlinear $m$-term approximation in Banach…

Directional Poisson wavelets, being directional derivatives of Poisson kernel, are introduced on $n$-dimensional spheres. It is shown that, slightly modified and together with another wavelet family, they are an admissible wavelet pair…

A compound Poisson process whose jump measure and intensity are unknown is observed at finitely many equispaced times. We construct a purely data-driven estimator of the L\'evy density $\nu$ through the spectral approach using general…

Gaussian processes scale prohibitively with the size of the dataset. In response, many approximation methods have been developed, which inevitably introduce approximation error. This additional source of uncertainty, due to limited…

This paper is first devoted to study an adaptive wavelet based estimator of the long memory parameter for linear processes in a general semi-parametric frame. This is an extension of Bardet {\it et al.} (2008) which only concerned Gaussian…

We give a general Gaussian bound for the first chaos (or innovation) of point processes with stochastic intensity constructed by embedding in a bivariate Poisson process. We apply the general result to nonlinear Hawkes processes, providing…

In this paper we deal with the regression problem in a random design setting. We investigate asymptotic optimality under minimax point of view of various Bayesian rules based on warped wavelets and show that they nearly attain optimal…

We consider learning a convex combination of basis models, and present some new theoretical and empirical results that demonstrate the effectiveness of a greedy approach. Theoretically, we first consider whether we can use linear, instead…

This note aims at presenting several new theoretical results for the compound Poisson point process, which follows the work of Zhang \emph{et al.} [Insurance~Math.~Econom.~59(2014), 325-336]. The first part provides a new characterization…

We propose a general modeling framework for marked Poisson processes observed over time or space. The modeling approach exploits the connection of the nonhomogeneous Poisson process intensity with a density function. Nonparametric Dirichlet…

Compressive sensing is a powerful technique for recovering sparse solutions of underdetermined linear systems, which is often encountered in uncertainty quantification analysis of expensive and high-dimensional physical models. We perform…

We discuss the upper and lower estimates for the rate of convergence of Pure and Orthogonal Greedy Algorithms for dictionary with bounded cumulative coherence.

This paper studies the fundamental limits of the minimum average length of lossless and lossy variable-length compression, allowing a nonzero error probability $\epsilon$, for lossless compression. We give non-asymptotic bounds on the…