Pith. sign in

REVIEW

Tree-AMP: Compositional Inference with Tree Approximate Message Passing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2004.01571 v3 pith:EVVAP57U submitted 2020-04-03 stat.ML cond-mat.dis-nncs.LGeess.SPmath.STstat.COstat.TH

classification stat.MLcond-mat.dis-nncs.LGeess.SPmath.STstat.COstat.TH
keywords inferenceapproximateentropymessagemodelspassingalgorithmcompositional
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Pith tools