跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:材料讨论通用神经网络建模与筛选,没有明确对应所列计量应用方向。

反馈分类问题

Gilbert MacKenzie’s contribution to the Discussion of ‘the Discussion Meeting on Probabilistic and statistical aspects of machine learning’

Gilbert MacKenzie 对机器学习概率与统计讨论会的评论

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Gilbert MacKenzie

Gilbert MacKenzie 对机器学习概率与统计讨论会的评论

研究问题
评论关注前馈神经网络的过度参数化,讨论如何用概率模型评估参数不确定性,并通过模型筛选获得更简约的网络。
方法与思路
评论介绍高斯非线性回归与似然框架,使用 BIC 进行后向筛选,依次削减隐藏节点、选择输入变量并作最终调整。
材料陈述的贡献
评论称已有分析在部分情形下以约一半参数取得可比表现,并指出协方差估计可支持结构检验;这些属于早期工作陈述。
阅读关注点
应核对被评论论文与所引研究的关系、信息矩阵非奇异的条件,以及 BIC 筛选、预测比较和参数不确定性评估的依据。
阅读边界
这是讨论评论,不能冒充主论文;索引版本未注明,材料存在符号不一致及公式缺失,需查原 PDF,复杂网络的适用性尚未说明。

原文摘要

I would like first to congratulate both authors on presenting their very stimulating work in the spirit of the conference’s theme of statisticians and machine learners working in alliance. There is no doubt in my mind that collaboration will lead to better, more parsimonious, models. My comments relate, mainly, to the second discussant’s points on over-parametrization. If a feed-forward neural net (Ripley, 1994) is denoted by Net(x,θ)⁠, where x is the input layer and ϕ is the defining parameter vector, colleagues, in the University of Limerick, cast the problem in a standard non-linear regression mould, thus: where ϵi∼N(0,σ2) (McInerney & Burke, 2022a). This leads to standard Gaussian loge likelihood, ℓ(θ)⁠, for inference (here θ represents the collection of all net parameters to be estimated). Standard theory leads to θ^∼N(θ,Σ) where Σ^=Io(θ^)−1⁠, where Io(θ^) is the observed, positive definite, information matrix, whence the uncertainty in θ can be assessed. Some care is required to avoid the singularities in Σ^ caused by over-fitting, e.g. when dealing with redundant nodes. Given this probability model and its likelihood function, the model space is searched using the Bayesian information criterion. The choice of Bayesian information criterion, rather than the conventional out-of-sample performance criterion for model selection, leads to an increased probability of recovering the true (more parsimonious) model with comparable, or better, out-of-sample performance. A three-stage, backwards, model selection strategy is employed: it first reduces the number of hidden nodes (architectural pruning), then inputs (variable selection), and ends with a final adjustment (fine-tuning). The availability of the variance–covariance matrix opens up opportunities to (a) frame the output of the neural net analysis in a more familiar, regression-like, format and (b) test for the existence of known or hypothetical structures in the data, for example, as in genetic analysis. There are also other modelling opportunities. Analyses carried out to date are promising; in some cases, comparable performance is obtained with half of the parameters required by the standard neural net. This work is at an early stage and the neural nets studied so far are less complicated than those discussed today. However, as the project progresses (McInerney & Burke, 2022b), it aims to cover the neural net piste. Meanwhile, we must not overlook the unresolved problem of ‘explanation’.

笔记与分组
相关领域论文