COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Computational Neuroscience > Dale’s principle and the neural processing of latent factors

## Dale’s principle and the neural processing of latent factorsAdd to your list(s) Download to your calendar using vCal - Alberto Bernacchia, Jacobs University, Bremen
- Monday 12 October 2015, 11:30-12:30
- Cambridge University Engineering Department, CBL, BE-438 (http://learning.eng.cam.ac.uk/Public/Directions).
If you have a question about this talk, please contact Guillaume Hennequin. The majority of cortical neurons have an exclusive physiological effect, each neuron either excites or inhibits all its synaptic targets. This empirical observation, known as Dale’s principle, poses a strong constraint on the structure and computation of neural circuits, but its function remains unclear. Proposed explanations include: balancing of neural activity, generating oscillations, accelerating and/or amplifying responses to stimuli; However, Dale’s principle is not necessary for implementing any of these functions. A seemingly unrelated, but influential theory, posits that neural circuits aim at decomposing input stimuli into a set of uncorrelated variables, called latent factors. Here I propose that neural circuits aim at transmitting, rather than reconstructing, those latent factors. I show that Dale’s principle is necessary and sufficient for transmitting latent factors, and that known instances of synaptic plasticity rules (STDP) are consistent with its implementation. I study a dynamical model of a neural circuit characterized by a given synaptic matrix and input covariance matrix. I show that the latent factors of the input covariance can be transmitted by the neural circuit provided that the synaptic matrix satisfies a set of constraints. I show that for most types of inputs, those constraints tend to enforce Dale’s principle. Conversely, I show that enforcing Dale’s principle in the synaptic matrix tends to satisfy those constraints. I construct a synaptic plasticity rule that implements these constraints and I show that is consistent with STDP . These results suggest a novel organizational principle of neural circuits that will help predicting their behavior. Future work will be devoted to studying how the latent factors are transmitted in order to solve specific tasks. This talk is part of the Computational Neuroscience series. ## This talk is included in these lists:- All Talks (aka the CURE list)
- Biology
- Biology
- CBL important
- CamBridgeSens
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge Neuroscience Seminars
- Cambridge University Engineering Department, CBL, BE-438 (http://learning.eng.cam.ac.uk/Public/Directions)
- Cambridge talks
- Chris Davis' list
- Computational Neuroscience
- Computational and Biological Learning Seminar Series
- Featured lists
- Guy Emerson's list
- Hanchen DaDaDash
- Inference Group Journal Clubs
- Inference Group Summary
- Information Engineering Division seminar list
- Interested Talks
- Life Science
- Life Science Interface Seminars
- Life Sciences
- Life Sciences
- ME Seminar
- Neuroscience
- Neuroscience Seminars
- Neuroscience Seminars
- Quantum Matter Journal Club
- Required lists for MLG
- Stem Cells & Regenerative Medicine
- TQS Journal Clubs
- Trust & Technology Initiative - interesting events
- bld31
- custom
- dh539
- kt532's list
- my_list
- ndk22's list
- ob366-ai4er
- other talks
- rp587
- se456's list
- yk373's list
Note that ex-directory lists are not shown. |
## Other listsWomen's Word Group Theory, Geometry and Representation Theory: Abel Prize 2008 Bioinformatics joint CRI-BSU series ARClub Talks Cambridge Peace and Education Research Group## Other talksPruning and grafting syntactic trees for cross-lingual transfer tasks TODAY Foster Talk - Integrin-associated adhesion complexes and their role in mechanotransduction Localization estimates for hypoelliptic equations Modularity, criticality and evolvability of a developmental GRN Arithmetic and Dynamics on Markoff-Hurwitz Varieties Borel Local Lemma |