Solving the Problem of Negative Synaptic Weights in Cortical Models
The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
In cortical neural networks, connections from a given neuron are either inhibitory or excitatory but not both. This constraint is often ignored by theoreticians who build models of these systems. There is currently no general solution to the problem of converting such unrealistic network models into biologically plausible models that respect this constraint. We demonstrate a constructive transformation of models that solves this problem for both feedforward and dynamic recurrent networks. The resulting models give a close approximation to the original network functions and temporal dynamics of the system, and they are biologically plausible. More precisely, we identify a general form for the solution to this problem. As a result, we also describe how the precise solution for a given cortical network can be determined empirically.
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
Zhang, K. (1996) · The Journal of Neuroscience · doi:10.1523/jneurosci.16-06-02112.1996 · Cited by 1,001
Jonas, P., Major, G., & Sakmann, B. (1993) · The Journal of Physiology · doi:10.1113/jphysiol.1993.sp019965 · Cited by 720
How the brain keeps the eyes still
Seung, H. S. (1996) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.93.23.13339 · Cited by 534 · cited 1×
“We run this simulation using recurrent NMDA-mediated synapses with τ = 150 ms as is common (Kinney et al., 1994; Seung, 1996).”
Feed-forward inhibition in the hippocampal formation
BUZSAKI, G. (1984) · Progress in Neurobiology · doi:10.1016/0301-0082(84)90023-6 · Cited by 453
Submillisecond AMPA receptor-mediated signaling at a principal neuron-interneuron synapse
Geiger, J. R. P., Lübke, J., Roth, A., Frotscher, M., & Jonas, P. (1997) · Neuron · doi:10.1016/s0896-6273(00)80339-6 · Cited by 407 · cited 1×
“Hippocampal AMPA-mediated synapses on inhibitory interneurons are fast (Geiger et al., 1997; Carter and Regehr, 2002; Walker et al., 2002), being well modeled by PSCs with τ = 1 ms for these synapses.”
Stability of the memory of eye position in a recurrent network of conductance-based model neurons
Seung, H. S., Lee, D. D., Reis, B. Y., & Tank, D. W. (2000) · Neuron · doi:10.1016/s0896-6273(00)81155-1 · Cited by 339
Rapid Signaling at Inhibitory Synapses in a Dentate Gyrus Interneuron Network
Bartos, M., Vida, I., Frotscher, M., Geiger, J. R. P., & Jonas, P. (2001) · The Journal of Neuroscience · doi:10.1523/jneurosci.21-08-02687.2001 · Cited by 325 · cited 2×
“synapses with τ = 4 ms project onto the B neurons ( Bartos et al., 2001, 2002 ).”
Physiological properties of inhibitory interneurons in cat striate cortex
Azouz, R. (1997) · Cerebral Cortex · doi:10.1093/cercor/7.6.534 · Cited by 173 · cited 2×
“To determine appropriate thresholds for the inhibitory neurons, we can turn to experimental studies of the tuning sensitivities of interneurons in the striate cortex (Azouz et al., 1997).”
Double-ring network model of the head-direction system
Xie, X., Hahnloser, R. H. R., & Seung, H. S. (2002) · Physical Review E · doi:10.1103/physreve.66.041902 · Cited by 124 · cited 1×
“Zipser and Andersen, 1988; Deneve and Pouget, 2003), or analytically solve for the necessary weights to realize some function (see eg. Zhang, 1996; Pouget et al., 1998; Seung et al., 2000; Xie et al., 1996; Conklin and Eliasmith, 2005; Kuo and Eliasmith, 2005).”
Cited by
Lillicrap, T. P., Santoro, A., Marris, L., Akerman, C. J., & Hinton, G. (2020) · Nature Reviews Neuroscience · doi:10.1038/s41583-020-0277-3 · Cited by 908
Zhang, H., & Chen, J. (2017) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.3552 · Cited by 277
Toward an integration of deep learning and neuroscience
Marblestone, A. H., Wayne, G., & Kording, K. P. (2016) · Frontiers in Computational Neuroscience · doi:10.3389/fncom.2016.00094 · Cited by 119
“Fortunately, this constraint is unlikely to limit the functions that can be learned (Parisien et al., 2008; Tripp and Eliasmith, 2016).”
BackgroundEfficient probabilistic inference in generic neural networks trained with non-probabilistic feedback
Orhan, A. E., & Ma, W. J. (2017) · Nature Communications · doi:10.1038/s41467-017-00181-8 · Cited by 77
“However, there are relatively simple ways of turning a generic network that does not respect Dale’s law into an equivalent one that does [32].”
BackgroundOptogenetic perturbations reveal the dynamics of an oculomotor integrator
Gonçalves, P. J., Arrenberg, A. B., Hablitzel, B., Baier, H., & Machens, C. K. (2014) · Frontiers in Neural Circuits · doi:10.3389/fncir.2014.00010 · Cited by 28
“A systematic way of mapping networks with mixed excitatory and inhibitory neurons to networks that obey Dale’s law was recently proposed in Parisien et al. (2008).”
Background
Metadata
- Authors
- Parisien, C., Anderson, C. H., & Eliasmith, C.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 2008-06
- Volume
- 20
- Issue
- 6
- Pages
- 1473-1494
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2169090997
- Cited by
- 89
- References
- 9
- FWCI
- 2.65
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Solving the Problem of Negative Synaptic Weights in Cortical Models. https://app.cochat.ai/papers/10.1162/neco.2008.07-06-295
- The paper
- Parisien, C., Anderson, C. H., & Eliasmith, C. (2008). Solving the Problem of Negative Synaptic Weights in Cortical Models. Neural Computation. https://doi.org/10.1162/neco.2008.07-06-295
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.