https://github.com/biaslab/schedulefree-mp
Schedule-free variational message passing on factor graphs
https://github.com/biaslab/schedulefree-mp
bayesian-inference efficient factor-graphs variational-message-passing
Last synced: 2 months ago
JSON representation
Schedule-free variational message passing on factor graphs
- Host: GitHub
- URL: https://github.com/biaslab/schedulefree-mp
- Owner: biaslab
- License: mit
- Created: 2019-05-15T08:05:19.000Z (about 6 years ago)
- Default Branch: master
- Last Pushed: 2020-03-29T21:02:13.000Z (about 5 years ago)
- Last Synced: 2025-03-26T18:42:31.892Z (3 months ago)
- Topics: bayesian-inference, efficient, factor-graphs, variational-message-passing
- Language: Julia
- Homepage:
- Size: 6.55 MB
- Stars: 1
- Watchers: 2
- Forks: 2
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Schedule-free variational message-passing
Message passing in factor graphs should be free of an explicit message scheduler. The scheduler is the bottleneck in computational cost, because it has to parse the graph in its entirety. By passing messages based on a local, distributed criterion, the scheduler can be circumvented. Schedule-free MP scales better to to larger graphs.
### Comments
Feedback can be submitted to the [issues tracker](https://github.com/wmkouw/schedulefreeMP/issues).