Computing with Noisy Information

This paper studies the depth of noisy decision trees in which each node gives the wrong answer with some constant probability. In the noisy Boolean decision tree model, tight bounds are given on the number of queries to input variables required to compute threshold functions, the parity function and symmetric functions. In the noisy comparison tree model, tight bounds are given on the number of noisy comparisons for searching, sorting, selection and merging. The paper also studies parallel selection and sorting with noisy comparisons, giving tight bounds for several problems.

[1]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[2]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[3]  J. Pieter M. Schalkwijk.  A class of simple and optimal strategies for block coding on the binary symmetric channel with noiseless feedback , 1971, IEEE Trans. Inf. Theory.

[4]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[5]  Sorting and searching" the art of computer programming , 1973 .

[6]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[7]  Joel H. Spencer,et al.  Coping with Errors in Binary Search Procedures , 1980, J. Comput. Syst. Sci..

[8]  János Komlós,et al.  Sorting in c log n parallel sets , 1983, Comb..

[9]  Uzi Vishkin,et al.  Constant Depth Reducibility , 1984, SIAM J. Comput..

[10]  Bala Ravikumar,et al.  Coping with Known Patterns of Lies in a Search Game , 1984, Theor. Comput. Sci..

[11]  Andrew Chi-Chih Yao,et al.  On Fault-Tolerant Networks for Sorting , 1985, SIAM J. Comput..

[12]  Rüdiger Reischuk.  Probabilistic Parallel Algorithms for Sorting and Selection , 1985, SIAM J. Comput..

[13]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[14]  Michael E. Saks,et al.  Probabilistic Boolean decision trees and the complexity of evaluating game trees , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[15]  Frank Thomson Leighton,et al.  Reconfiguring a hypercube in the presence of faults , 1987, STOC.

[16]  Bala Ravikumar,et al.  On Selecting the Largest Element in Spite of Erroneous Information , 1987, STACS.

[17]  Andrzej PELC,et al.  Searching with Known Error Probability , 1989, Theor. Comput. Sci..

[18]  Eli Upfal,et al.  Fault tolerant sorting network , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[19]  Claire Mathieu,et al.  On Evaluating Boolean Functions with Unreliable Tests , 1990, Int. J. Found. Comput. Sci..

[20]  Rüdiger Reischuk,et al.  Reliable computation with noisy circuits and decision trees-a general n log n lower bound , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[21]  John N. Tsitsiklis,et al.  On a lower bound for the redundancy of reliable networks with noisy gates , 1991, IEEE Trans. Inf. Theory.

[22]  Uriel Feige,et al.  On the Complexity of Finite Random Functions , 1992, Inf. Process. Lett..

[23]  Claire Mathieu,et al.  On Boolean Decision Trees with Faulty Nodes , 1992, Random Struct. Algorithms.