Dynamics of Damped Approximate Message Passing Algorithms

Kazushi Mimura; Jun'Ichi Takeuchi

doi:10.1109/ITW44776.2019.8989237

Dynamics of Damped Approximate Message Passing Algorithms

Kazushi Mimura, Jun'Ichi Takeuchi

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

For linear system models, the approximate massage passing (AMP) is one of the effective iterative sparse recovery algorithms. However, depending on a measurement matrix ensemble, AMP may face convergence issues. Some algorithms are proposed so far to avoid the convergence issues, e.g., the orthogonal AMP (OAMP) and the mean removal. One of the simplest ways to avoid the convergence issues is to introduce a damping effect into AMP. In this paper, we derive a simple recursive equations that characterizes the damped OAMP, which is an OAMP in which the damping effect is introduced, and show that the result can be applied to the damped version of the original AMP.

Original language	English
Title of host publication	2019 IEEE Information Theory Workshop, ITW 2019
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781538669006
DOIs	https://doi.org/10.1109/ITW44776.2019.8989237
Publication status	Published - Aug 2019
Event	2019 IEEE Information Theory Workshop, ITW 2019 - Visby, Sweden Duration: Aug 25 2019 → Aug 28 2019

Publication series

Name	2019 IEEE Information Theory Workshop, ITW 2019

Conference

Conference	2019 IEEE Information Theory Workshop, ITW 2019
Country	Sweden
City	Visby
Period	8/25/19 → 8/28/19

All Science Journal Classification (ASJC) codes

Software
Computational Theory and Mathematics
Computer Networks and Communications
Information Systems

Access to Document

10.1109/ITW44776.2019.8989237

Fingerprint Dive into the research topics of 'Dynamics of Damped Approximate Message Passing Algorithms'. Together they form a unique fingerprint.

Cite this

Mimura, K., & Takeuchi, JI. (2019). Dynamics of Damped Approximate Message Passing Algorithms. In 2019 IEEE Information Theory Workshop, ITW 2019 [8989237] (2019 IEEE Information Theory Workshop, ITW 2019). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW44776.2019.8989237

Mimura, K & Takeuchi, JI 2019, Dynamics of Damped Approximate Message Passing Algorithms. in 2019 IEEE Information Theory Workshop, ITW 2019., 8989237, 2019 IEEE Information Theory Workshop, ITW 2019, Institute of Electrical and Electronics Engineers Inc., 2019 IEEE Information Theory Workshop, ITW 2019, Visby, Sweden, 8/25/19. https://doi.org/10.1109/ITW44776.2019.8989237

@inproceedings{e3339e4006d5432d9e74b33d15fa2e95,

title = "Dynamics of Damped Approximate Message Passing Algorithms",

abstract = "For linear system models, the approximate massage passing (AMP) is one of the effective iterative sparse recovery algorithms. However, depending on a measurement matrix ensemble, AMP may face convergence issues. Some algorithms are proposed so far to avoid the convergence issues, e.g., the orthogonal AMP (OAMP) and the mean removal. One of the simplest ways to avoid the convergence issues is to introduce a damping effect into AMP. In this paper, we derive a simple recursive equations that characterizes the damped OAMP, which is an OAMP in which the damping effect is introduced, and show that the result can be applied to the damped version of the original AMP.",

author = "Kazushi Mimura and Jun'Ichi Takeuchi",

year = "2019",

month = aug,

doi = "10.1109/ITW44776.2019.8989237",

language = "English",

series = "2019 IEEE Information Theory Workshop, ITW 2019",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2019 IEEE Information Theory Workshop, ITW 2019",

address = "United States",

note = "2019 IEEE Information Theory Workshop, ITW 2019 ; Conference date: 25-08-2019 Through 28-08-2019",

}

TY - GEN

T1 - Dynamics of Damped Approximate Message Passing Algorithms

AU - Mimura, Kazushi

AU - Takeuchi, Jun'Ichi

PY - 2019/8

Y1 - 2019/8

N2 - For linear system models, the approximate massage passing (AMP) is one of the effective iterative sparse recovery algorithms. However, depending on a measurement matrix ensemble, AMP may face convergence issues. Some algorithms are proposed so far to avoid the convergence issues, e.g., the orthogonal AMP (OAMP) and the mean removal. One of the simplest ways to avoid the convergence issues is to introduce a damping effect into AMP. In this paper, we derive a simple recursive equations that characterizes the damped OAMP, which is an OAMP in which the damping effect is introduced, and show that the result can be applied to the damped version of the original AMP.

AB - For linear system models, the approximate massage passing (AMP) is one of the effective iterative sparse recovery algorithms. However, depending on a measurement matrix ensemble, AMP may face convergence issues. Some algorithms are proposed so far to avoid the convergence issues, e.g., the orthogonal AMP (OAMP) and the mean removal. One of the simplest ways to avoid the convergence issues is to introduce a damping effect into AMP. In this paper, we derive a simple recursive equations that characterizes the damped OAMP, which is an OAMP in which the damping effect is introduced, and show that the result can be applied to the damped version of the original AMP.

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

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

U2 - 10.1109/ITW44776.2019.8989237

DO - 10.1109/ITW44776.2019.8989237

M3 - Conference contribution

T3 - 2019 IEEE Information Theory Workshop, ITW 2019

BT - 2019 IEEE Information Theory Workshop, ITW 2019

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2019 IEEE Information Theory Workshop, ITW 2019

Y2 - 25 August 2019 through 28 August 2019

ER -