- Series
- Job Candidate Talk
- Time
- Thursday, February 13, 2014 - 3:05pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Vladimir Itskov – U. of Nebraska
- Organizer
- Leonid Bunimovich
Experimental neuroscience is achieving rapid progress in the ability
to collect neural activity and connectivity data. This holds promise to
directly test many theoretical ideas, and thus advance our understanding
of "how the brain works." How to interpret this data, and what exactly
it can tell us about the structure of neural circuits, is still not
well-understood. A major obstacle is that these data often measure
quantities that are related to more "fundamental" variables by an
unknown nonlinear transformation. We find that combinatorial topology
can be used to obtain meaningful answers to questions about the
structure of neural activity.
In this talk I will first introduce a new method, using tools from
computational topology, for detecting structure in correlation matrices
that is obscured by an unknown nonlinear transformation. I will
illustrate its use by testing the "coding space" hypothesis on neural
data. In the second part of my talk I will attempt to answer a simple
question: given a complete set of binary response patterns of a network,
can we rule out that the network functions as a collection of
disconnected discriminators (perceptrons)? Mathematically this
translates into questions about the combinatorics of hyperplane
arrangements and convex sets.