Temporal Conditioning Spiking Latent Variable Models of the Neural Response to Natural Visual Scenes

被引:0
作者
Ma, Gehua [1 ]
Jiang, Runhao [1 ]
Yan, Rui [1 ]
Tang, Huajin [1 ]
机构
[1] Zhejiang Univ, Coll Comp Sci & Technol, Hangzhou, Peoples R China
来源
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023) | 2023年
基金
中国国家自然科学基金;
关键词
INFORMATION; NOISE; NETWORKS; INTEGRATION; ADAPTATION; CONTRAST; RETINA; TRAINS; SPACE;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Developing computational models of neural response is crucial for understanding sensory processing and neural computations. Current state-of-the-art neural network methods use temporal filters to handle temporal dependencies, resulting in an unrealistic and inflexible processing paradigm. Meanwhile, these methods target trial-averaged firing rates and fail to capture important features in spike trains. This work presents the temporal conditioning spiking latent variable models (TeCoS-LVM) to simulate the neural response to natural visual stimuli. We use spiking neurons to produce spike outputs that directly match the recorded trains. This approach helps to avoid losing information embedded in the original spike trains. We exclude the temporal dimension from the model parameter space and introduce a temporal conditioning operation to allow the model to adaptively explore and exploit temporal dependencies in stimuli sequences in a natural paradigm. We show that TeCoS-LVM models can produce more realistic spike activities and accurately fit spike statistics than powerful alternatives. Additionally, learned TeCoS-LVM models can generalize well to longer time scales. Overall, while remaining computationally tractable, our model effectively captures key features of neural coding systems. It thus provides a useful tool for building accurate predictive computational accounts for various sensory perception circuits.
引用
收藏
页数:22
相关论文
共 86 条
[1]  
Alemi A. A., 2017, P INT C LEARN REPR, P1
[2]  
[Anonymous], 2015, NeurIPS
[3]  
[Anonymous], PATTERNS
[4]  
[Anonymous], 2014, Learning stochastic recurrent networks
[5]  
Arribas Diego, 2020, Adv. Neural. Inf. Process. Syst, V33, P2293, DOI DOI 10.5555/3495724.3495917
[6]   Towards a Theory of Early Visual Processing [J].
Atick, Joseph J. ;
Redlich, A. Norman .
NEURAL COMPUTATION, 1990, 2 (03) :308-320
[7]   Non-Gaussian Ornstein-Uhlenbeck-based models and some of their uses in financial economics [J].
Barndorff-Nielsen, OE ;
Shephard, N .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY, 2001, 63 :167-207
[8]  
Batty Eleanor, 2017, ICLR
[9]   A solution to the learning dilemma for recurrent networks of spiking neurons [J].
Bellec, Guillaume ;
Scherr, Franz ;
Subramoney, Anand ;
Hajek, Elias ;
Salaj, Darjan ;
Legenstein, Robert ;
Maass, Wolfgang .
NATURE COMMUNICATIONS, 2020, 11 (01)
[10]   Closed-Loop Measurements of Iso-Response Stimuli Reveal Dynamic Nonlinear Stimulus Integration in the Retina [J].
Boelinger, Daniel ;
Gollisch, Tim .
NEURON, 2012, 73 (02) :333-346