Some theoretical results on neural spike train probability models
神经脉冲序列概率模型的若干理论结果AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要聚焦神经脉冲点过程,未提供将其归入宏观时间序列或金融高频计量的充分依据。
神经脉冲序列概率模型的若干理论结果AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
This article contains two main theoretical results on neural spike train models, using the counting or point process on the real line as a model for the spike train. The first part of this article considers template matching of multiple spike trains. P-values for the occurrences of a given template or pattern in a set of spike trains are computed using a general scoring system. By identifying the pattern with an experimental stimulus, multiple spike trains can be deciphered to provide useful information. The second part of the article assumes that the counting process has a conditional intensity function that is a product of a free firing rate function s, which depends only on the stimulus, and a recovery function r, which depends only on the time since the last spike. If s and r belong to a q-smooth class of functions, it is proved that sieve maximum likelihood estimators for s and r achieve the optimal convergence rate (except for a logarithmic factor) under L1 loss.