Improved and Partially-Tight Lower Bounds for Message-Passing Implementations of Multiplicity Queues.
Anh TranEdward TalmagePublished in: CoRR (2023)
Keyphrases
- message passing
- lower bound
- upper bound
- belief propagation
- matrix multiplication
- distributed systems
- branch and bound algorithm
- shared memory
- probabilistic inference
- approximate inference
- inference in graphical models
- branch and bound
- factor graphs
- graphical models
- worst case
- objective function
- sum product algorithm
- markov random field
- np hard
- lower and upper bounds
- distributed shared memory
- ldpc codes
- optimal solution
- loopy belief propagation
- reinforcement learning
- linear programming
- probabilistic reasoning
- sum product
- computer vision