资源论文Sparse Recovery with Brownian Sensing

Sparse Recovery with Brownian Sensing

2020-01-08 | |  66 |   41 |   0

Abstract

We consider the problem of recovering the parameter 图片.png of a sparse function f (i.e. the number of non-zero entries of 图片.png is small compared to the number K of features) given noisy evaluations of f at a set of well-chosen sampling points. We introduce an additional randomization process, called Brownian sensing, based on the computation of stochastic integrals, which produces a Gaussian sensing matrix, for which good recovery properties are proven, independently on the number of sampling points N , even when the features are arbitrarily non-orthogonal. Under the assumption that f is Ho?lder continuous with exponent at least 1/2, we provide an estimate 图片.png of the parameter such that 图片.png 图片.pngwhere 图片.png is the observation noise. The method uses a set of sampling points uniformly distributed along a one-dimensional curve selected according to the features. We report numerical experiments illustrating our method.

上一篇:Learning Eigenvectors for Free

下一篇:Joint 3D Estimation of Objects and Scene Layout

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...