2014
DOI: 10.1007/s10827-014-0525-5
|View full text |Cite
|
Sign up to set email alerts
|

Switching neuronal state: optimal stimuli revealed using a stochastically-seeded gradient algorithm

Abstract: Inducing a switch in neuronal state using energy optimal stimuli is relevant to a variety of problems in neuroscience. Analytical techniques from optimal control theory can identify such stimuli; however, solutions to the optimization problem using indirect variational approaches can be elusive in models that describe neuronal behavior. Here we develop and apply a direct gradient-based optimization algorithm to find stimulus waveforms that elicit a change in neuronal state while minimizing energy usage. We ana… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
2
1

Relationship

2
5

Authors

Journals

citations
Cited by 13 publications
(10 citation statements)
references
References 56 publications
0
10
0
Order By: Relevance
“…Calculus of variations 50 is a well-established analytical framework used to address optimization problems. We solved the variational problem directly using a stochastically-seeded gradient algorithm 27 , applied to three models (defined in Supplementary Text S1 ) representing different types of transitions: from quiescence to a spike in the Hodgkin-Huxley model; between sustained oscillation and quiescence in the FitzHugh-Nagumo model; and between two steady states in a genetic toggle switch model. The stochastically-seeded gradient algorithm generates a series of random stimuli, and using a gradient-based approach, calculates how the system will respond to minute changes in the stimulus.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Calculus of variations 50 is a well-established analytical framework used to address optimization problems. We solved the variational problem directly using a stochastically-seeded gradient algorithm 27 , applied to three models (defined in Supplementary Text S1 ) representing different types of transitions: from quiescence to a spike in the Hodgkin-Huxley model; between sustained oscillation and quiescence in the FitzHugh-Nagumo model; and between two steady states in a genetic toggle switch model. The stochastically-seeded gradient algorithm generates a series of random stimuli, and using a gradient-based approach, calculates how the system will respond to minute changes in the stimulus.…”
Section: Methodsmentioning
confidence: 99%
“…Analytical methods for deriving optimal control signals traditionally use calculus of variations 24 26 ; broad application of these techniques to biology is limited because validated mathematical models are available in only a few systems, and variational solutions to complex models can be elusive 27 , 28 . To deal with complex models, researchers have used phase reduction models 28 – 32 , parameterized stimuli 33 , or simpler conceptual models 24 , 25 .…”
Section: Introductionmentioning
confidence: 99%
“…Note that the shorter stimuli have higher amplitude and are right shifted, compared to the longer duration stimuli. We previously showed that the longer stimuli are more energetically optimal [15]. Because of this phenomenon, we can see that if longer and shorter stimuli are included in the library of snippets that induce a spike, averaging the briefer waveforms with the more prolonged waveforms would result in a right-shift compared to the global optimal calculated from the gradient algorithm.…”
Section: Resultsmentioning
confidence: 99%
“…This approach has been used to calculate energyoptimal stimuli for the HH model [8]. An alternative approach has solved this problem directly using a stochastically-seeded gradient algorithm [15]. We use this approach for the HH model, to determine the optimal stimulus necessary to trigger a single action potential in both high and low persistent current conditions.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation