Estimation of a large-scale generalized Volterra model for neural ensembles with group lasso and local coordinate descent

Author(s):  
Brian S. Robinson ◽  
Dong Song ◽  
Theodore W. Berger
IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Fanhua Shang ◽  
Zhihui Zhang ◽  
Yuanyuan Liu ◽  
Hongying Liua ◽  
Jing Xu

2018 ◽  
Vol 30 (9) ◽  
pp. 2472-2499 ◽  
Author(s):  
Zhitong Qiao ◽  
Yan Han ◽  
Xiaoxia Han ◽  
Han Xu ◽  
Will X. Y. Li ◽  
...  

A hippocampal prosthesis is a very large scale integration (VLSI) biochip that needs to be implanted in the biological brain to solve a cognitive dysfunction. In this letter, we propose a novel low-complexity, small-area, and low-power programmable hippocampal neural network application-specific integrated circuit (ASIC) for a hippocampal prosthesis. It is based on the nonlinear dynamical model of the hippocampus: namely multi-input, multi-output (MIMO)–generalized Laguerre-Volterra model (GLVM). It can realize the real-time prediction of hippocampal neural activity. New hardware architecture, a storage space configuration scheme, low-power convolution, and gaussian random number generator modules are proposed. The ASIC is fabricated in 40 nm technology with a core area of 0.122 mm[Formula: see text] and test power of 84.4 [Formula: see text]W. Compared with the design based on the traditional architecture, experimental results show that the core area of the chip is reduced by 84.94% and the core power is reduced by 24.30%.


Genes ◽  
2019 ◽  
Vol 10 (3) ◽  
pp. 240 ◽  
Author(s):  
Gangcai Xie ◽  
Chengliang Dong ◽  
Yinfei Kong ◽  
Jiang Zhong ◽  
Mingyao Li ◽  
...  

Accurate prognosis of patients with cancer is important for the stratification of patients, the optimization of treatment strategies, and the design of clinical trials. Both clinical features and molecular data can be used for this purpose, for instance, to predict the survival of patients censored at specific time points. Multi-omics data, including genome-wide gene expression, methylation, protein expression, copy number alteration, and somatic mutation data, are becoming increasingly common in cancer studies. To harness the rich information in multi-omics data, we developed GDP (Group lass regularized Deep learning for cancer Prognosis), a computational tool for survival prediction using both clinical and multi-omics data. GDP integrated a deep learning framework and Cox proportional hazard model (CPH) together, and applied group lasso regularization to incorporate gene-level group prior knowledge into the model training process. We evaluated its performance in both simulated and real data from The Cancer Genome Atlas (TCGA) project. In simulated data, our results supported the importance of group prior information in the regularization of the model. Compared to the standard lasso regularization, we showed that group lasso achieved higher prediction accuracy when the group prior knowledge was provided. We also found that GDP performed better than CPH for complex survival data. Furthermore, analysis on real data demonstrated that GDP performed favorably against other methods in several cancers with large-scale omics data sets, such as glioblastoma multiforme, kidney renal clear cell carcinoma, and bladder urothelial carcinoma. In summary, we demonstrated that GDP is a powerful tool for prognosis of patients with cancer, especially when large-scale molecular features are available.


Author(s):  
Ehsan Kazemi ◽  
Liqiang Wang

Nonconvex and nonsmooth problems have recently attracted considerable attention in machine learning. However, developing efficient methods for the nonconvex and nonsmooth optimization problems with certain performance guarantee remains a challenge. Proximal coordinate descent (PCD) has been widely used for solving optimization problems, but the knowledge of PCD methods in the nonconvex setting is very limited. On the other hand, the asynchronous proximal coordinate descent (APCD) recently have received much attention in order to solve large-scale problems. However, the accelerated variants of APCD algorithms are rarely studied. In this paper, we extend APCD method to the accelerated algorithm (AAPCD) for nonsmooth and nonconvex problems that satisfies the sufficient descent property, by comparing between the function values at proximal update and a linear extrapolated point using a delay-aware momentum value. To the best of our knowledge, we are the first to provide stochastic and deterministic accelerated extension of APCD algorithms for general nonconvex and nonsmooth problems ensuring that for both bounded delays and unbounded delays every limit point is a critical point. By leveraging Kurdyka-Łojasiewicz property, we will show linear and sublinear convergence rates for the deterministic AAPCD with bounded delays. Numerical results demonstrate the practical efficiency of our algorithm in speed.


2016 ◽  
Vol 115 (3) ◽  
pp. 1521-1532 ◽  
Author(s):  
Konstantin I. Bakhurin ◽  
Victor Mac ◽  
Peyman Golshani ◽  
Sotiris C. Masmanidis

As the major input to the basal ganglia, the striatum is innervated by a wide range of other areas. Overlapping input from these regions is speculated to influence temporal correlations among striatal ensembles. However, the network dynamics among behaviorally related neural populations in the striatum has not been extensively studied. We used large-scale neural recordings to monitor activity from striatal ensembles in mice undergoing Pavlovian reward conditioning. A subpopulation of putative medium spiny projection neurons (MSNs) was found to discriminate between cues that predicted the delivery of a reward and cues that predicted no specific outcome. These cells were preferentially located in lateral subregions of the striatum. Discriminating MSNs were more spontaneously active and more correlated than their nondiscriminating counterparts. Furthermore, discriminating fast spiking interneurons (FSIs) represented a highly prevalent group in the recordings, which formed a strongly correlated network with discriminating MSNs. Spike time cross-correlation analysis showed the existence of synchronized activity among FSIs and feedforward inhibitory modulation of MSN spiking by FSIs. These findings suggest that populations of functionally specialized (cue-discriminating) striatal neurons have distinct network dynamics that sets them apart from nondiscriminating cells, potentially to facilitate accurate behavioral responding during associative reward learning.


Sign in / Sign up

Export Citation Format

Share Document