Sequence memory for prediction, inference and behaviour
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
In this paper, we propose a mechanism which the neocortex may use to store sequences of patterns. Storing and recalling sequences are necessary for making predictions, recognizing time-based patterns and generating behaviour. Since these tasks are major functions of the neocortex, the ability to store and recall time-based sequences is probably a key attribute of many, if not all, cortical areas. Previously, we have proposed that the neocortex can be modelled as a hierarchy of memory regions, each of which learns and recalls sequences. This paper proposes how each region of neocortex might learn the sequences necessary for this theory. The basis of the proposal is that all the cells in a cortical column share bottom-up receptive field properties, but individual cells in a column learn to represent unique incidences of the bottom-up receptive field property within different sequences. We discuss the proposal, the biological constraints that led to it and some results modelling it.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Emergence of simple-cell receptive field properties by learning a sparse code for natural images
Olshausen, B. A., & Field, D. J. (1996) · Nature · doi:10.1038/381607a0 · Cited by 5,694
Hierarchical models of object recognition in cortex
Riesenhuber, M., & Poggio, T. (1999) · Nature Neuroscience · doi:10.1038/14819 · Cited by 3,309 · cited 1×
“Similar models include Hierarchical Model and X, or HMAX (Riesenhuber & Poggio 1999) and convolutional neural networks (LeCun & Bengio 1995).”
Method(1988) · doi:10.1016/b978-0-08-051489-5.50008-4 · Cited by 1,429
The hierarchical hidden Markov model: Analysis and applications
Fine, S., Singer, Y., & Tishby, N. (1998) · Machine Learning · doi:10.1023/a:1007469218079 · Cited by 906 · cited 1×
“Another model similar to HTM is the hierarchical hidden Markov model (HHMM; Fine et al. 1998).”
MethodData Compression Using Dynamic Markov Modelling
Cormack, G. V., & Horspool, R. N. S. (1987) · The Computer Journal · doi:10.1093/comjnl/30.6.541 · Cited by 213 · cited 3×
“(e) Result of applying the state-splitting algorithm first proposed by Cormack & Horspool (1987) to (d ).”
MethodInfluential
Cited by
Weight consistency specifies regularities of macaque cortical networks
Markov, N. T., Misery, P., Falchier, A., Lamy, C., Vezoli, J., Quilodran, R., Gariel, M. A., Giroud, P., Ercsey-Ravasz, M., Pilaz, L. J., et al. (2011) · Cerebral Cortex · doi:10.1093/cercor/bhq201 · Cited by 386
Towards a mathematical theory of cortical micro-circuits
George, D., & Hawkins, J. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000532 · Cited by 404
“Details of one method of learning higher order Markov chains is available in [28].”
MethodSelf-citationA generative vision model that trains with high data efficiency and breaks text-based CAPTCHAs
George, D., Lehrach, W., Kansky, K., Lázaro-Gredilla, M., Laan, C., Marthi, B., Lou, X., Meng, Z., Liu, Y., Wang, H., et al. (2017) · Science · doi:10.1126/science.aag2612 · Cited by 280
Self-citationHeeger, D. J. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1619788114 · Cited by 220
“Other theories that perform predictions over time are neurally inspired implementations of a Kalman filter (21) or a Markov chain (23).”
BackgroundIqbal, R., Doctor, F., More, B., Mahmud, S., & Yousuf, U. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2017.10.021 · Cited by 155
George, D., Rikhye, R. V., Gothoskar, N., Guntupalli, J. S., Dedieu, A., & Lázaro-Gredilla, M. (2021) · Nature Communications · doi:10.1038/s41467-021-22559-5 · Cited by 109
Self-citationMuckli, L. (2010) · International Journal of Imaging Systems and Technology · doi:10.1002/ima.20236 · Cited by 94
“Comparable models of predictive coding have been suggested time and again (Mumford, 1992; Rao and Ballard, 1999; Friston, 2005; George and Hawkins, 2009; Hawkins et al., 2009;Friston, 2010; Spratling, 2010).”
MethodLearning higher-order sequential structure with cloned HMMs
Dedieu, A., Gothoskar, N., Swingle, S., Lehrach, W., Lázaro-Gredilla, M., & George, D. (2019) · arXiv · doi:10.48550/arxiv.1905.00507 · Cited by 7
“The same idea has been re-discovered several times in different domains [11, 28, 8, 20].”
BackgroundMethodInfluentialSelf-citation
Metadata
- Authors
- Hawkins, J., George, D., & Niemasik, J.
- Venue
- Philosophical Transactions of the Royal Society B: Biological Sciences
- Publisher
- The Royal Society
- Published
- 2009-05-12
- Volume
- 364
- Issue
- 1521
- Pages
- 1203-1209
- ISSN
- 0962-8436 (ISSN-L)
- 1471-2970
- OpenAlex
- W2144701234
- Cited by
- 84
- References
- 5
- FWCI
- 3.50
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.