首页> 美国卫生研究院文献>Frontiers in Computational Neuroscience >Modern Machine Learning as a Benchmark for Fitting Neural Responses
【2h】

Modern Machine Learning as a Benchmark for Fitting Neural Responses

机译:现代机器学习作为适应神经反应的基准

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Neuroscience has long focused on finding encoding models that effectively ask “what predicts neural spiking?” and generalized linear models (GLMs) are a typical approach. It is often unknown how much of explainable neural activity is captured, or missed, when fitting a model. Here we compared the predictive performance of simple models to three leading machine learning methods: feedforward neural networks, gradient boosted trees (using XGBoost), and stacked ensembles that combine the predictions of several methods. We predicted spike counts in macaque motor (M1) and somatosensory (S1) cortices from standard representations of reaching kinematics, and in rat hippocampal cells from open field location and orientation. Of these methods, XGBoost and the ensemble consistently produced more accurate spike rate predictions and were less sensitive to the preprocessing of features. These methods can thus be applied quickly to detect if feature sets relate to neural activity in a manner not captured by simpler methods. Encoding models built with a machine learning approach accurately predict spike rates and can offer meaningful benchmarks for simpler models.
机译:神经科学长期以来一直致力于寻找有效询问“神经突刺的预测是什么?”的编码模型。广义线性模型(GLM)是一种典型的方法。拟合模型时,通常会捕获或错过多少可解释的神经活动,这一点通常是未知的。在这里,我们将简单模型的预测性能与三种领先的机器学习方法进行了比较:前馈神经网络,梯度提升树(使用XGBoost)和组合了几种方法的预测的堆叠合奏。我们从达到运动学的标准表示中预测了猕猴运动(M1)和体感(S1)皮质中的尖峰计数,并从开阔地域的位置和方向预测了大鼠海马细胞的峰值计数。在这些方法中,XGBoost和合奏始终生成更准确的峰值率预测,并且对特征的预处理不那么敏感。因此,这些方法可以快速应用,以较简单的方法无法捕获的方式检测特征集是否与神经活动有关。使用机器学习方法构建的编码模型可以准确地预测峰值速率,并且可以为更简单的模型提供有意义的基准。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号