Scaling and Benchmarking an Evolutionary Algorithm for Constructing Biophysical Neuronal Models.
Ontology highlight
ABSTRACT:
SUBMITTER: Ladd A
PROVIDER: S-EPMC9248031 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:The design and construction of network structures oriented towards different applications has attracted much attention recently. The existing studies indicated that structural heterogeneity plays different roles in promoting cooperation and robustness. Compared with rewiring a predefined network, it is more flexible and practical to construct new networks that satisfy the desired properties. Therefore, in this paper, we study a method for constructing robust cooperative networks where the only constraint is that the number of nodes and links is predefined. We model this network construction problem as a multi-objective optimization problem and propose a multi-objective evolutionary algorithm, named MOEA-Netrc, to generate the desired networks from arbitrary initializations. The performance of MOEA-Netrc is validated on several synthetic and real-world networks. The results show that MOEA-Netrc can construct balanced candidates and is insensitive to the initializations. MOEA-Netrc can find the Pareto fronts for networks with different levels of cooperation and robustness. In addition, further investigation of the robustness of the constructed networks revealed the impact on other aspects of robustness during the construction process.
| S-EPMC5278550 | biostudies-literature
Project description:Recent advances in the development of data structures to represent spiking neuron network models enable us to exploit the complete memory of petascale computers for a single brain-scale network simulation. In this work, we investigate how well we can exploit the computing power of such supercomputers for the creation of neuronal networks. Using an established benchmark, we divide the runtime of simulation code into the phase of network construction and the phase during which the dynamical state is advanced in time. We find that on multi-core compute nodes network creation scales well with process-parallel code but exhibits a prohibitively large memory consumption. Thread-parallel network creation, in contrast, exhibits speedup only up to a small number of threads but has little overhead in terms of memory. We further observe that the algorithms creating instances of model neurons and their connections scale well for networks of ten thousand neurons, but do not show the same speedup for networks of millions of neurons. Our work uncovers that the lack of scaling of thread-parallel network creation is due to inadequate memory allocation strategies and demonstrates that thread-optimized memory allocators recover excellent scaling. An analysis of the loop order used for network construction reveals that more complex tests on the locality of operations significantly improve scaling and reduce runtime by allowing construction algorithms to step through large networks more efficiently than in existing code. The combination of these techniques increases performance by an order of magnitude and harnesses the increasingly parallel compute power of the compute nodes in high-performance clusters and supercomputers.
| S-EPMC5432669 | biostudies-literature
Project description:Calcium imaging has been used as a promising technique to monitor the dynamic activity of neuronal populations. However, the calcium trace is temporally smeared which restricts the extraction of quantities of interest such as spike trains of individual neurons. To address this issue, spike reconstruction algorithms have been introduced. One limitation of such reconstructions is that the underlying models are not informed about the biophysics of spike and burst generations. Such existing prior knowledge might be useful for constraining the possible solutions of spikes. Here we describe, in a novel Bayesian approach, how principled knowledge about neuronal dynamics can be employed to infer biophysical variables and parameters from fluorescence traces. By using both synthetic and in vitro recorded fluorescence traces, we demonstrate that the new approach is able to reconstruct different repetitive spiking and/or bursting patterns with accurate single spike resolution. Furthermore, we show that the high inference precision of the new approach is preserved even if the fluorescence trace is rather noisy or if the fluorescence transients show slow rise kinetics lasting several hundred milliseconds, and inhomogeneous rise and decay times. In addition, we discuss the use of the new approach for inferring parameter changes, e.g. due to a pharmacological intervention, as well as for inferring complex characteristics of immature neuronal circuits.
| S-EPMC4760968 | biostudies-literature
Project description:A bilevel programming problem with multiple objectives at the leader's and/or follower's levels, known as a bilevel multiobjective programming problem (BMPP), is extraordinarily hard as this problem accumulates the computational complexity of both hierarchical structures and multiobjective optimisation. As a strongly NP-hard problem, the BMPP incurs a significant computational cost in obtaining non-dominated solutions at both levels, and few studies have addressed this issue. In this study, an evolutionary algorithm is developed using surrogate optimisation models to solve such problems. First, a dynamic weighted sum method is adopted to address the follower's multiple objective cases, in which the follower's problem is categorised into several single-objective ones. Next, for each the leader's variable values, the optimal solutions to the transformed follower's programs can be approximated by adaptively improved surrogate models instead of solving the follower's problems. Finally, these techniques are embedded in MOEA/D, by which the leader's non-dominated solutions can be obtained. In addition, a heuristic crossover operator is designed using gradient information in the evolutionary procedure. The proposed algorithm is executed on some computational examples including linear and nonlinear cases, and the simulation results demonstrate the efficiency of the approach.
| S-EPMC7746194 | biostudies-literature
Project description:Running is an essential mode of human locomotion, during which ballistic aerial phases alternate with phases when a single foot contacts the ground. The spring-loaded inverted pendulum (SLIP) provides a starting point for modelling running, and generates ground reaction forces that resemble those of the centre of mass (CoM) of a human runner. Here, we show that while SLIP reproduces within-step kinematics of the CoM in three dimensions, it fails to reproduce stability and predict future motions. We construct SLIP control models using data-driven Floquet analysis, and show how these models may be used to obtain predictive models of human running with six additional states comprising the position and velocity of the swing-leg ankle. Our methods are general, and may be applied to any rhythmic physical system. We provide an approach for identifying an event-driven linear controller that approximates an observed stabilization strategy, and for producing a reduced-state model which closely recovers the observed dynamics.
| S-EPMC4305406 | biostudies-literature
Project description:Homeostatic scaling adjusts synaptic strength in response to persistent changes in neuronal network activity. This compensatory mechanism requires proteome remodeling accomplished via regulation of protein synthesis as well as degradation, but the global patterns of proteome remodeling and the underlying dynamics of individual proteins remain elusive. Here we used dynamic SILAC labeling in cultured hippocampal cells to identify proteins involved in homeostatic up- or down-scaling and to quantify their changes in synthesis and degradation as well as resulting changes in protein abundance or turnover. Our data demonstrate that a large fraction of the neuronal proteome is remodeled during homeostatic scaling. Most proteins were down-regulated by decreased synthesis or up-regulated by decreased degradation. Comparably fewer proteins showed increased synthesis or degradation rates. More than half of the quantified synaptic proteins were regulated, including pre- as well as postsynaptic proteins with diverse molecular functions.
2020-03-31 | PXD016004 | Pride
Project description:The rich dynamical nature of neurons poses major conceptual and technical challenges for unraveling their nonlinear membrane properties. Traditionally, various current waveforms have been injected at the soma to probe neuron dynamics, but the rationale for selecting specific stimuli has never been rigorously justified. The present experimental and theoretical study proposes a novel framework, inspired by learning theory, for objectively selecting the stimuli that best unravel the neuron's dynamics. The efficacy of stimuli is assessed in terms of their ability to constrain the parameter space of biophysically detailed conductance-based models that faithfully replicate the neuron's dynamics as attested by their ability to generalize well to the neuron's response to novel experimental stimuli. We used this framework to evaluate a variety of stimuli in different types of cortical neurons, ages and animals. Despite their simplicity, a set of stimuli consisting of step and ramp current pulses outperforms synaptic-like noisy stimuli in revealing the dynamics of these neurons. The general framework that we propose paves a new way for defining, evaluating and standardizing effective electrical probing of neurons and will thus lay the foundation for a much deeper understanding of the electrical nature of these highly sophisticated and non-linear devices and of the neuronal networks that they compose.
| S-EPMC3158041 | biostudies-literature
Project description:Enhanced receptiveness at all synapses on a neuron that receive glutamatergic input is called cell-wide synaptic upscaling. We hypothesize that this type of synaptic plasticity may be critical for long-term memory storage within cortical circuits, a process that may also depend on epigenetic mechanisms, such as covalent chemical modification of DNA. We found that DNA cytosine demethylation mediates multiplicative synaptic upscaling of glutamatergic synaptic strength in cultured cortical neurons. Inhibiting neuronal activity with tetrodotoxin (TTX) decreased the cytosine methylation of and increased the expression of genes encoding glutamate receptors and trafficking proteins, in turn increasing the amplitude but not frequency of miniature excitatory postsynaptic currents (mEPSCs), indicating synaptic upscaling rather than increased spontaneous activity. Inhibiting DNA methyltransferase (DNMT) activity, either by using the small-molecule inhibitor RG108 or by knocking down Dnmt1 and Dnmt3a, induced synaptic upscaling to a similar magnitude as exposure to TTX. Moreover, upscaling induced by DNMT inhibition required transcription; the RNA polymerase inhibitor actinomycin D blocked upscaling induced by DNMT inhibition. Knocking down the cytosine demethylase TET1 also blocked the upscaling effects of RG108. DNMT inhibition induced a multiplicative increase in mEPSC amplitude, indicating that the alterations in glutamate receptor abundance occurred in a coordinated manner throughout a neuron and were not limited to individual active synapses. Our data suggest that DNA methylation status controls transcription-dependent regulation of glutamatergic synaptic homeostasis. Furthermore, covalent DNA modifications may contribute to synaptic plasticity events that underlie the formation and stabilization of memories.
| S-EPMC4764068 | biostudies-literature
Project description:Background. Datasets consisting of synthetic neural data generated with quantifiable and controlled parameters are a valuable asset in the process of testing and validating directed functional connectivity metrics. Considering the recent debate in the neuroimaging community concerning the use of these metrics for fMRI data, synthetic datasets that emulate the BOLD signal dynamics have played a central role by supporting claims that argue in favor or against certain choices. Generative models often used in studies that simulate neuronal activity, with the aim of gaining insight into specific brain regions and functions, have different requirements from the generative models for benchmarking datasets. Even though the latter must be realistic, there is a tradeoff between realism and computational demand that needs to be contemplated and simulations that efficiently mimic the real behavior of single neurons or neuronal populations are preferred, instead of more cumbersome and marginally precise ones. Methods. This work explores how simple generative models are able to produce neuronal datasets, for benchmarking purposes, that reflect the simulated effective connectivity and, how these can be used to obtain synthetic recordings of EEG and fMRI BOLD signals. The generative models covered here are AR processes, neural mass models consisting of linear and nonlinear stochastic differential equations and populations with thousands of spiking units. Forward models for EEG consist in the simple three-shell head model while the fMRI BOLD signal is modeled with the Balloon-Windkessel model or by convolution with a hemodynamic response function. Results. The simulated datasets are tested for causality with the original spectral formulation for Granger causality. Modeled effective connectivity can be detected in the generated data for varying connection strengths and interaction delays. Discussion. All generative models produce synthetic neuronal data with detectable causal effects although the relation between modeled and detected causality varies and less biophysically realistic models offer more control in causal relations such as modeled strength and frequency location.
| S-EPMC4435472 | biostudies-literature
Project description:Phylogenetic networks construction is one the most important challenge in phylogenetics. These networks can present complex non-treelike events such as gene flow, horizontal gene transfers, recombination or hybridizations. Among phylogenetic networks, rooted structures are commonly used to represent the evolutionary history of a species set, explicitly. Triplets are well known input for constructing the rooted networks. Obtaining an optimal rooted network that contains all given triplets is main problem in network construction. The optimality criteria include minimizing the level or the number of reticulation nodes. The complexity of this problem is known to be NP-hard. In this research, a new algorithm called Netcombin is introduced to construct approximately an optimal network which is consistent with input triplets. The innovation of this algorithm is based on binarization and expanding processes. The binarization process innovatively uses a measure to construct a binary rooted tree T consistent with the approximately maximum number of input triplets. Then T is expanded using a heuristic function by adding minimum number of edges to obtain final network with the approximately minimum number of reticulation nodes. In order to evaluate the proposed algorithm, Netcombin is compared with four state of the art algorithms, RPNCH, NCHB, TripNet, and SIMPLISTIC. The experimental results on simulated data obtained from biologically generated sequences data indicate that by considering the trade-off between speed and precision, the Netcombin outperforms the others.
| S-EPMC7500971 | biostudies-literature