论文信息 - The light bulb problem - 字舞流文

The light bulb problem

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

Sanguthevar Rajasekaran | John H. Reif | Ramamohan Paturi

[1] P. Diaconis,et al. Computer-Intensive Methods in Statistics , 1983 .

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

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

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

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

[6] B. Efron. Bootstrap Methods: Another Look at the Jackknife , 1979 .

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

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