{"type":"journal_article","day":"02","article_processing_charge":"No","month":"01","date_updated":"2023-09-19T10:16:35Z","date_published":"2018-01-02T00:00:00Z","publication_status":"published","issue":"1","department":[{"_id":"GaTk"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/152660 "}],"abstract":[{"lang":"eng","text":"A central goal in theoretical neuroscience is to predict the response properties of sensory neurons from first principles. To this end, “efficient coding” posits that sensory neurons encode maximal information about their inputs given internal constraints. There exist, however, many variants of efficient coding (e.g., redundancy reduction, different formulations of predictive coding, robust coding, sparse coding, etc.), differing in their regimes of applicability, in the relevance of signals to be encoded, and in the choice of constraints. It is unclear how these types of efficient coding relate or what is expected when different coding objectives are combined. Here we present a unified framework that encompasses previously proposed efficient coding models and extends to unique regimes. We show that optimizing neural responses to encode predictive information can lead them to either correlate or decorrelate their inputs, depending on the stimulus statistics; in contrast, at low noise, efficiently encoding the past always predicts decorrelation. Later, we investigate coding of naturalistic movies and show that qualitatively different types of visual motion tuning and levels of response sparsity are predicted, depending on whether the objective is to recover the past or predict the future. Our approach promises a way to explain the observed diversity of sensory neural responses, as due to multiple functional goals and constraints fulfilled by different cell types and/or circuits."}],"oa_version":"Submitted Version","oa":1,"date_created":"2018-12-11T11:47:04Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"National Academy of Sciences","scopus_import":"1","quality_controlled":"1","title":"Toward a unified theory of efficient, predictive, and sparse coding","status":"public","publication":"PNAS","author":[{"last_name":"Chalk","first_name":"Matthew J","id":"2BAAC544-F248-11E8-B48F-1D18A9856A87","full_name":"Chalk, Matthew J","orcid":"0000-0001-7782-4436"},{"last_name":"Marre","first_name":"Olivier","full_name":"Marre, Olivier"},{"orcid":"0000-0002-6699-1455","first_name":"Gasper","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper"}],"doi":"10.1073/pnas.1711114115","page":"186 - 191","external_id":{"isi":["000419128700049"]},"citation":{"mla":"Chalk, Matthew J., et al. “Toward a Unified Theory of Efficient, Predictive, and Sparse Coding.” <i>PNAS</i>, vol. 115, no. 1, National Academy of Sciences, 2018, pp. 186–91, doi:<a href=\"https://doi.org/10.1073/pnas.1711114115\">10.1073/pnas.1711114115</a>.","ieee":"M. J. Chalk, O. Marre, and G. Tkačik, “Toward a unified theory of efficient, predictive, and sparse coding,” <i>PNAS</i>, vol. 115, no. 1. National Academy of Sciences, pp. 186–191, 2018.","apa":"Chalk, M. J., Marre, O., &#38; Tkačik, G. (2018). Toward a unified theory of efficient, predictive, and sparse coding. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1711114115\">https://doi.org/10.1073/pnas.1711114115</a>","chicago":"Chalk, Matthew J, Olivier Marre, and Gašper Tkačik. “Toward a Unified Theory of Efficient, Predictive, and Sparse Coding.” <i>PNAS</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1711114115\">https://doi.org/10.1073/pnas.1711114115</a>.","ista":"Chalk MJ, Marre O, Tkačik G. 2018. Toward a unified theory of efficient, predictive, and sparse coding. PNAS. 115(1), 186–191.","ama":"Chalk MJ, Marre O, Tkačik G. Toward a unified theory of efficient, predictive, and sparse coding. <i>PNAS</i>. 2018;115(1):186-191. doi:<a href=\"https://doi.org/10.1073/pnas.1711114115\">10.1073/pnas.1711114115</a>","short":"M.J. Chalk, O. Marre, G. Tkačik, PNAS 115 (2018) 186–191."},"_id":"543","language":[{"iso":"eng"}],"intvolume":"       115","publist_id":"7273","volume":115,"year":"2018","isi":1,"project":[{"call_identifier":"FWF","grant_number":"P 25651-N26","_id":"254D1A94-B435-11E9-9278-68D0E5697425","name":"Sensitivity to higher-order statistics in natural scenes"}]}