Subjective randomness as statistical inference

Some events seem more random than others. For example, when tossing a coin, a sequence of eight heads in a row does not seem very random. Where do these intuitions about randomness come from? We argue that subjective randomness can be understood as the result of a statistical inference assessing the evidence that an event provides for having been produced by a random generating process. We show how this account provides a link to previous work relating randomness to algorithmic complexity, in which random events are those that cannot be described by short computer programs. Algorithmic complexity is both incomputable and too general to capture the regularities that people can recognize, but viewing randomness as statistical inference provides two paths to addressing these problems: considering regularities generated by simpler computing machines, and restricting the set of probability distributions that characterize regularity. Building on previous work exploring these different routes to a more restricted notion of randomness, we define strong quantitative models of human randomness judgments that apply not just to binary sequences - which have been the focus of much of the previous work on subjective randomness - but also to binary matrices and spatial clustering.

[1]  Charles F. Hockett,et al.  A mathematical theory of communication , 1948, MOCO.

[2]  A. Tversky,et al.  Subjective Probability: A Judgment of Representativeness , 1972 .

[3]  A D Baddeley,et al.  The Capacity for Generating Information by Randomization , 1966, The Quarterly journal of experimental psychology.

[4]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences: statistical considerations , 1969, JACM.

[5]  Lola L. Lopes Doing the impossible: A note on induction and the experience of randomness. , 1982 .

[6]  Jean-Paul Delahaye,et al.  Algorithmic complexity for short binary strings applied to psychology: a primer , 2011, Behavior Research Methods.

[7]  J. Feldman A catalog of Boolean concepts , 2003 .

[8]  M. Kac,et al.  WHAT IS RANDOM , 1983 .

[9]  Jean-Paul Delahaye,et al.  Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness , 2011, Appl. Math. Comput..

[10]  S. Wiegersma,et al.  Can repetition avoidance in randomization be explained by randomness concepts? , 1982 .

[11]  William P. Dunlap,et al.  The rules used by children and adults in attempting to generate random numbers*1 , 1989 .

[12]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[13]  Clifford Konold,et al.  Making Sense of Randomness " Implicit Encoding as a Basis for Judgment , 1997 .

[14]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[15]  Wolfram,et al.  Origins of randomness in physical systems. , 1985, Physical review letters.

[16]  W. Wagenaar,et al.  The perception of randomness , 1991 .

[17]  David V. Budescu,et al.  A Markov model for generation of random binary sequences. , 1987 .

[18]  Ethan L. Schreiber,et al.  Subjective randomness and natural scene statistics , 2010, Psychonomic bulletin & review.

[19]  N. Chater The Search for Simplicity: A Fundamental Cognitive Principle? , 1999 .

[20]  Yaakov Kareev,et al.  Not that bad after all : generation of random sequences , 1992 .

[21]  Lola L. Lopes,et al.  Distinguishing between random and nonrandom events. , 1987 .

[22]  R. Nickerson,et al.  The production and perception of randomness. , 2002, Psychological review.

[23]  A. Kolmogorov Three approaches to the quantitative definition of information , 1968 .

[24]  D. Osherson,et al.  Perception and identification of random events. , 2014, Journal of experimental psychology. Human perception and performance.

[25]  John R. Anderson The Adaptive Character of Thought , 1990 .

[26]  R. D. Clarke,et al.  An application of the Poisson distribution , 1946 .

[27]  J. Feldman How surprising is a simple pattern? Quantifying “Eureka!” , 2004, Cognition.

[28]  Noam Chomsky,et al.  A Review of B. F. Skinner's Verbal Behavior , 1980 .

[29]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[30]  J. Tenenbaum,et al.  From mere coincidences to meaningful discoveries , 2007, Cognition.

[31]  A. Neuringer Can people behave "randomly?": The role of feedback. , 1986 .

[32]  B. Skinner The processes involved in the repeated guessing of alternatives. , 1942 .

[33]  Thomas L. Griffiths,et al.  Testing the Efficiency of Markov Chain Monte Carlo With People Using Facial Affect Categories , 2012, Cogn. Sci..

[34]  Yaakov Kareev,et al.  Positive bias in the perception of covariation. , 1995 .

[35]  A. Tversky,et al.  Judgment under Uncertainty: Heuristics and Biases , 1974, Science.

[36]  Jean-Paul Delahaye,et al.  Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines , 2012, PloS one.

[37]  Jacob Feldman,et al.  Minimization of Boolean complexity in human concept learning , 2000, Nature.

[38]  V. Johnson Studying Convergence of Markov Chain Monte Carlo Algorithms Using Coupled Sample Paths , 1996 .

[39]  R. Solomon,et al.  A note on the alternation of guesses. , 1949, Journal of experimental psychology.

[40]  Hinrich Schütze,et al.  Book Reviews: Foundations of Statistical Natural Language Processing , 1999, CL.

[41]  Ulrike Hahn,et al.  Perceptions of randomness: why three heads are better than four. , 2009, Psychological review.

[42]  A. Turing On computable numbers, with an application to the Entscheidungsproblem , 1937, Proc. London Math. Soc..

[43]  Y. Kareev Through a narrow window: working memory capacity and the detection of covariation , 1995, Cognition.

[44]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[45]  Adam N. Sanborn,et al.  Uncovering mental representations with Markov chain Monte Carlo , 2010, Cognitive Psychology.

[46]  Hector Zenil,et al.  Algorithmic complexity for psychology: a user-friendly implementation of the coding theorem method , 2016, Behavior research methods.

[47]  T. Griffiths,et al.  Why are people bad at detecting randomness? A statistical argument. , 2013, Journal of experimental psychology. Learning, memory, and cognition.

[48]  G. Spencer-Brown Probability and scientific inference , 1957 .

[49]  Hans Reichenbach,et al.  The theory of probability , 1968 .

[50]  G. Schwarz Estimating the Dimension of a Model , 1978 .

[51]  W. A. Wagenaar Generation of random sequences by human subjects: A critical survey of literature. , 1972 .

[52]  G. S. Tune RESPONSE PREFERENCES: A REVIEW OF SOME RELEVANT LITERATURE. , 1964, Psychological bulletin.