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 条
  • [41] Algorithmic randomness and monotone complexity on product space
    Takahashi, Hayato
    INFORMATION AND COMPUTATION, 2011, 209 (02) : 183 - 197
  • [42] Machine-learning applications of algorithmic randomness
    Vovk, V
    Gammerman, A
    Saunders, C
    MACHINE LEARNING, PROCEEDINGS, 1999, : 444 - 453
  • [43] Sequential Bidding for Merging in Algorithmic Traffic
    Markakis, Mihalis G.
    Talluri, Kalyan
    Tikhonenko, Dmitrii
    M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT, 2022, 25 (01) : 168 - 181
  • [44] Algorithmic tests and randomness with respect to a class of measures
    Bienvenu, Laurent
    Gacs, Peter
    Hoyrup, Mathieu
    Rojas, Cristobal
    Shen, Alexander
    PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2011, 274 (01) : 34 - 89
  • [45] Normal numbers and algorithmic randomness: a historical sketch
    Arvind, V.
    CURRENT SCIENCE, 2014, 106 (12): : 1687 - 1692
  • [46] ALGORITHMIC BAYESIAN PERSUASION
    Dughmi, Shaddin
    Xu, Haifeng
    SIAM JOURNAL ON COMPUTING, 2021, 50 (03)
  • [47] Algorithmic Bayesian Persuasion
    Dughmi, Shaddin
    Xu, Haifeng
    STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2016, : 412 - 425
  • [48] Strong entropy concentration, game theory and algorithmic randomness
    Grünwald, P
    COMPUTATIONAL LEARNING THEORY, PROCEEDINGS, 2001, 2111 : 320 - 336
  • [49] Uniform test of algorithmic randomness over a general space
    Gács, P
    THEORETICAL COMPUTER SCIENCE, 2005, 341 (1-3) : 91 - 137
  • [50] Algorithmic Randomness in Continuous-Time Markov Chains
    Huang, Xiang
    Lutz, Jack H.
    Migunov, Andrei N.
    2019 57TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2019, : 615 - 622