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

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

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

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

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

分类依据与纠错

AI 根据所提供的论文材料归类:摘要研究空间高斯过程与非参数回归,稀疏依赖图本身不足以归入经济网络与干扰方向。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

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

关注这篇论文的作者
Botond Szabo
Yichen Zhu

Vecchia 高斯过程的概率与统计性质

研究问题
如何为各向同性 Matérn 高斯过程的 Vecchia 近似建立理论基础,并选择稀疏依赖图中的父节点集合?
方法与思路
作者以固定基数的赋范集选择父节点,利用多项式插值刻画条件分布,再研究小球概率、再生核希尔伯特空间和后验收缩。
材料陈述的贡献
摘要称,在非参数回归中,所构造先验经理想重缩放或层级调节均可达到最优极小极大收缩率,并提供数值实验和程序实现。
阅读关注点
应核对赋范集与观测设计的条件、Matérn 参数范围、两类先验调节方式,以及理论收缩率与计算复杂度的具体关系。
阅读边界
仅据所给 Crossref 摘要;最优收缩率的具体条件与算法复杂度未说明,不能据此断言任意 Vecchia 图结构均有这些性质。

原文摘要

Gaussian Processes (GPs) are widely used to model dependencies in spatial statistics and machine learning. However, exact inference is computationally intractable for GP regression, with a time complexity of O(n3). The Vecchia approximation scales up computation by introducing sparsity into the spatial dependency structure, represented by a directed acyclic graph (DAG). Despite its practical popularity, this approach lacks rigorous theoretical foundations, and the choice of DAG structure remains an open problem. In this paper, we systematically study the Vecchia approximation of the popular, isotropic Matérn GP as standalone stochastic process and uncover key probabilistic and statistical properties. We propose selecting parent sets as norming sets with fixed cardinality in the Vecchia approximation. On the probabilistic side, we show that the conditional distributions of Matérn GPs, as well as their Vecchia approximations, can be characterized by polynomial interpolations. This enables us to establish several results on small ball probabilities and the Reproducing Kernel Hilbert Spaces (RKHSs) of Vecchia GPs. Building on these probabilistic results, we prove that in the nonparametric regression model, the corresponding posterior contracts around the truth at the optimal minimax rate, both under oracle rescaling and hierarchical tuning of the prior. We illustrate the theoretical findings through numerical experiments on synthetic datasets. Our core algorithms are implemented in C++ with an R interface.

笔记与分组
相关领域论文