AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

PGMax: Factor Graphs for Discrete Probabilistic Graphical Models and Loopy Belief Propagation in JAX

Guangyao Zhou, Antoine Dedieu, Nishanth Kumar, Wolfgang Lehrach, Shrinu Kushagra, Dileep George, Miguel Lázaro-Gredilla

JMLR 2024 · Graph learning › Graph algorithms and clustering · approach: Continuous DAG structure learning · 10 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
run PGMax LBP on GPU instead of CPUPGMax · RBM MAP inference (200 units)inference time (s): 2.31s -> 0.84sImproved
use PGMax instead of pomegranate LBPMAP inference on RBMs · RBM MAP inference (200 units)inference time (s): 941.87s -> 2.31sImproved
use PGMax instead of pomegranate LBPMAP inference on RBMs · RBM MAP inference (30 units, 20 random RBMs)RBMs where ground-truth MAP recovered (of 20): 2/20 -> 17/20Improved
use PGMax instead of pgmpy MPLPMAP inference on RBMs · RBM MAP inference (200 units)inference time (s): 377.97s -> 2.31sImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy