A Proposal for More Powerful Learning Algorithms
暂无分享,去创建一个
[1] Michael J. Fischer,et al. Relations Among Complexity Measures , 1979, JACM.
[2] Leslie G. Valiant,et al. A theory of the learnable , 1984, CACM.
[3] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[4] Geoffrey E. Hinton,et al. Learning internal representations by error propagation , 1986 .
[5] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[6] Leslie G. Valiant,et al. On the learnability of Boolean formulae , 1987, STOC.
[7] Eric B. Baum,et al. On the capabilities of multilayer perceptrons , 1988, J. Complex..
[8] Leslie G. Valiant,et al. Computational limitations on learning from examples , 1988, JACM.
[9] E. Baum. Complete representations for learning from examples , 1988 .
[10] J. Stephen Judd,et al. On the complexity of loading shallow neural networks , 1988, J. Complex..
[11] David Haussler,et al. What Size Net Gives Valid Generalization? , 1989, Neural Computation.
[12] Geoffrey E. Hinton,et al. Phoneme recognition using time-delay neural networks , 1989, IEEE Trans. Acoust. Speech Signal Process..