You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently, I am fairly convinced that the main thing keeping Turing from reaching Stan speeds on https://github.com/TuringLang/TuringExamples/tree/master/benchmarks/hmm_semisup is a multivariate categorical distribution that takes a matrix of probabilities in. Even with ReverseDiff, caching the tape and some broadcasting and vectorization tricks, we are still significantly slower than Stan because of this issue. This issue shouldn't be too hard for anyone willing to start contributing to DistributionsAD.
The text was updated successfully, but these errors were encountered:
Currently, I am fairly convinced that the main thing keeping Turing from reaching Stan speeds on https://github.com/TuringLang/TuringExamples/tree/master/benchmarks/hmm_semisup is a multivariate categorical distribution that takes a matrix of probabilities in. Even with ReverseDiff, caching the tape and some broadcasting and vectorization tricks, we are still significantly slower than Stan because of this issue. This issue shouldn't be too hard for anyone willing to start contributing to DistributionsAD.
The text was updated successfully, but these errors were encountered: