Giter Club home page Giter Club logo

gaussian-toolbox's People

Contributors

christiando avatar shimazaki avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar

Forkers

lorenzo-cavazzi

gaussian-toolbox's Issues

Structuring approximate conditionals

So far just some moment matching (MM) classes are defined as approximate conditionals. However, there are other ways to define approximate affine operations, e.g. by

  • Variational inference (VI)
  • Laplace approximation (LA)
  • Unscented transform (UT)

One should write a base class for each type of approximation and then implement some examples. It is expected that VI, LA, and UT can be more general than MM methods.

Make Gaussian Diagonal computation sparse

At the moment Gaussian (PDF&Measure) diagonals are still full matrices (matrix inversion done differently), which is computationally and memory-wise is not very efficient.

Define "Sequential" for conditionals

Like layers in deep nets, conditionals can be defined as a chain of many conditionals. While this does not make sense for linear Gaussian conditionals (since multiple linear conditionals can be written as one conditional), for non-linear ones, it does. Affine transformations can be implemented as forward (or backward) iterations over the conditional "layers". Integration over the log conditionals is also straightforward since it is just the sum of the integrals of layers of log conditionals.

Gaussian Mixtures

Many operations like for Gaussian mixtures can be implemented by looping over Gaussian operations, especially the affine transformations. However, there are also some problems, e.g. how to implement integration over the log density of mixtures. There are two possibilities:

  • Allow mixtures only in restricted mode. Straightforward to implement, but less valuable, since parameter learning in general will rely on terms that require integration of log-densities
  • Come up with the implementation of log-density integration, to enable full usage of mixtures in the context of the toolbox.

Quality assessment of approximate affine transformations

While GT allows the implementation of all kinds of approximations for complicated log conditionals, it would be nice to have standardized quality assessments for how well different operations are approximated. To this end, one could design a certain test bench, which summarizes the quality of these operations (affine transformations, log integrations). However, metrics and test cases need to be defined.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.