Skip to content
naulon
Not checkedNot checked for notices yet.

Learning-based accelerated sparse signal recovery algorithms

Dohyun Kim, Daeyoung Park

ICT Express · 2021

doi:10.1016/j.icte.2021.03.011 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

In this paper, we propose an accelerated sparse recovery algorithm based on inexact alternating direction of multipliers. We formulate a sparse recovery problem with a concave regularizer and solve it with the relaxed and accelerated alternating method of multipliers (R-A-ADMM). We introduce learnable parameters to optimize the algorithm with given data sets. The derived algorithm is an accelerated version of LISTA-AT that controls the threshold for each entry according to the previously recovered estimate. Numerical results show that the proposed Accel-LISTA-AT algorithm converges much faster and recovers the sparse signals with lower mean squared errors than the other learning-based sparse recovery algorithms.

Abstract licence: CC BY-NC-ND

References19

    19 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.