RLS Recovery with Asymmetric Penalty: Fundamental Limits and Algorithmic Approaches
arXiv:1805.11895
Abstract
This paper studies regularized least square recovery of signals whose samples' prior distributions are nonidentical, e.g., signals with time-variant sparsity. For this model, Bayesian framework suggests to regularize the least squares term with an asymmetric penalty. We investigate this problem in two respects: First, we characterize the asymptotic performance via the replica method and then discuss algorithmic approaches to the problem. Invoking the asymptotic characterization of the performance, we propose a tuning strategy to optimally tune the algorithmic approaches for recovery. To demonstrate applications of the results, the particular example of BPSK recovery is investigated and the efficiency of the proposed strategy is depicted in the shadow of results available in the literature
arXiv comment5 pages, 1 figure; To be presented in second International Balkan Conference on Communications and Networking (BalkanCom), June 2018
References in corpus (7)
- Message Passing Algorithms for Compressed Sensing
- Modified-CS: Modifying Compressive Sensing for Problems with Partially Known Support
- Asymptotic Analysis of MAP Estimation via the Replica Method and Applications to Compressed Sensing
- A Short Note on Compressed Sensing with Partially Known Signal Support
- The sample complexity of weighted sparse approximation
- Optimal incorporation of sparsity information by weighted optimization
- Precoding via Approximate Message Passing with Instantaneous Signal Constraints