REVIEW 2 cited by
PGMax: Factor Graphs for Discrete Probabilistic Graphical Models and Loopy Belief Propagation in JAX
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
Signed reviews
read the original abstract
PGMax is an open-source Python package for (a) easily specifying discrete Probabilistic Graphical Models (PGMs) as factor graphs; and (b) automatically running efficient and scalable loopy belief propagation (LBP) in JAX. PGMax supports general factor graphs with tractable factors, and leverages modern accelerators like GPUs for inference. Compared with existing alternatives, PGMax obtains higher-quality inference results with up to three orders-of-magnitude inference time speedups. PGMax additionally interacts seamlessly with the rapidly growing JAX ecosystem, opening up new research possibilities. Our source code, examples and documentation are available at https://github.com/deepmind/PGMax.
Forward citations
Cited by 2 Pith papers
-
Nonlocal Monte Carlo via Reinforcement Learning
A reinforcement-learning-trained policy for selecting nonlocal cluster moves improves a Monte Carlo solver for hard 4-SAT benchmarks over simulated annealing.
-
OpenForge: Probabilistic Metadata Integration
OpenForge combines LLM-generated prior beliefs with Markov Random Field inference to resolve equivalence and parent-child relationships among metadata concepts.
Discussion (0). Continue with ORCID to comment.