Investigation of connection between deep learning and probabilistic graphical models

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018. === This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. === Cataloged from student-s...

Full description

Bibliographic Details
Main Author: Hager, Paul Andrew
Other Authors: Devavrat Shah.
Format: Others
Language:English
Published: Massachusetts Institute of Technology 2018
Subjects:
Online Access:http://hdl.handle.net/1721.1/119552
id ndltd-MIT-oai-dspace.mit.edu-1721.1-119552
record_format oai_dc
spelling ndltd-MIT-oai-dspace.mit.edu-1721.1-1195522019-05-02T16:35:54Z Investigation of connection between deep learning and probabilistic graphical models Hager, Paul Andrew Devavrat Shah. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018. This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. Cataloged from student-submitted PDF version of thesis. Includes bibliographical references (page 21). The field of machine learning (ML) has benefitted greatly from its relationship with the field of classical statistics. In support of that continued expansion, the following proposes an alternative perspective at the link between these fields. The link focuses on probabilistic graphical models in the context of reinforcement learning. Viewing certain algorithms as reinforcement learning gives one an ability to map ML concepts to statistics problems. Training a multi-layer nonlinear perceptron algorithm is equivalent to structure learning problems in probabilistic graphical models (PGMs). The technique of boosting weak rules into an ensemble is weighted sampling. Finally regularizing neural networks using the dropout technique is conditioning on certain observations in PGMs. by Paul Andrew Hager. M. Eng. 2018-12-11T20:39:49Z 2018-12-11T20:39:49Z 2018 2018 Thesis http://hdl.handle.net/1721.1/119552 1076273432 eng MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission. http://dspace.mit.edu/handle/1721.1/7582 21 pages application/pdf Massachusetts Institute of Technology
collection NDLTD
language English
format Others
sources NDLTD
topic Electrical Engineering and Computer Science.
spellingShingle Electrical Engineering and Computer Science.
Hager, Paul Andrew
Investigation of connection between deep learning and probabilistic graphical models
description Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018. === This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. === Cataloged from student-submitted PDF version of thesis. === Includes bibliographical references (page 21). === The field of machine learning (ML) has benefitted greatly from its relationship with the field of classical statistics. In support of that continued expansion, the following proposes an alternative perspective at the link between these fields. The link focuses on probabilistic graphical models in the context of reinforcement learning. Viewing certain algorithms as reinforcement learning gives one an ability to map ML concepts to statistics problems. Training a multi-layer nonlinear perceptron algorithm is equivalent to structure learning problems in probabilistic graphical models (PGMs). The technique of boosting weak rules into an ensemble is weighted sampling. Finally regularizing neural networks using the dropout technique is conditioning on certain observations in PGMs. === by Paul Andrew Hager. === M. Eng.
author2 Devavrat Shah.
author_facet Devavrat Shah.
Hager, Paul Andrew
author Hager, Paul Andrew
author_sort Hager, Paul Andrew
title Investigation of connection between deep learning and probabilistic graphical models
title_short Investigation of connection between deep learning and probabilistic graphical models
title_full Investigation of connection between deep learning and probabilistic graphical models
title_fullStr Investigation of connection between deep learning and probabilistic graphical models
title_full_unstemmed Investigation of connection between deep learning and probabilistic graphical models
title_sort investigation of connection between deep learning and probabilistic graphical models
publisher Massachusetts Institute of Technology
publishDate 2018
url http://hdl.handle.net/1721.1/119552
work_keys_str_mv AT hagerpaulandrew investigationofconnectionbetweendeeplearningandprobabilisticgraphicalmodels
_version_ 1719043309239795712