Building blocks for the mind

Successful man-machine interaction requires justification and transparency for the behavior of the machine. Artificial agents now perform a variety of high risk jobs alongside humans: the need for justification is apparent when we consider the millions of dollars that can be lost by robotic traders in the stock market over misreading online news [9] or the hundreds of lives that could be saved if the behavior of plane autopilots was better understood [1]. Current state of the art approaches to man-machine interaction within a dialog, which use sentiment analysis, recommender systems, or information retrieval algorithms, fail to provide a rationale for their predictions or their internal behavior. In this thesis, I claim that making the machine selective in the elements considered in its final computation, by enforcing sparsity at the Machine Learning stage, reveals the machine's behavior and provides justification to the user. My second claim is that selectivity in the machine's inputs acts as Occam's Razor: rather than hindering performance, enforcing sparsity allows the trained Machine Learning model to better generalize to unseen data. I support my first claim concerning transparency and justification through two separate experiments that are each fundamental to Man-Machine interaction: - Recommender System: Interactive plan resolution using Uhura and user profiles represented by ontologies, - Sentiment Analysis: Text climax as support for predictions. In the first experiment, I find that the trained system's recommendations agree better with human decisions than existing several baselines which rely on state of the art topic modelling methods that do not enforce sparsity in the input data. In the second experiment, I obtain a new state of the art result on Sentiment Analysis and show that the trained system can now provide justification by pinpointing climactic moments in the original text that influence the sentiment of the text, unlike competing approaches. My second claim about sparsity's regularization benefits is supported with another set of experiments, where I demonstrate significant improvement over non-sparse baselines in 3 challenging Machine Learning tasks.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Aeronautics and Astronautics.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2017

Author dc:creator

• Raiman, Jonathan (Jonathan Raphael)

Advisor dc:contributor.advisor

• Brian C. Williams.

• Aeronautics and Astronautics.

Statement dc:rights

• 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.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/112425

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/112425