1 of 17

1

Darian Hadjiabadi, Ph.D.

Thomas Jefferson HS

MMC Guest Speaker Series

Dec 9, 2022

Quantitative modeling and analysis in neuroscience

2 of 17

2

A little bit about me

  • Recently completed my doctoral research at Stanford University.
    • Will be transitioning to industry Jan 2023.

  • Was a part of math club in high school (Mu Alpha Theta).

  • Love high-fantasy and sci-fi.

  • I still play video games and am on my fourth play through of Witcher 3.

  • I like to code for fun!

3 of 17

3

What is graduate school like, you ask?

Stare at ceiling and hope a question emerges from your subconscious

Come up with hypothesis,

PI shrugs

Read a bunch of

papers for days

Thinking like a scientist

Submit manuscript

Get rejected, rewrite

Get accepted!!

You stop thinking

at this point

“When action grows unprofitable, gather information; when information grows unprofitable, sleep.”

Run the experiment,

Get triggered

Analyze data,

Get triggered

Interpret data and report,

Get triggered

Thinking like an engineer

4 of 17

4

What is graduate school like, you ask?

  • You will learn a range of hard and soft skills
    • Hard skills: Knowledge essential to your subject, coding, math, etc…
    • Soft skills: Communication skills, time management, problem-solving

  • Talking to people is how most projects start!

  • You are expected to be both independent and a team-player
    • Choose your PI (i.e., advisor) wisely!

  • Written and oral communication are fundamental skills for promulgating knowledge
    • Conference posters, oral presentations, fellowships, manuscripts.

  • Resilience, resilience, resilience
    • Validation is at a minimal.
    • Your work will be criticized.
    • You will never forget the moment you made your key discovery.

5 of 17

5

Understanding neural function with math

Farrell, Nguyen, & Soltesz. Neuron (2019).

Generative modeling, dynamical systems, numerical estimation,

optimization, graph theory, linear algebra, software engineering (time-complexity analysis, etc)

6 of 17

6

Wide variety of applications in health and pathology

Utah electrode array

Neural spike data

Brain computer interfaces (BCIs) can help individuals with quadriplegia interact with the world again!

Hidden Markov Model

7 of 17

7

Wide variety of applications in health and pathology

Transcranial magnetic stimulation (TMS) for treating depression (rave reviews)

8 of 17

8

Wide variety of applications in health and pathology

  • Previous studies looked at either single cells over small brain regions OR bulk activity over the entire brain.

  • What if we could do both? Single-cells across the whole brain. What could we learn about how the brain communicates in health and disease?

  • How does this change how we treat the brain?

9 of 17

9

Hadjiabadi et al. Neuron (2021).

Step 1: In vivo Ca2+ imaging

Step 2: Network inference

dentate gyrus

granule

cells

seed node

local cluster

data | model

whole-brain

single-cells

Step 3: Network mining

GCaMP

GCaMP

infer effective connections

GCaMP

GCaMP

control + chemoconvulsant

control +

chronically epileptic

Computational pipeline predicts superhubs as a maximally selective single-cell target for seizure control

10 of 17

10

Whole-brain cellular resolution imaging of the epileptic brain

Zhenrui Liao

Columbia

Attila Losonczy

Columbia

Fraser Sparks

Columbia

Matt Lovett-Barron

UCSD

Karl Deisseroth

Stanford

Scott Baraban

UCSF

11 of 17

11

time (A.U.)

signal (A.U.)

g=0.5

g=1.2

g=5.0

time (A.U.)

(Sompolinsky, 1988)

Chaotic recurrent neural networks

12 of 17

12

Goal: Have the model reconstruct experimental calcium data

Recursive least squares

Connectivity matrix (J)

 

 

+

-

+

 

Update algorithm

 

 

Sompolinsky (1988).

 

 

 

cost function

 

 

 

P(t) approaches inverse cross correlation

Sussillo & Abbott. Neuron (2009).

Network inference through dynamical systems optimization

13 of 17

13

The problem of time

for all epochs [1..M]:

for all time steps [1..T]:

1. Integration

1a. get dx/dt

1b. get z(t)

1c. get e2(t)

2. Update weight

2a. Get c

2b. Get P(t)

2c. Get dJ

1a. dx/dt is O(N2)

1b. z(t) is O(N2)

1c. e2(t) is O(N)

  1. A = Pφ yields an Nx1 vector takes O(N2) time
  2. φTA is a dot product and takes O(N) time
  3. Therefore c(t) is O(N2) + O(N) time

  • For P(t), we already have A = Pφ, so we don’t need to do that operation again.
  • B = φTP yields an 1xN vector and takes O(N2) time.
  • A*B takes O(N2) time and yields an NxN matrix.
  • Therefore, calculating P(t) takes O(N2) time.

  • dJ is O(N2) time but note we already have A = Pφ.

 

 

 

P is NxN

Φ is Nx1

M ~ 102

T ~ 102

N ~ 103

There are O(1010) operations happening here! On one machine with one CPU, this would have taken weeks! Thankfully, I had supercomputers to break one complex problem into Np independent problems, reducing the complexity by 10-fold.

Optimization takes O(M*T*N2) time on a single cpu, O(p*M*T*N2) time on supercomputers [0 < p < 1]

14 of 17

14

Inhbaseline

Inhpresz

Inhpresz = 0.83*Inhbaseline

Linear fit

Unity

R2 = 0.79

Baseline

current

current

current

current

time (s)

time (s)

time (s)

time (s)

synaptic current

noise

PreSz

Model was not driven by noise

Reduced inhibition during presz state

Mode sanity checks

15 of 17

15

% change from baseline

p=0.047

edge

ff

edge conductance

ff motif conductance

p<0.001

p<0.001

baseline

presz

local clustering on inferred outgoing hubs

edge conductance

base

presz

p=0.011

base

presz

ff motif conductance

p=0.033

Graph theoretical analysis provides new insight on the organization of epileptic circuits

16 of 17

16

Happy to take questions!

17 of 17

17

ff motifs

*Hub cell

Rest of network

*

F

A

B

C

D

E

Higher-order

motif-focused

cluster

*

A

Traditional

edge cluster

simple

edges

 

4 edges cut

20 edge end points

edge conductance = 4/20 = 0.20

Finding traditional edge clusters

X’

X

3

3

2

5

4

3

 

Finding higher-order

motif-focused clusters

X

X’

1 motif cut

11 motif end points

motif conductance = 1/11 = 0.091

2

1

1

3

2

2

Motif-based approximate PageRank algorithm [MAPPR] (Yin, 2017)

Key concepts: (1) Local cluster; (2) conductance

Higher-order analysis using MAPPR algorithm

Jure Leskovec

Stanford