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

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

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

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

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

分类依据与纠错

AI 根据所提供的论文材料归类:摘要以通用风险最小化与稳健贝叶斯推断为核心,分位数回归仅为例示,不足以归入特定经济计量细分。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

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

关注这篇论文的作者
Rong Tang
Yun Yang

基于指数倾斜经验似然的风险最小化贝叶斯推断

研究问题
在模型误设或仅部分指定时,如何围绕风险最小化目标进行贝叶斯推断,使可信区域具有相应的频率学覆盖性质?
方法与思路
作者将经验风险最小化的一阶最优条件作为矩条件,以带正则项的指数倾斜经验似然替代原似然,并结合先验和 MCMC。
材料陈述的贡献
摘要称,所得后验渐近接近以经验风险最小化解为中心、具有三明治协方差的正态分布,从而校准可信区域。
阅读关注点
应核对风险函数和矩条件的要求、正则项及先验的作用、后验正态近似条件,以及数值比较采用的误差指标和场景。
阅读边界
仅据所给 Crossref 摘要,无法判断非光滑问题及有限样本覆盖的完整边界;数值优势是作者报告,摘要未提供比较细节。

原文摘要

Abstract The celebrated Bernstein von-Mises theorem ensures credible regions from a Bayesian posterior to be well-calibrated when the model is correctly-specified, in the frequentist sense that their coverage probabilities tend to the nominal values as data accrue. However, this conventional Bayesian framework is known to lack robustness when the model is misspecified or partly specified, for example, in quantile regression, risk minimization based supervised/unsupervised learning and robust estimation. To alleviate this limitation, we propose a new Bayesian inferential approach that substitutes the (misspecified or partly specified) likelihoods with proper exponentially tilted empirical likelihoods plus a regularization term. Our surrogate empirical likelihood is carefully constructed by using the first-order optimality condition of empirical risk minimization as the moment condition. We show that the Bayesian posterior obtained by combining this surrogate empirical likelihood and a prior is asymptotically close to a normal distribution centering at the empirical risk minimizer with an appropriate sandwich-form covariance matrix. Consequently, the resulting Bayesian credible regions are automatically calibrated to deliver valid uncertainty quantification. Computationally, the proposed method can be easily implemented by Markov Chain Monte Carlo sampling algorithms. Our numerical results show that the proposed method tends to be more accurate than existing state-of-the-art competitors.

笔记与分组
相关领域论文