Tree-AMP: Compositional Inference with Tree Approximate Message Passing

被引:0
|
作者
Baker, Antoine [1 ]
Krzakala, Florent [1 ]
Aubin, Benjamin [2 ]
Zdeborova, Lenka [2 ]
机构
[1] PSL Univ, Ecole Normale Super, Lab Phys, CNRS, Paris, France
[2] Univ Paris Saclay, Inst Phys Theor, CNRS, CEA, Saclay, France
基金
欧洲研究理事会;
关键词
probabilistic programming; graphical models; Bethe entropy; state evolution; expectation propagation; BELIEF PROPAGATION; FREE-ENERGY; GRAPHS;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We introduce Tree-AMP, standing for Tree Approximate Message Passing, a python package for compositional inference in high-dimensional tree-structured models. The package provides a unifying framework to study several approximate message passing algorithms previously derived for a variety of machine learning tasks such as generalized linear models, inference in multi-layer networks, matrix factorization, and reconstruction using non separable penalties. For some models, the asymptotic performance of the algorithm can be theoretically predicted by the state evolution, and the measurements entropy estimated by the free entropy formalism. The implementation is modular by design: each module, which implements a factor, can be composed at will with other modules to solve complex inference tasks. The user only needs to declare the factor graph of the model: the inference algorithm, state evolution and entropy estimation are fully automated. The source code is publicly available at https://github.com/sphinxteam/tramp and the documentation at
引用
收藏
页数:89
相关论文
共 50 条
  • [1] Approximate message-passing inference algorithm
    Jung, Kyomin
    Shah, Devavrat
    [J]. 2007 IEEE INFORMATION THEORY WORKSHOP, VOLS 1 AND 2, 2007, : 224 - +
  • [2] Compressive Imaging using Approximate Message Passing and a Markov-Tree Prior
    Som, Subhojit
    Potter, Lee C.
    Schniter, Philip
    [J]. 2010 CONFERENCE RECORD OF THE FORTY FOURTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS (ASILOMAR), 2010, : 243 - 247
  • [3] Compressive Imaging Using Approximate Message Passing and a Markov-Tree Prior
    Som, Subhojit
    Schniter, Philip
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (07) : 3439 - 3448
  • [4] Decentralized Generalized Approximate Message-Passing for Tree-Structured Networks
    Takeuchi, Keigo
    [J]. IEEE Transactions on Information Theory, 2024, 70 (10): : 7385 - 7409
  • [5] Tree search on an atomic model for message passing
    Liu, PF
    Aiello, W
    Bhatt, S
    [J]. SIAM JOURNAL ON COMPUTING, 2001, 31 (01) : 67 - 85
  • [6] Sparse or Dense - Message Passing (MP) or Approximate Message Passing (AMP) for Compressed Sensing Signal Recovery
    Mahmood, Asad
    Kang, Jaewook, Jr.
    Lee, HeungNo
    [J]. 2013 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING (PACRIM), 2013, : 259 - 264
  • [7] Extended Variational Message Passing for Automated Approximate Bayesian Inference
    Akbayrak, Semih
    Bocharov, Ivan
    de Vries, Bert
    [J]. ENTROPY, 2021, 23 (07)
  • [8] Analysis of random sequential message passing algorithms for approximate inference
    Cakmak, Burak
    Lu, Yue M.
    Opper, Manfred
    [J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2022, 2022 (07):
  • [9] Reliability analysis of tree, D-tree, X-tree and DX-tree message passing architectures
    Abachi, H
    Abdollahian, M
    Reid, M
    Walker, AJ
    [J]. INTERNATIONAL SOCIETY FOR COMPUTERS AND THEIR APPLICATIONS 13TH INTERNATIONAL CONFERENCE ON COMPUTERS AND THEIR APPLICATIONS, 1998, : 389 - 392
  • [10] S-AMP: Approximate Message Passing for General Matrix Ensembles
    Cakmak, Burak
    Winther, Ole
    Fleury, Bernard H.
    [J]. 2014 IEEE INFORMATION THEORY WORKSHOP (ITW), 2014, : 192 - 196