Comp efficiency - loopy belief propagation speed comparison for marginals? #1437
-
|
Hey all, Wondering if you've done a loopy belief propagation speed comparison for marginals between pgmpy and:
Right now using py-factorgraph, do you have a more efficient implementation? @ankurankan would love your thoughts thx! |
Beta Was this translation helpful? Give feedback.
Answered by
ankurankan
Jul 6, 2021
Replies: 1 comment
-
|
@mercicle I think pomegranate might be the computationally fastest option as it has cython implementation. pgmpy focuses more on extensibility at the cost of being computationally more expensive. |
Beta Was this translation helpful? Give feedback.
0 replies
Answer selected by
ankurankan
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
@mercicle I think pomegranate might be the computationally fastest option as it has cython implementation. pgmpy focuses more on extensibility at the cost of being computationally more expensive.