bnpy-dev /

Filename Size Date modified Message
bnpy
datasets
demos
docs
profiler
tests
third-party
985 B
ENH New module EntropyUtilX has cython eXtension code for fast, const-memory computation of entropy
1.8 KB
ADD notes section to LICENSE
906 B
ENH New module EntropyUtilX has cython eXtension code for fast, const-memory computation of entropy
8.1 KB
README.md edited online with Bitbucket

bnpy : Bayesian nonparametric machine learning for python.

bnpy-headline.png

About

This python module provides code for training popular clustering models on large datasets. We focus on Bayesian nonparametric models based on the Dirichlet process, but also provide parametric counterparts.

bnpy supports the latest online learning algorithms as well as standard offline methods. Our aim is to provide an inference platform that makes it easy for researchers and practitioners to compare models and algorithms.

Supported probabilistic models (aka allocation models)

  • Mixture models

    • FiniteMixtureModel : fixed number of clusters
    • DPMixtureModel : infinite number of clusters, via the Dirichlet process
  • Topic models (aka admixtures models)

    • FiniteTopicModel : fixed number of topics. This is Latent Dirichlet allocation.
    • HDPTopicModel : infinite number of topics, via the hierarchical Dirichlet process
  • Hidden Markov models (HMMs)

    • FiniteHMM : Markov sequence model with a fixture number of states
    • HDPHMM : Markov sequence models with an infinite number of states
  • COMING SOON

    • grammar models
    • relational models

Supported data observation models (aka likelihoods)

  • Multinomial for bag-of-words data
    • Mult
  • Gaussian for real-valued vector data
    • Gauss : Full-covariance
    • DiagGauss : Diagonal-covariance
    • ZeroMeanGauss : Zero-mean, full-covariance
  • Auto-regressive Gaussian
    • AutoRegGauss

Supported learning algorithms:

  • Expectation-maximization (offline)
    • EM
  • Full-dataset variational Bayes (offline)
    • VB
  • Memoized variational (online)
    • moVB
  • Stochastic variational (online)
    • soVB

These are all variants of variational inference, a family of optimization algorithms. We plan to eventually support sampling methods (Markov chain Monte Carlo) too.

Demos

You can find many examples of bnpy in action in our curated set of IPython notebooks.

These same demos are also directly available on our wiki.

Quick Start

You can use bnpy from the terminal, or from within Python. Both options require specifying a dataset, an allocation model, an observation model (likelihood), and an algorithm. Optional keyword arguments with reasonable defaults allow control of specific model hyperparameters, algorithm parameters, etc.

Below, we show how to call bnpy to train a 8 component Gaussian mixture model on the default AsteriskK8 toy dataset (shown below). In both cases, log information is printed to stdout, and all learned model parameters are saved to disk.

Calling from the terminal/command-line

$ python -m bnpy.Run AsteriskK8 FiniteMixtureModel Gauss EM --K 8

Calling directly from Python

import bnpy
bnpy.run('AsteriskK8', 'FiniteMixtureModel', 'Gauss', 'EM', K=8)

Other examples

Train Dirichlet-process Gaussian mixture model (DP-GMM) via full-dataset variational algorithm (aka "VB" for variational Bayes).

python -m bnpy.Run AsteriskK8 DPMixtureModel Gauss VB --K 8

Train DP-GMM via memoized variational, with birth and merge moves, with data divided into 10 batches.

python -m bnpy.Run AsteriskK8 DPMixtureModel Gauss moVB --K 8 --nBatch 10 --moves birth,merge

Quick help

# print help message for required arguments
python -m bnpy.Run --help 

# print help message for specific keyword options for Gaussian mixture models
python -m bnpy.Run AsteriskK8 FiniteMixtureModel Gauss EM --kwhelp

Installation and Configuration

To use bnpy for the first time, follow the installation instructions on our project wiki.

Once installed, please visit the Configuration wiki page to learn how to configure where data is saved and loaded from on disk.

All documentation can be found on the project wiki.

Team

Primary contact

Mike Hughes
PhD candidate
Brown University, Dept. of Computer Science
Website: www.michaelchughes.com

Faculty adviser

Erik Sudderth
Assistant Professor
Brown University, Dept. of Computer Science
Website: http://cs.brown.edu/people/sudderth/

Contributors

  • Soumya Ghosh
  • Dae Il Kim
  • Geng Ji
  • William Stephenson
  • Sonia Phene
  • Mert Terzihan
  • Mengrui Ni
  • Jincheng Li

Academic References

Conference publications based on BNPy

NIPS 2015 HDP-HMM paper

Our NIPS 2015 paper describes inference algorithms that can add or remove clusters for the sticky HDP-HMM.

AISTATS 2015 HDP topic model paper

Our AISTATS 2015 paper describes our algorithms for HDP topic models.

  • "Reliable and scalable variational inference for the hierarchical Dirichlet process." Michael C. Hughes, Dae Il Kim, and Erik B. Sudderth. AISTATS 2015. [paper] [supplement] [bibtex]

NIPS 2013 DP mixtures paper

Our NIPS 2013 paper introduced memoized variational inference algorithm, and applied it to Dirichlet process mixture models.

  • "Memoized online variational inference for Dirichlet process mixture models." Michael C. Hughes and Erik B. Sudderth. NIPS 2013. [paper] [supplement] [bibtex]

Workshop papers

Our short paper from a workshop at NIPS 2014 describes the vision for bnpy as a general purpose inference engine.

  • "bnpy: Reliable and scalable variational inference for Bayesian nonparametric models." Michael C. Hughes and Erik B. Sudderth. Probabilistic Programming Workshop at NIPS 2014. [paper]

Background reading

For background reading to understand the broader context of this field, see our Resources wiki page.

Target Audience

Primarly, we intend bnpy to be a platform for researchers. By gathering many learning algorithms and popular models in one convenient, modular repository, we hope to make it easier to compare and contrast approaches. We also how that the modular organization of bnpy enables researchers to try out new modeling ideas without reinventing the wheel.