dc.contributor.advisor | Leslie Pack Kaelbling. | en_US |
dc.contributor.author | Jeewajee, Adarsh Keshav S. | en_US |
dc.contributor.other | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. | en_US |
dc.date.accessioned | 2021-01-06T18:32:05Z | |
dc.date.available | 2021-01-06T18:32:05Z | |
dc.date.copyright | 2020 | en_US |
dc.date.issued | 2020 | en_US |
dc.identifier.uri | https://hdl.handle.net/1721.1/129161 | |
dc.description | Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, September, 2020 | en_US |
dc.description | Cataloged from student-submitted PDF of thesis. | en_US |
dc.description | Includes bibliographical references (pages 50-55). | en_US |
dc.description.abstract | Undirected graphical models are compact representations of joint probability distributions over random variables. To carry out an inference task of interest, graphical models of arbitrary topology can be trained using empirical risk minimization. However, when faced with new tasks, these models (EGMs) often need to be re-trained. Instead, we propose an inference-agnostic adversarial training framework for producing an ensemble of graphical models (AGMs). The ensemble is optimized to generate data, and inference is learned as a by-product of this endeavor. AGMs perform comparably with EGMs on inference tasks that the latter were specifically optimized for. Most importantly, AGMs show significantly better generalization capabilities across inference tasks. AGMs are also on par with GibbsNet, a state-of-the-art deep neural architecture, which like AGMs, allows conditioning on any subset of random variables. Finally, AGMs allow fast data sampling, competitive with Gibbs sampling from EGMs. | en_US |
dc.description.statementofresponsibility | by Adarsh Keshav S. Jeewajee. | en_US |
dc.format.extent | 55 pages | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Massachusetts Institute of Technology | en_US |
dc.rights | 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. | en_US |
dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | en_US |
dc.subject | Electrical Engineering and Computer Science. | en_US |
dc.title | Adversarially-learned inference via an ensemble of discrete undirected graphical models | en_US |
dc.type | Thesis | en_US |
dc.description.degree | M. Eng. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.identifier.oclc | 1227275913 | en_US |
dc.description.collection | M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science | en_US |
dspace.imported | 2021-01-06T18:32:04Z | en_US |
mit.thesis.degree | Master | en_US |
mit.thesis.department | EECS | en_US |