DSL for Generative M… on DSL for Generative Models… Measurable Spaces… on Measurable Spaces – Prob… Measurable Spaces… on Measurable Spaces – Prob… Measurable Spaces… on Measurable Spaces – Prob… Ballot Theorem… on Ballot Theorem – 2 …
Tag Archives: Haskell
> import Data.Ord (comparing) This is completely random but I thought it was a neat use of laziness. You are familiar with lexicographical ordering? Haskell’s compare of lists implements this. ghci> [1,2] < [1,3] True ghci> [1,3,4] < [1,3,4,5] True … Continue reading
I’ve now cleaned up (in befb0f3cca0c212e368497e86f030aa96355be18) the Reader and Writer interfaces and added it to Statistics.GModeling.Gibbs. I’ve removed references to Support and simply parameterized using a key type k and value type v. > data Reader k v = Reader … Continue reading
I am putting together what I have so far in a repository here. So far, (133e22dc979d988706aafe52a346cee004f70ca5) it contains Statistics.GModeling.DSL Statistics.GModeling.Models.HMM Statistics.GModeling.Models.LDA Statistics.GModeling.Models.FixedTreeLDA Will continue building the pieces in upcoming posts.
The next step is for the library to have access to the latent variable data. I also don’t want the library to decide how to store the data because the user will have a much better idea of what is … Continue reading
In this post, I write some functions to interpret the DSL. Specifically, I present some functions to figure out the children and parents of a node and discover what the prior, observed, and latent variables are. > import Control.Monad (msum) … Continue reading
In the previous post I attempted to introduce a DSL for probabilistic models inspired by the plate notation. Let’s try to see if we can define LDA with it. > data LDALabels = Alpha | Beta | Topics | Topic … Continue reading