TRAMP: Compositional Inference with TRee Approximate Message Passing

04/03/2020
by   Antoine Baker, et al.
19

We introduce tramp, standing for TRee Approximate Message Passing, a python package for compositional inference in high-dimensional tree-structured models. The package provides an 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.

READ FULL TEXT
research
05/20/2020

The Inverse G-Wishart Distribution and Variational Message Passing

Message passing on a factor graph is a powerful paradigm for the coding ...
research
07/31/2022

Unitary Approximate Message Passing for Matrix Factorization

We consider matrix factorization (MF) with certain constraints, which fi...
research
09/24/2021

Graph-based Approximate Message Passing Iterations

Approximate-message passing (AMP) algorithms have become an important el...
research
01/24/2017

Multi-Layer Generalized Linear Estimation

We consider the problem of reconstructing a signal from multi-layered (p...
research
06/27/2023

Approximate Message Passing for the Matrix Tensor Product Model

We propose and analyze an approximate message passing (AMP) algorithm fo...
research
05/15/2018

On the glassy nature of the hard phase in inference problems

An algorithmically hard phase was described in a range of inference prob...
research
12/21/2018

Marvels and Pitfalls of the Langevin Algorithm in Noisy High-dimensional Inference

Gradient-descent-based algorithms and their stochastic versions have wid...

Please sign up or login with your details

Forgot password? Click here to reset