• DocumentCode
    169303
  • Title

    S-AMP: Approximate message passing for general matrix ensembles

  • Author

    Cakmak, Burak ; Winther, Ole ; Fleury, Bernard H.

  • Author_Institution
    Dept. of Electron. Syst., Aalborg Univ., Aalborg, Denmark
  • fYear
    2014
  • fDate
    2-5 Nov. 2014
  • Firstpage
    192
  • Lastpage
    196
  • Abstract
    We propose a novel iterative estimation algorithm for linear observation models called S-AMP. The fixed points of S-AMP are the stationary points of the exact Gibbs free energy under a set of (first- and second-) moment consistency constraints in the large system limit. S-AMP extends the approximate message-passing (AMP) algorithm to general matrix ensembles with a well-defined large system size limit. The generalization is based on the S-transform (in free probability) of the spectrum of the measurement matrix. Furthermore, we show that the optimality of S-AMP follows directly from its design rather than from solving a separate optimization problem as done for AMP.
  • Keywords
    free energy; iterative methods; matrix algebra; message passing; probability; variational techniques; S-AMP; S-transform; approximate message-passing algorithm; exact Gibbs free energy; first-moment consistency constraints; free probability; iterative estimation algorithm; large system size limit; linear observation models; matrix ensembles; measurement matrix; second-moment consistency constraints; stationary points; Approximation methods; Compressed sensing; Equations; Information theory; Mathematical model; Message passing; Vectors; S-transform in free probability; Variational inference; approximate message passing; free energy optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Workshop (ITW), 2014 IEEE
  • Conference_Location
    Hobart, TAS
  • ISSN
    1662-9019
  • Type

    conf

  • DOI
    10.1109/ITW.2014.6970819
  • Filename
    6970819