Show simple item record

dc.contributor.authorVarshney, Lav R.en_US
dc.contributor.authorKusuma, Juliusen_US
dc.contributor.authorGoyal, Vivek K.en_US
dc.date.accessioned2020-01-27T20:55:33Z
dc.date.available2020-01-27T20:55:33Z
dc.date.issued2016-12
dc.identifier.citationLav R Varshney, Julius Kusuma, Vivek K Goyal. 2016. "On Palimpsests in Neural Memory: An Information Theory Viewpoint." IEEE Transactions on Molecular, Biological and Multi-Scale Communications, Volume 2, Issue 2, pp. 143 - 153. https://doi.org/10.1109/tmbmc.2016.2640320
dc.identifier.issn2332-7804
dc.identifier.urihttps://hdl.handle.net/2144/39173
dc.description.abstractThe finite capacity of neural memory and the reconsolidation phenomenon suggest it is important to be able to update stored information as in a palimpsest, where new information overwrites old information. Moreover, changing information in memory is metabolically costly. In this paper, we suggest that information-theoretic approaches may inform the fundamental limits in constructing such a memory system. In particular, we define malleable coding, that considers not only representation length but also ease of representation update, thereby encouraging some form of recycling to convert an old codeword into a new one. Malleability cost is the difficulty of synchronizing compressed versions, and malleable codes are of particular interest when representing information and modifying the representation are both expensive. We examine the tradeoff between compression efficiency and malleability cost, under a malleability metric defined with respect to a string edit distance. This introduces a metric topology to the compressed domain. We characterize the exact set of achievable rates and malleability as the solution of a subgraph isomorphism problem. This is all done within the optimization approach to biology framework.en_US
dc.format.extent143 - 153en_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.ispartofIEEE Transactions on Molecular, Biological and Multi-Scale Communications
dc.rights© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.en_US
dc.subjectBiological information theoryen_US
dc.subjectError-tolerant subgraph isomorphismen_US
dc.subjectGraph embeddingen_US
dc.subjectLevenshtein edit distanceen_US
dc.subjectMemoryen_US
dc.subjectSource codingen_US
dc.titleOn palimpsests in neural memory: an information theory viewpointen_US
dc.typeArticleen_US
dc.description.versionAccepted manuscripten_US
dc.identifier.doi10.1109/tmbmc.2016.2640320
pubs.elements-sourcecrossrefen_US
pubs.notesEmbargo: Not knownen_US
pubs.organisational-groupBoston Universityen_US
pubs.organisational-groupBoston University, College of Engineeringen_US
pubs.organisational-groupBoston University, College of Engineering, Department of Electrical & Computer Engineeringen_US
pubs.publication-statusPublisheden_US
dc.identifier.mycv123369


This item appears in the following Collection(s)

Show simple item record