Adaptive Stimulus Design for Dynamic Recurrent Neural Network Models

dc.contributor.author Doruk, R. Ozgur
dc.contributor.author Zhang, Kechen
dc.date.accessioned 2024-07-05T15:28:20Z
dc.date.available 2024-07-05T15:28:20Z
dc.date.issued 2019
dc.description Doruk, Ozgur/0000-0002-9217-0845 en_US
dc.description.abstract We present an adaptive stimulus design method for efficiently estimating the parameters of a dynamic recurrent network model with interacting excitatory and inhibitory neuronal populations. Although stimuli that are optimized for model parameter estimation should, in theory, have advantages over nonadaptive random stimuli, in practice it remains unclear in what way and to what extent an optimal design of time-varying stimuli may actually improve parameter estimation for this common type of recurrent network models. Here we specified the time course of each stimulus by a Fourier series whose amplitudes and phases were determined by maximizing a utility function based on the Fisher information matrix. To facilitate the optimization process, we have derived differential equations that govern the time evolution of the gradients of the utility function with respect to the stimulus parameters. The network parameters were estimated by maximum likelihood from the spike train data generated by an inhomogeneous Poisson process from the continuous network state. The adaptive design process was repeated in a closed loop, alternating between optimal stimulus design and parameter estimation from the updated stimulus-response data. Our results confirmed that, compared with random stimuli, optimally designed stimuli elicited responses with significantly better likelihood values for parameter estimation. Furthermore, all individual parameters, including the time constants and the connection weights, were recovered more accurately by the optimal design method. We also examined how the errors of different parameter estimates were correlated, and proposed heuristic formulas to account for the correlation patterns by an approximate parameter-confounding theory. Our results suggest that although adaptive optimal stimulus design incurs considerable computational cost even for the simplest excitatory-inhibitory recurrent network model, it may potentially help save time in experiments by reducing the number of stimuli needed for network parameter estimation. en_US
dc.description.sponsorship Turkish Scientific and Technological Research Council (TUBITAK) 2219 Research Program; NIH [R01 DC013698] en_US
dc.description.sponsorship Supported by Turkish Scientific and Technological Research Council (TUBITAK) 2219 Research Program and NIH grant R01 DC013698. All the computer codes in Matlab for the simulations in this paper are freely available upon request for scientific research and education or any noncommercial use. en_US
dc.identifier.doi 10.3389/fncir.2018.00119
dc.identifier.issn 1662-5110
dc.identifier.scopus 2-s2.0-85061116101
dc.identifier.uri https://doi.org/10.3389/fncir.2018.00119
dc.identifier.uri https://hdl.handle.net/20.500.14411/2780
dc.language.iso en en_US
dc.publisher Frontiers Media Sa en_US
dc.relation.ispartof Frontiers in Neural Circuits
dc.rights info:eu-repo/semantics/openAccess en_US
dc.subject optimal stimulus design en_US
dc.subject Fisher information matrix en_US
dc.subject excitatory-inhibitory network en_US
dc.subject inhomogeneous poisson spike train en_US
dc.subject maximum likelihood estimation en_US
dc.subject parameter confounding en_US
dc.subject Fourier series en_US
dc.subject sensory coding en_US
dc.title Adaptive Stimulus Design for Dynamic Recurrent Neural Network Models en_US
dc.type Article en_US
dspace.entity.type Publication
gdc.author.id Doruk, Ozgur/0000-0002-9217-0845
gdc.author.scopusid 8503734100
gdc.author.scopusid 7404451228
gdc.author.wosid Doruk, Ozgur/T-9951-2018
gdc.bip.impulseclass C5
gdc.bip.influenceclass C5
gdc.bip.popularityclass C5
gdc.coar.access open access
gdc.coar.type text::journal::journal article
gdc.collaboration.industrial false
gdc.description.department Atılım University en_US
gdc.description.departmenttemp [Doruk, R. Ozgur] Atilim Univ, Dept Elect & Elect Engn, Golbasi, Turkey; [Doruk, R. Ozgur; Zhang, Kechen] Johns Hopkins Univ, Sch Med, Dept Biomed Engn, Baltimore, MD 21205 USA en_US
gdc.description.publicationcategory Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı en_US
gdc.description.scopusquality Q2
gdc.description.volume 12 en_US
gdc.description.wosquality Q2
gdc.identifier.openalex W2964118041
gdc.identifier.pmid 30723397
gdc.identifier.wos WOS:000456513500001
gdc.oaire.accesstype GOLD
gdc.oaire.diamondjournal false
gdc.oaire.impulse 2.0
gdc.oaire.influence 2.5739462E-9
gdc.oaire.isgreen true
gdc.oaire.keywords Neurons
gdc.oaire.keywords Fisher information matrix
gdc.oaire.keywords parameter confounding
gdc.oaire.keywords Models, Neurological
gdc.oaire.keywords Action Potentials
gdc.oaire.keywords maximum likelihood estimation
gdc.oaire.keywords Neurosciences. Biological psychiatry. Neuropsychiatry
gdc.oaire.keywords excitatory-inhibitory network
gdc.oaire.keywords inhomogeneous poisson spike train
gdc.oaire.keywords Research Design
gdc.oaire.keywords Quantitative Biology - Neurons and Cognition
gdc.oaire.keywords FOS: Biological sciences
gdc.oaire.keywords Animals
gdc.oaire.keywords Computer Simulation
gdc.oaire.keywords Neurons and Cognition (q-bio.NC)
gdc.oaire.keywords Neural Networks, Computer
gdc.oaire.keywords optimal stimulus design
gdc.oaire.keywords Algorithms
gdc.oaire.keywords RC321-571
gdc.oaire.keywords Neuroscience
gdc.oaire.popularity 2.0015032E-9
gdc.oaire.publicfunded false
gdc.oaire.sciencefields 0301 basic medicine
gdc.oaire.sciencefields 0303 health sciences
gdc.oaire.sciencefields 03 medical and health sciences
gdc.openalex.collaboration International
gdc.openalex.fwci 0.27469512
gdc.openalex.normalizedpercentile 0.54
gdc.opencitations.count 2
gdc.plumx.crossrefcites 2
gdc.plumx.mendeley 22
gdc.plumx.pubmedcites 2
gdc.plumx.scopuscites 1
gdc.scopus.citedcount 1
gdc.virtual.author Doruk, Reşat Özgür
gdc.wos.citedcount 1
relation.isAuthorOfPublication bbc93c72-5a45-4b28-9b05-5ae035e52a76
relation.isAuthorOfPublication.latestForDiscovery bbc93c72-5a45-4b28-9b05-5ae035e52a76
relation.isOrgUnitOfPublication 032f8aca-54a7-476c-b399-6f26feb20a7d
relation.isOrgUnitOfPublication 4abda634-67fd-417f-bee6-59c29fc99997
relation.isOrgUnitOfPublication 50be38c5-40c4-4d5f-b8e6-463e9514c6dd
relation.isOrgUnitOfPublication.latestForDiscovery 032f8aca-54a7-476c-b399-6f26feb20a7d

Files

Collections