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

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

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

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

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

分类依据与纠错

AI 根据所提供的论文材料归类:摘要列举多种通用统计模型,状态空间只是适用模型之一,未明确聚焦宏观或金融领域。

反馈分类问题

Approximate Bayesian Inference for Latent Gaussian models by using Integrated Nested Laplace Approximations

利用积分嵌套拉普拉斯近似进行潜在高斯模型的近似贝叶斯推断

正在核对关联版本…

代码、数据与补充材料

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

关注这篇论文的作者
Håvard Rue
Sara Martino
Nicolas Chopin

利用积分嵌套拉普拉斯近似进行潜在高斯模型的近似贝叶斯推断

研究问题
对于具有少量超参数、高斯潜在场和非高斯响应的模型,如何快速计算后验边际并支持模型比较与预测评估?
方法与思路
作者使用积分嵌套拉普拉斯近似及其简化版本直接近似后验边际,并将其与 MCMC 的计算和收敛困难比较。
材料陈述的贡献
摘要称,该方法可准确且快速地近似后验边际,支持自动化贝叶斯分析,并计算模型比较准则和预测指标。
阅读关注点
应核对嵌套近似的各层构造、潜在场结构、超参数维度,以及精度与运行时间比较采用的模型和计算配置。
阅读边界
仅据 Crossref 摘要,无法核实计算优势的测试范围;不能将摘要所述速度和精度表现推广到所有潜在高斯模型。

原文摘要

Summary Structured additive regression models are perhaps the most commonly used class of models in statistical applications. It includes, among others, (generalized) linear models, (generalized) additive models, smoothing spline models, state space models, semiparametric regression, spatial and spatiotemporal models, log-Gaussian Cox processes and geostatistical and geoadditive models. We consider approximate Bayesian inference in a popular subset of structured additive regression models, latent Gaussian models, where the latent field is Gaussian, controlled by a few hyperparameters and with non-Gaussian response variables. The posterior marginals are not available in closed form owing to the non-Gaussian response variables. For such models, Markov chain Monte Carlo methods can be implemented, but they are not without problems, in terms of both convergence and computational time. In some practical applications, the extent of these problems is such that Markov chain Monte Carlo sampling is simply not an appropriate tool for routine analysis. We show that, by using an integrated nested Laplace approximation and its simplified version, we can directly compute very accurate approximations to the posterior marginals. The main benefit of these approximations is computational: where Markov chain Monte Carlo algorithms need hours or days to run, our approximations provide more precise estimates in seconds or minutes. Another advantage with our approach is its generality, which makes it possible to perform Bayesian analysis in an automatic, streamlined way, and to compute model comparison criteria and various predictive measures so that models can be compared and the model under study can be challenged.

笔记与分组
相关领域论文