Author:
Lim Lek-Heng,Michałek Mateusz,Qi Yang
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,General Mathematics,Analysis
Reference18 articles.
1. Blum, A., Rivest, R.L.: Training a $$3$$-node neural network is NP-complete (extended abstract). In: Proceedings of the 1988 Workshop on Computational Learning Theory (Cambridge, MA, 1988), pp. 9–18. Morgan Kaufmann, San Mateo, CA (1989)
2. Blum, A.L., Rivest, R.L.: Training a 3-node neural network is NP-complete. In: Hanson, S.J., Remmele, W., Rivest, R.L. (eds.) Machine Learning: From Theory to Applications. Lecture Notes in Computer Science, vol. 661, pp. 9–28. Springer, Berlin (1993)
3. Burger, M., Engl, H.W.: Training neural networks with noisy data as an ill-posed problem. Adv. Comput. Math. 13(4), 335–354 (2000)
4. Bürgisser, P., Cucker, F.: Condition: The Geometry of Numerical Algorithms, Grundlehren der Mathematischen Wissenschaften, vol. 349. Springer, Heidelberg (2013)
5. Cybenko, G.: Approximation by superpositions of a sigmoidal function. Math. Control Signals Syst. 2(4), 303–314 (1989)