Yale Combinatorics and Probability Seminar - Sekhar Tatikonds, Yale

Yale Combinatorics and Probability Seminar
Speaker: Sekhar Tatikonda (Yale)

Title: Learning Sparse Gaussian Graphical Models

Abstract:   We provide an algorithm and analysis for learning the
topology of sparse Gaussian Markov random fields.  The notion of
sparsity we consider is that of k-separability. 

For more info: https://sites.google.com/a/yale.edu/combprob/home