Algorithmic Randomness, Bayesian Convergence and Merging

被引:0
|
作者
Huttegger, Simon [1 ]
Walsh, Sean [2 ]
Blando, Francesca Zaffora [3 ]
机构
[1] Univ Calif Irvine, Irvine, CA 92697 USA
[2] Univ Calif Los Angeles, Los Angeles, CA USA
[3] Carnegie Mellon Univ, Pittsburgh, PA USA
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Convergence-to-the-truth results and merging-of-opinions results are part of the basic toolkit of Bayesian epistemologists. In a nutshell, the former establish that Bayesian agents expect their beliefs to almost surely converge to the truth as the evidence accumulates. The latter, on the other hand, establish that, as they make more and more observations, two Bayesian agents with different subjective priors are guaranteed to almost surely reach inter-subjective agreement, provided that their priors are sufficiently compatible. While in and of themselves significant, convergence to the truth with probability one and merging of opinions with probability one remain somewhat elusive notions. In their classical form, these results do not specify which data streams belong to the probability-one set of sequences on which convergence to the truth or merging of opinions occurs. In particular, they do not reveal whether the data streams that ensure eventual convergence or merging share any property that might explain their conduciveness to successful learning. Thus, a natural question raised by these classical results is whether the kind of data streams that are conducive to convergence and merging for Bayesian agents are uniformly characterizable in an informative way.
引用
收藏
页码:211 / 211
页数:1
相关论文
共 50 条
  • [1] Algorithmic Randomness, Bayesian Convergence and Merging
    Huttegger, Simon
    Walsh, Sean
    Blando, Francesca Zaffora
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2021, (335): : 211 - 211
  • [2] Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
    Avigad, Jeremy
    Dean, Edward T.
    Rute, Jason
    ANNALS OF PURE AND APPLIED LOGIC, 2012, 163 (12) : 1854 - 1864
  • [3] Algorithmic Randomness
    Downey, Rod
    Hirschfeldt, Denis R.
    COMMUNICATIONS OF THE ACM, 2019, 62 (05) : 70 - 80
  • [4] ALGORITHMIC RANDOMNESS FOR DOOB'S MARTINGALE CONVERGENCE THEOREM IN CONTINUOUS TIME
    Kjos-Hanssen, Bjorn
    Nguyen, Paul Kim Long V.
    Rute, Jason M.
    LOGICAL METHODS IN COMPUTER SCIENCE, 2014, 10 (04)
  • [5] Quantum algorithmic randomness
    Bhojraj, Tejas
    JOURNAL OF MATHEMATICAL PHYSICS, 2020, 62 (02)
  • [6] Algorithmic complexity and randomness
    Partovi, AH
    BAYESIAN INFERENCE AND MAXIMUM ENTROPY METHODS IN SCIENCE AND ENGINEERING, PT 2, 2001, 568 : 31 - 37
  • [7] PROBABILISTIC ALGORITHMIC RANDOMNESS
    Buss, Sam
    Minnes, Mia
    JOURNAL OF SYMBOLIC LOGIC, 2013, 78 (02) : 579 - 601
  • [8] Cryptography and Algorithmic Randomness
    Tadaki, Kohtaro
    Doi, Norihisa
    THEORY OF COMPUTING SYSTEMS, 2015, 56 (03) : 544 - 580
  • [9] Cryptography and Algorithmic Randomness
    Kohtaro Tadaki
    Norihisa Doi
    Theory of Computing Systems, 2015, 56 : 544 - 580
  • [10] Experimentally probing the algorithmic randomness and incomputability of quantum randomness
    Abbott, Alastair A.
    Calude, Cristian S.
    Dinneen, Michael J.
    Huang, Nan
    PHYSICA SCRIPTA, 2019, 94 (04)