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

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

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

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

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

分类依据与纠错

AI 根据所提供的论文材料归类:摘要明确研究二元响应的 probit 回归,直接对应离散选择方向常用模型的估计方法。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

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

关注这篇论文的作者
Augusto Fasano
Daniele Durante
Giacomo Zanella

高维二元回归中可扩展且准确的变分贝叶斯方法

研究问题
在高维 probit 回归中,常用均值场变分贝叶斯会如何影响后验近似,能否同时改善近似精度与计算可扩展性?
方法与思路
作者分析高斯先验下均值场近似的偏差,提出仅对局部变量因子化的后验近似,并推导坐标上升变分推断算法。
材料陈述的贡献
摘要称,新近似属于统一偏斜正态分布族,在所研究框架中随维数增长趋近精确后验,算法也具有有利的迭代性质。
阅读关注点
应核对维数趋于无穷时样本量与设计的设定、后验收敛的度量、局部变量定义,以及迭代次数趋于一的条件与判据。
阅读边界
仅依据所给 Crossref 摘要;摘要未列出渐近结论的完整条件,不能据此保证任意二元模型或任意维数下均有相同优势。

原文摘要

Summary Modern methods for Bayesian regression beyond the Gaussian response setting are often computationally impractical or inaccurate in high dimensions. In fact, as discussed in recent literature, bypassing such a trade-off is still an open problem even in routine binary regression models, and there is limited theory on the quality of variational approximations in high-dimensional settings. To address this gap, we study the approximation accuracy of routinely used mean-field variational Bayes solutions in high-dimensional probit regression with Gaussian priors, obtaining novel and practically relevant results on the pathological behaviour of such strategies in uncertainty quantification, point estimation and prediction. Motivated by these results, we further develop a new partially factorized variational approximation for the posterior distribution of the probit coefficients that leverages a representation with global and local variables but, unlike for classical mean-field assumptions, it avoids a fully factorized approximation, and instead assumes a factorization only for the local variables. We prove that the resulting approximation belongs to a tractable class of unified skew-normal densities that crucially incorporates skewness and, unlike for state-of-the-art mean-field solutions, converges to the exact posterior density as $p \rightarrow \infty$. To solve the variational optimization problem, we derive a tractable coordinate ascent variational inference algorithm that easily scales to $p$ in the tens of thousands, and provably requires a number of iterations converging to $1$ as $p \rightarrow \infty$. Such findings are also illustrated in extensive empirical studies where our novel solution is shown to improve the approximation accuracy of mean-field variational Bayes for any $n$ and $p$, with the magnitude of these gains being remarkable in those high-dimensional $p>n$ settings where state-of-the-art methods are computationally impractical.

笔记与分组