Learning directed graphical models with latent variables
Name
1193029183-MIT.pdf
Size
2.02 MB
Format
Adobe PDF
Checksum (MD5)
853b0701b38c2f216cb16bc71d731d48
Author(s)
Saeed, Basil(Basil N.)
Advisor(s)
Caroline Uhler.
Date Issued
2020
Publisher
Massachusetts Institute of Technology
Abstract
We consider the problem of learning directed graphical models with latent variables, represented by directed maximal ancestral graphs, from a conditional independence oracle. We show that given a set of separation statements from some directed maximal ancestral graph G* = (V*,E*), we can map posets with ground set V* to minimal IMAPs of G* such that the sparsest of these minimal IMAPs is Markov equivalent to G*. We give a diagrammatic interpretation of these minimal IMAPs in terms of the Hasse diagram of the poset of posets. Namely, the Hasse diagram of these minimal IMAPs corresponds to the Hasse diagram of the poset of posets after identifying posets that map to the same minimal IMAP. We show that moving between these minimal IMAPs using legitimate mark changes corresponds to covering relations in the poset obtained after identification. Finally, we conjecture that a greedy search to minimize sparsity over this contracted space by moving between minimal IMAPs using legitimate mark changes converges to G*.
Description
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, May, 2020
Cataloged from the official PDF of thesis.
Includes bibliographical references (pages 55-56).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.
Persistent DSpace Link
