大规模Lasso,带窗口活动集,用于卷积尖峰排序
Large scale Lasso with windowed active set for convolutional spike sorting
摘要:
棘波分类是神经科学中的一个基本预处理步骤,它对于获得同时但不同的神经元活动至关重要,因此可以更好地了解动物甚至人类的大脑。但是数值复杂性限制了需要处理大规模数据集的研究,这些数据集涉及电极、神经元、尖峰和记录信号的长度。在这项工作中,我们提出了一种新的活动集算法,旨在解决经典卷积模型的套索。我们的算法可以有效地实现在并行结构上,并具有线性复杂度w.r.t.时间维度确保了缩放,并将打开在线尖峰排序的大门。我们提供的算法的复杂性的理论结果,并说明它在数值实验中的尖峰恢复的准确性和鲁棒性的正则化参数的结果。
英文摘要:
Spike sorting is a fundamental preprocessing step in neuroscience that is central to access simultaneous but distinct neuronal activities and therefore to better understand the animal or even human brain. But numerical complexity limits studies that require processing large scale datasets in terms of number of electrodes, neurons, spikes and length of the recorded signals. We propose in this work a novel active set algorithm aimed at solving the Lasso for a classical convolutional model. Our algorithm can be implemented efficiently on parallel architecture and has a linear complexity w.r.t. the temporal dimensionality which ensures scaling and will open the door to online spike sorting. We provide theoretical results about the complexity of the algorithm and illustrate it in numerical experiments along with results about the accuracy of the spike recovery and robustness to the regularization parameter.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。