Efficient learning of continuous neural networks
暂无分享,去创建一个
[1] Ming Li,et al. Learning in the presence of malicious errors , 1993, STOC '88.
[2] D. Pollard. Convergence of stochastic processes , 1984 .
[3] Wolfgang Maass,et al. Bounds for the computational power and learning complexity of analog neural nets , 1993, SIAM J. Comput..
[4] Kurt Hornik,et al. Approximation capabilities of multilayer feedforward networks , 1991, Neural Networks.
[5] Raimund Seidel,et al. Constructing Arrangements of Lines and Hyperplanes with Applications , 1986, SIAM J. Comput..
[6] Eduardo D. Sontag,et al. Rate of approximation results motivated by robust neural network learning , 1993, COLT '93.
[7] Leslie G. Valiant,et al. Learning Disjunction of Conjunctions , 1985, IJCAI.
[8] Ming Li,et al. Learning in the Presence of Malicious Errors , 1993, SIAM J. Comput..
[9] Raimund Seidel,et al. Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[10] Andrew R. Barron,et al. Universal approximation bounds for superpositions of a sigmoidal function , 1993, IEEE Trans. Inf. Theory.
[11] David Haussler,et al. Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications , 1992, Inf. Comput..
[12] Linda Sellie,et al. Toward efficient agnostic learning , 1992, COLT '92.
[13] Wolfgang Maass,et al. Agnostic PAC Learning of Functions on Analog Neural Nets , 1993, Neural Computation.