Bilinear Recovery Using Adaptive Vector-AMP

Subrata Sarkar, Alyson K. Fletcher, Sundeep Rangan, Philip Schniter

Research output: Contribution to journalArticle

Abstract

We consider the problem of jointly recovering the vector b and the matrix C from noisy measurements Y = A(b)C + W, where A(·) is a known affine linear function of b(i.e., A(b)=A0 + ∑i=1Q biAi with known matrices Ai). This problem has applications in matrix completion, robust PCA, dictionary learning, self-calibration, blind deconvolution, joint-channel/symbol estimation, compressive sensing with matrix uncertainty, and many other tasks. To solve this bilinear recovery problem, we propose the Bilinear Adaptive Vector Approximate Message Passing (VAMP) algorithm. We demonstrate numerically that the proposed approach is competitive with other state-of-the-art approaches to bilinear recovery, including lifted VAMP and Bilinear Generalized Approximate Message Passing.

Original languageEnglish (US)
Article number8712432
Pages (from-to)3383-3396
Number of pages14
JournalIEEE Transactions on Signal Processing
Volume67
Issue number13
DOIs
StatePublished - Jul 1 2019

Fingerprint

Message passing
Recovery
Deconvolution
Glossaries
Calibration

Keywords

  • Approximate message passing
  • computed tomography
  • dictionary learning
  • expectation maximization
  • expectation propagation
  • self-calibration

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Bilinear Recovery Using Adaptive Vector-AMP. / Sarkar, Subrata; Fletcher, Alyson K.; Rangan, Sundeep; Schniter, Philip.

In: IEEE Transactions on Signal Processing, Vol. 67, No. 13, 8712432, 01.07.2019, p. 3383-3396.

Research output: Contribution to journalArticle

Sarkar, S, Fletcher, AK, Rangan, S & Schniter, P 2019, 'Bilinear Recovery Using Adaptive Vector-AMP', IEEE Transactions on Signal Processing, vol. 67, no. 13, 8712432, pp. 3383-3396. https://doi.org/10.1109/TSP.2019.2916100
Sarkar, Subrata ; Fletcher, Alyson K. ; Rangan, Sundeep ; Schniter, Philip. / Bilinear Recovery Using Adaptive Vector-AMP. In: IEEE Transactions on Signal Processing. 2019 ; Vol. 67, No. 13. pp. 3383-3396.
@article{165c0386393e4d63b8279b0274ba7874,
title = "Bilinear Recovery Using Adaptive Vector-AMP",
abstract = "We consider the problem of jointly recovering the vector b and the matrix C from noisy measurements Y = A(b)C + W, where A(·) is a known affine linear function of b(i.e., A(b)=A0 + ∑i=1Q biAi with known matrices Ai). This problem has applications in matrix completion, robust PCA, dictionary learning, self-calibration, blind deconvolution, joint-channel/symbol estimation, compressive sensing with matrix uncertainty, and many other tasks. To solve this bilinear recovery problem, we propose the Bilinear Adaptive Vector Approximate Message Passing (VAMP) algorithm. We demonstrate numerically that the proposed approach is competitive with other state-of-the-art approaches to bilinear recovery, including lifted VAMP and Bilinear Generalized Approximate Message Passing.",
keywords = "Approximate message passing, computed tomography, dictionary learning, expectation maximization, expectation propagation, self-calibration",
author = "Subrata Sarkar and Fletcher, {Alyson K.} and Sundeep Rangan and Philip Schniter",
year = "2019",
month = "7",
day = "1",
doi = "10.1109/TSP.2019.2916100",
language = "English (US)",
volume = "67",
pages = "3383--3396",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "13",

}

TY - JOUR

T1 - Bilinear Recovery Using Adaptive Vector-AMP

AU - Sarkar, Subrata

AU - Fletcher, Alyson K.

AU - Rangan, Sundeep

AU - Schniter, Philip

PY - 2019/7/1

Y1 - 2019/7/1

N2 - We consider the problem of jointly recovering the vector b and the matrix C from noisy measurements Y = A(b)C + W, where A(·) is a known affine linear function of b(i.e., A(b)=A0 + ∑i=1Q biAi with known matrices Ai). This problem has applications in matrix completion, robust PCA, dictionary learning, self-calibration, blind deconvolution, joint-channel/symbol estimation, compressive sensing with matrix uncertainty, and many other tasks. To solve this bilinear recovery problem, we propose the Bilinear Adaptive Vector Approximate Message Passing (VAMP) algorithm. We demonstrate numerically that the proposed approach is competitive with other state-of-the-art approaches to bilinear recovery, including lifted VAMP and Bilinear Generalized Approximate Message Passing.

AB - We consider the problem of jointly recovering the vector b and the matrix C from noisy measurements Y = A(b)C + W, where A(·) is a known affine linear function of b(i.e., A(b)=A0 + ∑i=1Q biAi with known matrices Ai). This problem has applications in matrix completion, robust PCA, dictionary learning, self-calibration, blind deconvolution, joint-channel/symbol estimation, compressive sensing with matrix uncertainty, and many other tasks. To solve this bilinear recovery problem, we propose the Bilinear Adaptive Vector Approximate Message Passing (VAMP) algorithm. We demonstrate numerically that the proposed approach is competitive with other state-of-the-art approaches to bilinear recovery, including lifted VAMP and Bilinear Generalized Approximate Message Passing.

KW - Approximate message passing

KW - computed tomography

KW - dictionary learning

KW - expectation maximization

KW - expectation propagation

KW - self-calibration

UR - http://www.scopus.com/inward/record.url?scp=85066625879&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85066625879&partnerID=8YFLogxK

U2 - 10.1109/TSP.2019.2916100

DO - 10.1109/TSP.2019.2916100

M3 - Article

VL - 67

SP - 3383

EP - 3396

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 13

M1 - 8712432

ER -