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 条
  • [31] Algorithmic randomness over general spaces
    Miyabe, Kenshi
    MATHEMATICAL LOGIC QUARTERLY, 2014, 60 (03) : 184 - 204
  • [32] SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS
    Bienvenu, Laurent
    Csima, Barbara E.
    Harrison-Trainor, Matthew
    JOURNAL OF SYMBOLIC LOGIC, 2021, 86 (04) : 1612 - 1631
  • [33] The maximum entropy principle and algorithmic randomness
    Maslov, VP
    V'yugin, VV
    DOKLADY MATHEMATICS, 2004, 70 (02) : 682 - 685
  • [34] RANDOMNESS IN VISUAL IDENTITY: ALGORITHMIC APPROACH
    Pisklakov, Pavel
    SGEM 2016, BK 4: ARTS, PERFORMING ARTS, ARCHITECTURE AND DESIGN CONFERENCE PROCEEDINGS, VOL III, 2016, : 451 - 456
  • [35] Las Vegas Computability and Algorithmic Randomness
    Brattka, Vasco
    Gherardi, Guido
    Hoelzl, Rupert
    32ND INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2015), 2015, 30 : 130 - 142
  • [36] ALGORITHMIC COMPLEXITY AND RANDOMNESS - RECENT DEVELOPMENTS
    SHEN, A
    THEORY OF PROBABILITY AND ITS APPLICATIONS, 1992, 37 (01) : 92 - 97
  • [37] ALGORITHMIC RANDOMNESS AND CAPACITY OF CLOSED SETS
    Brodhead, Paul
    Cenzer, Douglas
    Toska, Ferit
    Wyman, Sebastian
    LOGICAL METHODS IN COMPUTER SCIENCE, 2011, 7 (03)
  • [38] ON CONNECTIONS BETWEEN DIFFERENT ALGORITHMIC DEFINITIONS OF RANDOMNESS
    SHEN, AK
    DOKLADY AKADEMII NAUK SSSR, 1988, 302 (03): : 548 - 552
  • [39] Ergodic-Type Characterizations of Algorithmic Randomness
    Bienvenu, Laurent
    Day, Adam
    Mezhirov, Ilya
    Shen, Alexander
    PROGRAMS, PROOFS, PROCESSES, 2010, 6158 : 49 - +
  • [40] Algorithmic tests and randomness with respect to a class of measures
    Laurent Bienvenu
    Peter Gács
    Mathieu Hoyrup
    Cristobal Rojas
    Alexander Shen
    Proceedings of the Steklov Institute of Mathematics, 2011, 274 : 34 - 89