Conjugate Generalized Bayesian Inference for Discrete Doubly Intractable Problems
离散双重难解问题的共轭广义贝叶斯推断AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要明确将离散自回归时间序列模型列为方法评估对象。
离散双重难解问题的共轭广义贝叶斯推断AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Doubly intractable problems occur when both the likelihood and the posterior are available only in unnormalized form, with computationally intractable normalization constants. Bayesian inference then typically requires direct approximation of the posterior through specialized and typically expensive MCMC methods. In this paper, we provide a computationally efficient alternative in the form of a novel generalized Bayesian posterior that allows for conjugate, closed-form or Gibbs-based MCMC inference within the class of exponential family models for discrete data. We derive theoretical guarantees to characterize the asymptotic behavior of the generalized posterior, supporting its use for inference. The method is evaluated on a range of challenging intractable exponential family models, including the Conway-Maxwell-Poisson graphical model of multivariate count data, autoregressive discrete time series models, and Markov random fields such as the Ising and Potts models. The computational gains are significant; in our experiments, the method is between 10 and 6000 times faster than state-of-the-art Bayesian computational methods.