University of Cambridge > Talks.cam > Computational Neuroscience > Structure in the randomness of trained recurrent neural networks

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Structure in the randomness of trained recurrent neural networks

Download to your calendar using vCal

If you have a question about this talk, please contact Yul Kang .

Recurrent neural networks are an important class of models for explaining neural computations. Recently, there has been progress both in training these networks to perform various tasks, and in relating their activity to that recorded in the brain. Specifically, these models seem to capture the complexity of realistic neural responses. Despite this progress, there are many fundamental gaps towards a theory of these networks. What does it mean to understand a trained network? What types of regularities should we search for? How does the network reflect the task and its environment? I will present several examples of such regularities, in both the structure and the dynamics that arise through training.

This talk is part of the Computational Neuroscience series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Goldsmiths 1, Lecture Theatre, Department of Materials Science & Metallurgy MAB Boulind Room Mary Allan Building, Homerton College, Hills Road, Cambridge CB2 8PQ FW11, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon

Other talks

Title TBC Welfare Reform and the Imperative of Cooperation Title to be confirmed Using numerical simulations for solving spectral geometry problems Christopher Cowie on the epistemology of assessing biosignature claims Group Work
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity