Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp01hm50tv16g
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorBuschman, Timothy-
dc.contributor.authorWawrzonek, Christian-
dc.date.accessioned2016-06-30T15:25:36Z-
dc.date.available2016-06-30T15:25:36Z-
dc.date.created2016-04-29-
dc.date.issued2016-06-30-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp01hm50tv16g-
dc.description.abstractHow do populations of neurons encode information over very short time scales? Given extensive training, neurons are able to change the weighted connections between them in order to encode information. However, very short timescales of only a few seconds are far too short to change neural weights. Still, humans and higher functioning animals pos- sess the ability to encode and maintain small amounts of information presented over very short timescales. This is the problem of working memory, the transient holding, processing, and manipulation of information used in higher cognitive functioning. Previous computa- tional models of working memory have typically been constructed with a strict, hand-tuned architecture. Here, we attempted to train a relatively simple, unconstrained neural network on complex working memory tasks and analyzed the natural solution space found by the network. Through a range of analyses, it is clear that even a simple, single layer recurrent network is capable of dynamic, generalized solutions without deliberate solution paths presented [8].en_US
dc.format.extent41 pages*
dc.language.isoen_USen_US
dc.titleDynamics of Recurrent Neural Network Models of Working Memoryen_US
dc.typePrinceton University Senior Theses-
pu.date.classyear2016en_US
pu.departmentComputer Scienceen_US
pu.pdf.coverpageSeniorThesisCoverPage-
Appears in Collections:Computer Science, 1988-2020

Files in This Item:
File SizeFormat 
Wawrzpmek_Christian_2016_Thesis.pdf3.1 MBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.