Improved and Partially-Tight Lower Bounds for Message-Passing Implementations of Multiplicity Queues.
Anh TranEdward TalmagePublished in: DISC (2023)
Keyphrases
- message passing
- lower bound
- upper bound
- belief propagation
- distributed systems
- matrix multiplication
- probabilistic inference
- branch and bound algorithm
- branch and bound
- shared memory
- distributed shared memory
- factor graphs
- worst case
- lower and upper bounds
- inference in graphical models
- sum product algorithm
- graphical models
- markov random field
- np hard
- objective function
- approximate inference
- sum product
- lagrangian relaxation
- junction tree
- belief networks
- image registration
- ldpc codes
- optimal solution