{"title":"Analyzing composability in a sparse encoding model of memorization and association","authors":"J. Beal, T. F. Knight","doi":"10.1109/DEVLRN.2008.4640826","DOIUrl":null,"url":null,"abstract":"A key question in neuroscience is how memorization and association are supported by the mammalian cortex. One possible model, proposed by Valiant, uses sparse encodings in a sparse random graph, but the composability of operations in this model (e.g. an association triggering another association) has not previously been evaluated. We evaluate composability by measuring the size of ldquoitemsrdquo produced by memorization and the propagation of signals through the ldquocircuitsrdquo created by memorization and association. While the association operation is sound, the memorization operation produces ldquoitemsrdquo with unstable size and produces circuits that are extremely sensitive to noise. We therefore amend the model, introducing an association stage into memorization. The amended model preserves and strengthens the sparse encoding hypothesis and invites further characterization of properties such as capacity and interference.","PeriodicalId":366099,"journal":{"name":"2008 7th IEEE International Conference on Development and Learning","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 7th IEEE International Conference on Development and Learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DEVLRN.2008.4640826","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
A key question in neuroscience is how memorization and association are supported by the mammalian cortex. One possible model, proposed by Valiant, uses sparse encodings in a sparse random graph, but the composability of operations in this model (e.g. an association triggering another association) has not previously been evaluated. We evaluate composability by measuring the size of ldquoitemsrdquo produced by memorization and the propagation of signals through the ldquocircuitsrdquo created by memorization and association. While the association operation is sound, the memorization operation produces ldquoitemsrdquo with unstable size and produces circuits that are extremely sensitive to noise. We therefore amend the model, introducing an association stage into memorization. The amended model preserves and strengthens the sparse encoding hypothesis and invites further characterization of properties such as capacity and interference.