English
Related papers

Related papers: Direct and Converse Theorems in Estimating Signals…

200 papers

In high-dimensional statistical inference in which the number of parameters to be estimated is larger than that of the holding data, regularized linear estimation techniques are widely used. These techniques have, however, some drawbacks.…

Methodology · Statistics 2025-08-06 Takashi Takahashi , Yoshiyuki Kabashima

Compressed sensing posits that, within limits, one can undersample a sparse signal and yet reconstruct it accurately. Knowing the precise limits to such undersampling is important both for theory and practice. We present a formula that…

Information Theory · Computer Science 2013-01-09 David Donoho , Iain Johnstone , Andrea Montanari

In this work we introduce a novel stochastic algorithm dubbed SNIPS, which draws samples from the posterior distribution of any linear inverse problem, where the observation is assumed to be contaminated by additive white Gaussian noise.…

Image and Video Processing · Electrical Eng. & Systems 2021-11-11 Bahjat Kawar , Gregory Vaksman , Michael Elad

We consider the inverse problem of recovering an unknown functional parameter $u$ in a separable Banach space, from a noisy observation $y$ of its image through a known possibly non-linear ill-posed map ${\mathcal G}$. The data $y$ is…

Statistics Theory · Mathematics 2018-03-14 Sergios Agapiou , Martin Burger , Masoumeh Dashti , Tapio Helin

We investigate the performance of distributed least-mean square (LMS) algorithms for parameter estimation over sensor networks where the regression data of each node are corrupted by white measurement noise. Under this condition, we show…

Systems and Control · Computer Science 2016-11-18 Reza Abdolee , Benoit Champagne

In this paper, we study the sparse nonnegative tensor factorization and completion problem from partial and noisy observations for third-order tensors. Because of sparsity and nonnegativity, the underlying tensor is decomposed into the…

Machine Learning · Statistics 2021-10-22 Xiongjun Zhang , Michael K. Ng

We consider estimation models of the form $Y=X^*+N$, where $X^*$ is some $m$-dimensional signal we wish to recover, and $N$ is symmetrically distributed noise that may be unbounded in all but a small $\alpha$ fraction of the entries. We…

Machine Learning · Computer Science 2022-11-15 Tommaso d'Orsi , Rajai Nasser , Gleb Novikov , David Steurer

In this paper, we propose a Bayesian MAP estimator for solving the deconvolution problems when the observations are corrupted by Poisson noise. Towards this goal, a proper data fidelity term (log-likelihood) is introduced to reflect the…

Applications · Statistics 2011-03-14 François-Xavier Dupé , Jalal Fadili , Jean-Luc Starck

In this paper, an algorithm for estimation and compensation of second-order nonlinearity in wireless sensor setwork (WSN) in distributed estimation framework is proposed. First, the effect of second-order nonlinearity on the performance of…

Signal Processing · Electrical Eng. & Systems 2024-03-19 Hadi Zayyani , Mehdi Korki

Precise estimation of cross-correlation or similarity between two random variables lies at the heart of signal detection, hyperdimensional computing, associative memories, and neural networks. Although a vast literature exists on different…

Machine Learning · Computer Science 2023-11-02 Zhili Xiao , Shantanu Chakrabartty

In the standard Gaussian linear measurement model $Y=X\mu_0+\xi \in \mathbb{R}^m$ with a fixed noise level $\sigma>0$, we consider the problem of estimating the unknown signal $\mu_0$ under a convex constraint $\mu_0 \in K$, where $K$ is a…

Statistics Theory · Mathematics 2022-01-24 Qiyang Han

This paper considers the model of an arbitrary distributed signal x observed through an added independent white Gaussian noise w, y=x+w. New relations between the minimal mean square error of the non-causal estimator and the likelihood…

Probability · Mathematics 2016-11-18 Moshe Zakai

In this work, we examine the optimality of Gaussian signalling for covert communications with an upper bound on $\mathcal{D}(p_{_1}||p_{_0})$ or $\mathcal{D}(p_{_0}||p_{_1})$ as the covertness constraint, where $\mathcal{D}(p_{_1}||p_{_0})$…

Information Theory · Computer Science 2019-05-10 Shihao Yan , Yirui Cong , Stephen Hanly , Xiangyun Zhou

This paper considers a sequential estimation and sensor scheduling problem in the presence of multiple communication channels. As opposed to the classical remote estimation problem that involves one perfect (noiseless) channel and one…

Information Theory · Computer Science 2015-10-02 Xiaobin Gao , Emrah Akyol , Tamer Basar

We consider minimum variance estimation within the sparse linear Gaussian model (SLGM). A sparse vector is to be estimated from a linearly transformed version embedded in Gaussian noise. Our analysis is based on the theory of reproducing…

Information Theory · Computer Science 2013-04-16 Alexander Jung , Sebastian Schmutzhard , Franz Hlawatsch , Zvika Ben-Haim , Yonina C. Eldar

We consider unbiased estimation of a sparse nonrandom vector corrupted by additive white Gaussian noise. We show that while there are infinitely many unbiased estimators for this problem, none of them has uniformly minimum variance.…

Statistics Theory · Mathematics 2010-06-02 Alexander Jung , Zvika Ben-Haim , Franz Hlawatsch , Yonina C. Eldar

This paper deals with arbitrarily distributed finite-power input signals observed through an additive Gaussian noise channel. It shows a new formula that connects the input-output mutual information and the minimum mean-square error (MMSE)…

Information Theory · Computer Science 2007-07-13 Dongning Guo , Shlomo Shamai , Sergio Verdu

New problems arise when the standard theory of joint detection and estimation is applied to a set of signals drawn from a continuous family; decision thresholds must be determined as a function of the continuous parameter x characterizing…

Statistics Theory · Mathematics 2014-07-17 D. Michael Milder , Robert G. Lindgren , Morris M. Berman

We present a novel statistically-based discretization paradigm and derive a class of maximum a posteriori (MAP) estimators for solving ill-conditioned linear inverse problems. We are guided by the theory of sparse stochastic processes,…

Information Theory · Computer Science 2015-06-11 Emrah Bostan , Ulugbek S. Kamilov , Masih Nilchian , Michael Unser

The problem of estimating a high-dimensional sparse vector $\boldsymbol{\theta} \in \mathbb{R}^n$ from an observation in i.i.d. Gaussian noise is considered. The performance is measured using squared-error loss. An empirical Bayes shrinkage…

Information Theory · Computer Science 2018-12-31 Pavan Srinath , Ramji Venkataramanan