posterior / treecatLinks
A Bayesian latent tree model of high-dimensional heterogeneous data
☆23Updated 8 years ago
Alternatives and similar repositories for treecat
Users that are interested in treecat are comparing it to the libraries listed below
Sorting:
- Automatic Reparameterisation of Probabilistic Programs☆36Updated 5 years ago
- Implementation of various algorithms in the Nested Sequential Monte Carlo family of methods.☆14Updated 10 years ago
- Deep Probabilistic Programming Language☆19Updated last year
- Library of composable generative population models which serve as the modeling and inference backend of BayesDB.☆25Updated last year
- ☆12Updated 7 months ago
- Implementation of an algorithm for Markov chain Monte Carlo with data subsampling☆32Updated 9 years ago
- ☆35Updated 5 years ago
- Modular Probabilistic Programming on MXNet☆104Updated 2 years ago
- Dependent multinomials made easy: stick-breaking with the Pólya-gamma augmentation☆61Updated 5 years ago
- Recognizing and exploiting conjugacy without a domain-specific language☆36Updated 6 years ago
- Implementation of Mapper algorithm for Topological Data Analysis☆46Updated 5 years ago
- Repository of models in Pyro☆30Updated last year
- An implementation of the SuperLearner algorithm in Python based on scikit-learn.☆25Updated 11 years ago
- Software for learning sparse Bayesian networks☆42Updated 5 years ago
- ☆28Updated 9 years ago
- Structure learning for sparse graphs with latent variables☆45Updated 9 years ago
- ☆42Updated 8 years ago
- Modeling agents with probabilistic programs☆67Updated 6 years ago
- A Stan-like probabilistic programming language.☆68Updated 5 years ago
- Probabilistic Programming eXecution protocol (PPX)☆76Updated 3 years ago
- ☆19Updated 9 years ago
- Bayesian Regression Models in Pyro☆74Updated last year
- Optimally-weighted herding is Bayesian Quadrature☆16Updated 9 years ago
- A compiler for Bayesian time series models.☆24Updated last year
- Generic API for dispatch to Pyro backends.☆16Updated 3 years ago
- Bayesian multi-tensor factorization methods, with side information☆29Updated 5 years ago
- Low-level primitives for collapsed Gibbs sampling in python and C++☆16Updated last year
- Posterior Server☆15Updated 9 years ago
- Rewriting the Stan compiler in OCaml☆23Updated 4 years ago
- The Mondrian kernel is a random feature approximation to the Laplace kernel allowing fast kernel width selection.☆12Updated 9 years ago