Bayesian Representation of Stochastic Processes under Learning: de Finetti Revisited
学习下随机过程的贝叶斯表示:重访 de Finetti 定理AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论一般随机过程的贝叶斯表示与预测充分性,未限定宏观时间序列或金融预测应用,因此不足以匹配给定细分。
学习下随机过程的贝叶斯表示:重访 de Finetti 定理AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
A probability distribution governing the evolution of a stochastic process has infinitely many Bayesian representations of the form mu = integral operator [subscript theta] mu[subscript theta] delta lambda (theta). Among these, a natural representation is one whose components (mu[subscript theta]'s) are 'learnable' (one can approximate mu[subscript theta] by conditioning mu on observation of the process) and 'sufficient for prediction' (mu[subscript theta]'s predictions are not aided by conditioning on observation of the process). The authors show the existence and uniqueness of such a representation under a suitable asymptotic mixing condition on the process. This representation can be obtained by conditioning on the tail-field of the process, and any learnable representation that is sufficient for prediction is asymptotically like the tail-field representation. This result is related to the celebrated de Finetti theorem, but with exchangeability weakened to an asymptotic mixing condition, and with his conclusion of a decomposition into i.i.d. component distributions weakened to components that are learnable and sufficient for prediction.