paper-with-me

홈 › Papers

Tree-AMP: Compositional Inference with Tree Approximate Message Passing

2020-04-03 · Antoine Baker, Benjamin Aubin, Florent Krzakala, Lenka Zdeborová

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.

📄 PDF Abstract BibTeX arXiv:2004.01571

Code (1)

sphinxteam/tramp 공식 구현

Similar Papers 제목 키워드 기반

Tensor Belief Propagation

2017-08-01 · ICML 2017 8 · Andrew Wrigley, Wee Sun Lee, Nan Ye

We propose a new approximate inference algorithm for graphical models, tensor belief propagation, based on approximating the messages passed in the junction tree algorithm. Our algorithm represents the potential fun…

Exact and approximate inference in graphical models: variable elimination and beyond

2015-06-29 · Nathalie Peyrard, Marie-Josée Cros, Simon de Givry, Alain Franc 외

Probabilistic graphical models offer a powerful framework to account for the dependence structure between variables, which is represented as a graph. However, the dependence between variables may render inference tasks i…

Categorical Belief Propagation: Sheaf-Theoretic Inference via Descent and Holonomy

2026-01-08 · Enrique ter Horst, Sridhar Mahadevan, Juan Diego Zambrano arxiv

We develop a categorical foundation for belief propagation on factor graphs. We construct the free hypergraph category \(\Syn_Σ\) on a typed signature and prove its universal property, yielding compositional semantics vi…

Characterizing Intrinsic Compositionality in Transformers with Tree Projections

2022-11-02 · Shikhar Murty, Pratyusha Sharma, Jacob Andreas, Christopher D. Manning

When trained on language data, do transformers learn some arbitrary computation that utilizes the full capacity of the architecture or do they learn a simpler, tree-like computation, hypothesized to underlie compositiona…

Sentence

MAP Inference in Chains using Column Generation

2012-12-01 · NeurIPS 2012 12 · David Belanger, Alexandre Passos, Sebastian Riedel, Andrew McCallum

Linear chains and trees are basic building blocks in many applications of graphical models. Although exact inference in these models can be performed by dynamic programming, this computation can still be prohibitively e…

named-entity-recognitionNamed Entity RecognitionNamed Entity Recognition (NER)Part-Of-Speech Tagging