[Combprob] talk this Thursday by Sekhar Tatikonda: "Learning Sparse Gaussian Graphical Models"
Daniel Spielman
spielman at cs.yale.edu
Tue Apr 21 10:52:56 EDT 2015
When: Thursday, Apr 23, 4:00PM
Where: LOM 215
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://urldefense.proofpoint.com/v2/url?u=https-3A__sites.google.com_a_yale.edu_combprob_home&d=AwIBaQ&c=-dg2m7zWuuDZ0MUcV7Sdqw&r=LF0MQT9lkPQlp3gHlW9D2fTc0d4apDhCuC758tavUvQ&m=vMPn8pLA-D9vN3LfAhlL5YEg91oNpf5wAuYL-ddm_zY&s=wIciEUf6Y7MenzK5lH8tVVivj5oG2Om7QC8Q-so3WyU&e=
--Dan
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.yale.edu/pipermail/combprob/attachments/20150421/f158b9b4/attachment.html
More information about the Combprob
mailing list