The Perceptron Algorithm is Fast for Nonmalicious Distributions
暂无分享,去创建一个
[1] A. A. Mullin,et al. Principles of neurodynamics , 1962 .
[2] Marvin Minsky,et al. Perceptrons: An Introduction to Computational Geometry , 1969 .
[3] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.
[4] D. Pollard. Convergence of stochastic processes , 1984 .
[5] Leslie G. Valiant,et al. A theory of the learnable , 1984, CACM.
[6] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[7] M. Kearns,et al. Crytographic limitations on learning Boolean formulae and finite automata , 1989, STOC '89.
[8] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[9] ERIC B. BAUM,et al. On learning a union of half spaces , 1990, J. Complex..
[10] Eric B. Baum,et al. Neural net algorithms that learn in polynomial time from examples and queries , 1991, IEEE Trans. Neural Networks.