An exploration of strategies for discrete learning

My research investigates the question of compositionality posed as an engineering question: How do we take two or more machines to build a compound machine, such that the compound machine has the combined abilities of its constituent parts, plus the abilities that arise from the cooperation between its parts? In order to illuminate this problem I have proposed a multi-level crossbar with bidirectional discrete wires as a substrate that allows for biologically plausible computation and communication, and candidate algorithms for a learning protocol between two connected agents. The protocol works locally, and enables the agents to learn a dataset of objects, while bootstrapping their own communication mechanism for transmitting information to each other. The system of the two agents, along with the local learning protocol, is equivalent to a discrete autoencoder working on unsupervised small data, with the goal of compression. It can be further generalized as a Programmable Logic Array analogous structure with uncertainty, i.e. incorporating "don't know" values to the existing true and false values, for which we can ask what possible functions can be learned locally. As a consequence of this work, I have learned what approaches don't work, and what approaches could be in the right direction, when it comes to doing discrete learning. I have documented my approaches, in terms of how successful they were, what were the main issues, what didn't work, what did, and what useful ideas can be extended on. I have also learned what is possible to be done by using only few discrete values.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2017

Author dc:creator

• Muco, Manushaqe

Advisor dc:contributor.advisor

• Gerald Jay Sussman.

• Electrical Engineering and Computer Science.

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/119536

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/119536