Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin
description
Transcript of Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin
![Page 1: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/1.jpg)
Lior Segev
Ranit Aharonov
Alon Keinan
Isaac Meilijson
www.math.tau.ac.il/~ruppin
Localization of Function in Localization of Function in Neurocontrollers Neurocontrollers
![Page 2: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/2.jpg)
Localization of Function
– How does one ``understand’’ neural information processing?
– A classical, good point to start with is localization of function(s) in neurocontrollers
– A good model to start with is Evolutionary Autonomous Agents (EAAs)
– Scope of analysis method may be more general
![Page 3: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/3.jpg)
Evolved neurocontrollersEvolved neurocontrollers
![Page 4: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/4.jpg)
Talk Overview
• The basic Functional Contribution Analysis (FCA)
• Localization of Subtasks• Synaptic Analysis• High-dimensional FCA• Informational Lesioning• Playing games in the brain, or “My fair lady”.
![Page 5: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/5.jpg)
The basic FCA
• A multi-lesion approach: learning about normal, intact functioning via lesion ``perturbations’’
• Given are a set of neurocontroller lesions and the agent’s corresponding performance levels
• Assign ``importance’’ levels to the different units of the neurocontroller?
• The FCA: Find such assginments that maximize performance prediction of unseen lesions
![Page 6: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/6.jpg)
Lesioning
C1
C2
C3
C4
C5
C6
p = f(c1+c3+c4+c6)~
argmin = Σ(p-p)2
{f,c}
12N
~
![Page 7: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/7.jpg)
The Functional Contribution Algorithm (FCA)
f
module
c
module
optimal
f and c
training set
min(p-p)2~
![Page 8: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/8.jpg)
![Page 9: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/9.jpg)
The performance prediction function
(m . c)
P
![Page 10: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/10.jpg)
Single Lesions vs. FCA
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
S10 (General)
S10 (Grazing)
S10 (Exploration)
S22 (General)
SP10 (General)
Single Lesions
FCA
![Page 11: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/11.jpg)
Generalization – an Adaptive Lesion Selection algorithm
0
2
4
6
8
10
12
0 20 40 60 80
No. of configurations
MS
E
AdaptiveRandom
0
0.2
0.4
0.6
0.8
1
30 50 70
![Page 12: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/12.jpg)
Task Comparison
Grazing
-0.1
0
0.1
0.2
0.3
0.4
0.5
0.6
1 2 3 4 5 6 7 8 9 10
Co
ntr
ibu
tio
n v
alu
e
Exploration
-0.1
0
0.1
0.2
0.3
0.4
0.5
0.6
1 2 3 4 5 6 7 8 9 10
Co
ntr
ibu
tio
n v
alu
e
0
0.1
0.2
0.3
0.4
0.5
1 2 3 4 5 6 7 8 9 10
General task
![Page 13: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/13.jpg)
The Contribution Matrix – Localization and Specification
Task
Neuron
1 2 P
1 C11 C12 C1P
2 C21 C22 C2P
3 C31 C32 C3P
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
N CN1 CN2 CNP
![Page 14: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/14.jpg)
Synaptic AnalysisSynaptic Analysis
![Page 15: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/15.jpg)
![Page 16: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/16.jpg)
Network BackboneBy weights
By contributions
![Page 17: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/17.jpg)
High-dimensional FCA
• The inherent limitations of basic FCA (e.g., paradoxical lesioning)
• Compound Elements
• Order (dimension) of compound elements
• An efficient High-D algorithm for compound element selection
![Page 18: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/18.jpg)
Complexity of Task Localization
00.0020.0040.0060.008
0.010.0120.0140.0160.018
0.02
10 30 50 70 90 110
No. of elements
MSE
1D-FCA
2D-FCA
3D-FCA
4D-FCA
![Page 19: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/19.jpg)
Types of 2D Interactions
• Paradoxical Interactions – element 1 is advantageous only if element 2 is intact
• Inverse Paradoxical interactions – element 1 is advantageous only if element 2 is lesioned
• All significant 2D compound elements belong to either type (there can be others..)
![Page 20: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/20.jpg)
Informational Lesioning Method (ILM)
• The paradox of the lesioning paradigm• The dependence on the lesioning method• Controlled lesioning – approaching the limit of
intact behavior• Implement a lesion as a channel whose input
is the firing of the intact element and output is the firing of the lesioned element (given an input).
• Quantify the lesioning level as an inverse function of the Mutual Information between the input and output of the channel
![Page 21: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/21.jpg)
![Page 22: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/22.jpg)
![Page 23: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/23.jpg)
![Page 24: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/24.jpg)
![Page 25: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/25.jpg)
![Page 26: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/26.jpg)
ILM – In summary:
• Increased localization precision
• Portraying a spectrum of short-to-long term functional effects of system units
• Approaching the limit CVs of the intact state, in the ILM lesioning family
• Does such a limit exist more generally? Is the beauty inherently in the of the beholder?
![Page 27: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/27.jpg)
Where Game Theory meets Brain Research..
• “George said: You know, we are on a wrong track altogether. We must not think of the things we could do with, but only of the things that we can’t do without.”
[Three men in a boat: to say nothing of the dog!, by Jerome K. Jerome, chapter 3]
![Page 28: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/28.jpg)
FCA and the Shapley Value
• The Shapley value (SH): A famed, unique solution of cost allocation in a game theory axiomatic system
• Many functioning networks (including our EAA neurocontrollers) can be addressed within this framework
• An alternative formulation of the FCA is equivalent to the SH (even though the starting standpoints and motivations are different).
![Page 29: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/29.jpg)
Ongoing FCA Research
• Optimal Lesioning ?
• Relation to SH and more efficient algorithms (sampling, high-D..).
• Generalization to PPR
• Application to neuroscience data (reverse inactivation, TMS, fMRI).
• Application to gene networks?
![Page 30: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/30.jpg)
•The contribution values can be efficiently determined using the simple FCA.• More complex networks require higher dimensional FCA descriptions. •The minimal dimension of the FCA may provide an interesting measure of functional complexity.• The importance of being lesioned (in the “right” way..) – ILM and beyond.• Even if the brain is not “a society of minds”, it can be analyzed with the aids of fundamental tools from game theory.•www.math.tau.ac.il/~ruppin – papers (and code)
SummarySummary
![Page 31: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/31.jpg)
![Page 32: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/32.jpg)
![Page 33: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/33.jpg)
Network backbone: 2D interactions
![Page 34: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/34.jpg)
![Page 35: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/35.jpg)
![Page 36: Lior Segev Ranit Aharonov Alon Keinan Isaac Meilijson math.tau.ac.il/~ruppin](https://reader035.fdocuments.us/reader035/viewer/2022062808/568152dd550346895dc0fa34/html5/thumbnails/36.jpg)