University of Cambridge > Talks.cam > Computational Neuroscience > Computational Neuroscience Journal Club

  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

Computational Neuroscience Journal Club

Download to your calendar using vCal

If you have a question about this talk, please contact Puria Radmard .

Please join us for our Computational Neuroscience journal club on Wednesday 5th June at 2pm UK time in the CBL seminar room.

The title is “Learnable latent embeddings for joint behavioural and neural analysis”, presented by Changmin Yu and Puria Radmard.

Summary:

After some introduction to dimensionality reduction and manifold discovery in neuroscience, Changmin and Puria will present CEBRA . CEBRA a nonlinear manifold embedding method that can explicitly and flexibly leverage joint behaviour and neural data for uncovering neural dynamics. CEBRA yields more consistent latent representations across sessions, animals, and recording modalities, and the inferred latents can be used for decoding. The utility of CEBRA is demonstrated for both calcium and electrophysiology datasets, across sensory and motor tasks, and in simple or complex behaviours across species.

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

EDC loft meeting room, Engineering Department, Trumpington Street Skype "please register here":https://protect-eu.mimecast.com/s/EEd9CpklwHlyO8WCDq6LA?domain=eventbrite.com

Other talks

Rothschild Public Lecture: The Quantum Centenary: from Order to Chaos Favourite Plants: the common, the captivating, and the curious Am I a Member? Auditing Private Machine Learning How Much Does Homology Really Know? Morning Break The rise of local cartography in Europe, 12th-14th century
 

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