Implementing matching priors for frequentist inference
利用匹配先验实现频率学派推断AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:核心是通用干扰参数消除与匹配先验理论,应用示例不足以确定某个经济计量细分方向。
利用匹配先验实现频率学派推断AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Nuisance parameters do not pose any problems in Bayesian inference as marginalisation allows for study of the posterior distribution solely in terms of the parameter of interest. However, no general solution is available for removing nuisance parameters under the frequentist paradigm. In this paper, we merge the two approaches to construct a general procedure for frequentist elimination of nuisance parameters through the use of matching priors. In particular, we perform Bayesian marginalisation with respect to a prior distribution under which posterior inferences have approximate frequentist validity. Matching priors are constructed as solutions to a partial differential equation. Unfortunately, except in simple cases, these partial differential equations do not yield to analytical nor even standard numerical methods of solution. We present a numerical/Monte Carlo algorithm for obtaining the matching prior, in general, as a solution to the appropriate partial differential equation and draw posterior inferences. To be specific, we develop an automated routine through an implementation of the Metropolis–Hastings algorithm for deriving frequentist valid inferences via the matching prior. We illustrate our results in the contexts of fitting random effects models, fitting logistic regression models and fitting teratological data by beta‐binomial models.