The light bulb problem

In this paper, we consider the problem of correlational learning and present algorithms to determine correlated objects.

[1]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[2]  Leslie G. Valiant,et al.  Learning Disjunction of Conjunctions , 1985, IJCAI.

[3]  P. Raghavan.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[4]  Prabhakar Raghavan,et al.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[5]  B. Efron.  The jackknife, the bootstrap, and other resampling plans , 1987 .

[6]  Leslie G. Valiant,et al.  Functionality in neural nets , 1988, COLT '88.

[7]  Ming Li,et al.  Learning in the presence of malicious errors , 1993, STOC '88.

[8]  Sanguthevar Rajasekaran,et al.  The light bulb problem , 1989, COLT 1989.

[9]  Richard M. Karp,et al.  Probabilistic recurrence relations , 1994, JACM.