The Neural Ring: An Algebraic Tool for Analyzing the Intrinsic Structure of Neural Codes
- 524 Downloads
Neurons in the brain represent external stimuli via neural codes. These codes often arise from stereotyped stimulus-response maps, associating to each neuron a convex receptive field. An important problem confronted by the brain is to infer properties of a represented stimulus space without knowledge of the receptive fields, using only the intrinsic structure of the neural code. How does the brain do this? To address this question, it is important to determine what stimulus space features can—in principle—be extracted from neural codes. This motivates us to define the neural ring and a related neural ideal, algebraic objects that encode the full combinatorial data of a neural code. Our main finding is that these objects can be expressed in a “canonical form” that directly translates to a minimal description of the receptive field structure intrinsic to the code. We also find connections to Stanley–Reisner rings, and use ideas similar to those in the theory of monomial ideals to obtain an algorithm for computing the primary decomposition of pseudo-monomial ideals. This allows us to algorithmically extract the canonical form associated to any neural code, providing the groundwork for inferring stimulus space features from neural activity alone.
KeywordsNeural code Pseudo-monomial ideals
CC was supported by NSF DMS 0920845 and NSF DMS 1225666, a Woodrow Wilson Career Enhancement Fellowship, and an Alfred P. Sloan Research Fellowship. VI was supported by NSF DMS 0967377, NSF DMS 1122519, and the Swartz Foundation.
- Brown, E. N., Frank, L. M., Tang, D., Quirk, M. C., & Wilson, M. A. (1998). A statistical paradigm for neural spike train decoding applied to position prediction from ensemble firing patterns of rat hippocampal place cells. J. Neurosci., 18(18), 7411–7425. Google Scholar
- Curto, C., & Itskov, V. (2008). Cell groups reveal structure of stimulus space. PLoS Comput. Biol., 4(10). Google Scholar
- Danzer, L., Grünbaum, B., & Klee, V. (1963). Helly’s theorem and its relatives. In Proc. sympos. pure math. (Vol. VII, pp. 101–180). Providence: Am. Math. Soc. Google Scholar
- Miller, E., & Sturmfels, B. (2005). Graduate texts in mathematics: Combinatorial commutative algebra. Berlin: Springer. Google Scholar
- Pistone, G., Riccomagno, E., & Wynn, H. P. (2001). Computational commutative algebra in statistics. In Monographs on statistics and applied probability.: Vol. 89. Algebraic statistics, Boca Raton: Chapman & Hall/CRC Press. Google Scholar
- Schneidman, E., Puchalla, J., Segev, R., Harris, R., Bialek, W., & Berry II, M. (2006b). Synergy from silence in a combinatorial neural code. arXiv:q-bio.NC/0607017.
- Stanley, R. (2004). Progress in mathematics: Combinatorics and commutative algebra. Boston: Birkhäuser. Google Scholar