Recent progress on conditional randomness
Hayato Takahashi

TL;DR
This paper reviews recent advances in the study of ML-randomness conditioned on probabilities, highlighting a new result that generalizes previous work for mutually singular measures.
Contribution
It introduces a novel result on conditional randomness with respect to mutually singular probabilities, extending Hanssen's 2010 findings for Bernoulli processes.
Findings
New result on conditional randomness for mutually singular probabilities
Generalization of Hanssen's 2010 result for Bernoulli processes
Advances in understanding ML-randomness with respect to conditional measures
Abstract
In this article, recent progress on ML-randomness with respect to conditional probabilities is reviewed. In particular a new result of conditional randomness with respect to mutually singular probabilities are shown, which is a generalization of Hanssen's result (2010) for Bernoulli processes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Algorithms and Data Compression · Machine Learning and Algorithms
Probability Symposium, RIMS Workshop
Dec. 19-22, 2016
Recent progress on conditional randomness
Hayato Takahashi111 [email protected]
This work was done when the author was with Gifu University and supported by KAKENHI (24540153).
The set of Hippocratic random sequences w.r.t. is defined as the compliment of the effective null sets w.r.t. and denote it by . In particular if is computable it is called Martin-Löf random sequences.
Lambalgen’s theorem (1987) [9] says that a pair of sequences is Martin-Löf (ML) random w.r.t. the product of uniform measures iff is ML-random and is ML-random relative to , where is the set of infinite binary sequences. In [10, 5, 6, 7], generalized Lambalgen’s theorem is studied for computable correlated probabilities.
Let be the set of finite binary strings and for , where is the concatenation of and . Let and be a computable probability on . and are marginal distribution on and , respectively. In the following we write and for .
Let be the set of ML-random points and . In [5, 6], it is shown that conditional probabilities exist for all random parameters, i.e.,
[TABLE]
and is a probability on for each .
Let be the set of Hippocratic random sequences w.r.t. with oracle .
Theorem 1** **([5, 6, 7])
Let be a computable probability on . Then
[TABLE]
Fix and suppose that is computable with oracle . Then
[TABLE]
It is known that there is a non-computable conditional probabilities [4] and in [2] Bauwens showed an example that violates the equality in (2) when the conditional probability is not computable with oracle . In [8], an example that for all , the conditional probabilities are not computable with oracle and (2) holds. A survey on the randomness for conditional probabilities is shown in [1].
Next we study mutually singular conditional probabilities. In [3], Hanssen showed that for Bernoulli model ,
[TABLE]
We generalize Hanssen’s theorem (3) for mutually singular conditional probabilities. In [5, 7], equivalent conditions for mutually singular conditional probabilities are shown.
Theorem 2** **([5, 7])
*Let be a computable probability on , where . The following six statements are equivalent:
(1) if for .
(2) if for .
(3) converges weakly to as for , where is the probability that has probability of 1 at .
(4) if .
(5) There exists such that for .
(6) There exists and such that and for .*
Generalized form of Hanssen’s theorem (3) is as follows.
Theorem 3
Let be a computable probability on , where . Under one of the condition of Theorem 2, we have
[TABLE]
Fix and suppose that is computable with oracle . Then
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] B. Bauwens, A. Shen, and H. Takahashi. Conditional probabilities and van Lambalgen theorem revisited. arxiv:1607.04240, 2016.
- 2[2] Bruno Bauwens. Conditional measure and the violation of van Lambalgen’s theorem for Martin-löf randomness. http://arxiv.org/abs/1103.1529, 2015.
- 3[3] Bjørn Kjos Hanssen. The probability distribution as a computational resource for randomness testing. Journal of Logic and Analysis , 2(10):1–13, 2010.
- 4[4] D. M. Roy. Computability, inference and modeling in probabilistic programming . Ph D thesis, MIT, 2011.
- 5[5] H. Takahashi. Bayesian approach to a definition of random sequences and its applications to statistical inference. In 2006 IEEE International Symposium on Information Theory , pages 2180–2184, July 2006.
- 6[6] H. Takahashi. On a definition of random sequences with respect to conditional probability. Inform. and Compt. , 206:1375–1382, 2008.
- 7[7] H. Takahashi. Algorithmic randomness and monotone complexity on product space. Inform. and Compt. , 209:183–197, 2011.
- 8[8] H. Takahashi. Generalization of van lambalgen’s theorem and blind randomness for conditional probabilities, 2014. arxiv:1310.0709 v 3.
