{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:22:19Z","timestamp":1742962939311,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643418"},{"type":"electronic","value":"9783540697527"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0053998","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:55:04Z","timestamp":1149659704000},"page":"145-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The loading problem: Topics in complexity"],"prefix":"10.1007","author":[{"given":"Marco","family":"Gori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"issue":"no.11","key":"6_CR1","first-page":"1134","volume":"27","author":"L. Valiant","year":"1984","unstructured":"L. Valiant, \u201cA theory of the learnable,\u201d Comm. Ass. Comp. Mach., vol. 27, no. 11, pp. 1134\u20131142, 1984.","journal-title":"Comm. Ass. Comp. Mach."},{"issue":"no.1","key":"6_CR2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1162\/neco.1989.1.1.151","volume":"1","author":"E. Baum","year":"1989","unstructured":"E. Baum and D. Haussler, \u201cWhat size net gives valid generalization?,\u201d Neural Computation, vol. 1, no. 1, pp. 151\u2013160, 1989.","journal-title":"Neural Computation"},{"key":"6_CR3","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4932.001.0001","volume-title":"Neural Network Design and the Complexity of Learning","author":"J. Judd","year":"1990","unstructured":"J. Judd, Neural Network Design and the Complexity of Learning. Cambridge, London: The MIT Press, 1990."},{"key":"6_CR4","first-page":"494","volume-title":"Advances in Neural Information Processing Systems","author":"A. Blum","year":"1989","unstructured":"A. Blum and R. Rivest, \u201cTraining a 3-node neural net is NP-complete,\u201d in Advances in Neural Information Processing Systems (D. Touretzky, ed.), vol. 1, pp. 494\u2013501, Morgan Kaufmann, San Mateo, 1989."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/72.80287","volume":"2","author":"E. Baum","year":"1991","unstructured":"E. Baum, \u201cbook review,\u201d IEEE Transactions on Neural Networks, vol. 2, pp. 181\u2013182, January 1991. J.S. Judd, \u201cNeural network design and the complexity of learning\u201d.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"M. Tomita, \u201cDynamic construction of finite-state automata from examples using hill-climbing,\u201d in Proceedings of the Fourth Annual Cognitive Science Conference, (Ann Arbor MI), pp. 105\u2013108, 1982.","DOI":"10.21236\/ADA120123"},{"key":"6_CR7","volume-title":"Perceptrons \u2014 Expanded Edition","author":"M. Minsky","year":"1988","unstructured":"M. Minsky and S. Papert, Perceptrons \u2014 Expanded Edition. Cambridge: MIT Press, 1988."},{"key":"6_CR8","volume-title":"Learning Machines","author":"N. Nilsson","year":"1965","unstructured":"N. Nilsson, Learning Machines. New York: McGraw-Hill, 1965. Reissued as Mathematical Foundations of Learning Machines, Morgan Kaufmann Publishers, San Mateo, CA, 1990."},{"key":"6_CR9","volume-title":"Principles of Neurodynamics: Perceptrons and the Theory of Brain Mechanism","author":"F. Rosenblatt","year":"1962","unstructured":"F. Rosenblatt, Principles of Neurodynamics: Perceptrons and the Theory of Brain Mechanism. Washington D.C.: Spartan Books, 1962."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"P. Frasconi, M. Gori, M. Maggini, E. Martinelli, and G. Soda, \u201cInductive inference of tree automata by recursive neural networks,\u201d in Lecture Notes in Artificial Intelligence (M. Lenzerini, ed.), pp. 36\u201347, Springer Verlag, 1997.","DOI":"10.1007\/3-540-63576-9_94"},{"key":"6_CR11","volume-title":"Principles of Artificial Intelligence","author":"N. Nilsson","year":"1980","unstructured":"N. Nilsson, Principles of Artificial Intelligence. Palo Alto, (CA): Tioga, 1980."},{"key":"6_CR12","unstructured":"E. Korf, \u201cIterative-deepening-a: An optimal admissible tree search,\u201d in Proceedings of the International Joint Conference on Artificial Intelligence, pp. 1034\u20131036, 1985."},{"key":"6_CR13","first-page":"689","volume":"1","author":"H. White","year":"1991","unstructured":"H. White, \u201cThe learning rate in backpropagation systems: an application of newton's method,\u201d in International Joint Conference on Neural Networks, vol. 1, pp. 689\u2013684, 1991.","journal-title":"International Joint Conference on Neural Networks"},{"key":"6_CR14","first-page":"183","volume-title":"Terminal attractor learning algorithms for backpropagation neural networks","author":"S. Wang","year":"1991","unstructured":"S. Wang and C. H. Hsu, \u201cTerminal attractor learning algorithms for backpropagation neural networks,\u201d in International Joint Conference on Neural Networks, (Singapore), pp. 183\u2013189, IEEE Press, November 1991."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"M. Bianchini, M. Gori, and M. Maggini, \u201cDoes terminal attractor backpropagation guarantee global optimization?,\u201d in International Conference on Artificial Neural Networks, (Sorrento, Italy), May, 26\u201329, 1994.","DOI":"10.1007\/978-1-4471-2097-1_87"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"P. Frasconi, S. Fanelli, M. Gori, and M. Protasi, \u201cSuspiciousness of loading problems,\u201d in Proceedings of the IEEE International Conference on Neural Networks, pp. II 1240\u20131245, IEEE Press, 9\u201312 June 1997.","DOI":"10.1109\/ICNN.1997.616211"},{"key":"6_CR17","volume-title":"Linear and Nonlinear Programming","author":"D. G. Luenberger","year":"1984","unstructured":"D. G. Luenberger, Linear and Nonlinear Programming. Reading: Addison-Wesley, 1984. 2nd ed.","edition":"2nd ed."},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/31.31314","volume":"36","author":"M. Brady","year":"1989","unstructured":"M. Brady, R. Raghavan, and J. Slawny, \u201cBack-propagation fails to separate where perceptrons succeed,\u201d IEEE Transactions on Circuits and Systems, vol. 36, pp. 665\u2013674, 1989.","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"6_CR19","first-page":"639","volume-title":"Backpropagation separates when perceptrons do","author":"E. Sontag","year":"1989","unstructured":"E. Sontag and H. Sussman, \u201cBackpropagation separates when perceptrons do,\u201d in International Joint Conference on Neural Networks, vol. 1, (Washington DC), pp. 639\u2013642, IEEE Press, June 1989."},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/34.107014","volume":"PAMI-14","author":"M. Gori","year":"1992","unstructured":"M. Gori and A. Tesi, \u201cOn the problem of local minima in backpropagation,\u201d IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-14, pp. 76\u201386, January 1992.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"6_CR21","first-page":"1818","volume-title":"Backpropagation for linearly separable patterns: a detailed analysis","author":"P. Frasconi","year":"1993","unstructured":"P. Frasconi, M. Gori, and A. Tesi, \u201cBackpropagation for linearly separable patterns: a detailed analysis,\u201d in IEEE International Conference on Neural Networks, vol. 3, (San Francisco, (CA)), pp. 1818\u20131822, IEEE Press, March\u2013April 1993."},{"key":"6_CR22","first-page":"91","volume":"3","author":"E. Sontag","year":"1989","unstructured":"E. Sontag and H. Sussman, \u201cBackpropagation can give rise to spurious local minima even for networks without hidden layers,\u201d Complex Systems, vol. 3, pp. 91\u2013106, 1989.","journal-title":"Complex Systems"},{"key":"6_CR23","volume-title":"Parallel Architectures and Neural Networks","author":"M. Gori","year":"1990","unstructured":"M. Gori and A. Tesi, \u201cSome examples of local minima during learning with back-propagation,\u201d in Parallel Architectures and Neural Networks, (Vietri sul Mare, Italy), May 1990."},{"key":"6_CR24","first-page":"627","volume-title":"Back propagation error surfaces can have local minima","author":"J. McInerny","year":"1989","unstructured":"J. McInerny, K. Haines, S. Biafore, and R. Hecht-Nielsen, \u201cBack propagation error surfaces can have local minima,\u201d in International Joint Conference on Neural Networks, vol. 2, (Washington 1989), p. 627, IEEE, New York, 1989."},{"key":"6_CR25","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5236.001.0001","volume-title":"Parallel Distributed Processing: Explorations in the Microstructure of Cognition, vol. 1","author":"D. Rumelhart","year":"1986","unstructured":"D. Rumelhart, J. McClelland, and the PDP Research Group, Parallel Distributed Processing: Explorations in the Microstructure of Cognition, vol. 1. Cambridge: MIT Press, 1986."},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0893-6080(89)90014-2","volume":"2","author":"P. Baldi","year":"1989","unstructured":"P. Baldi and K. Hornik, \u201cNeural networks and principal component analysis: Learning from examples without local minima,\u201d Neural Networks, vol. 2, pp. 53\u201358, 1989.","journal-title":"Neural Networks"},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1109\/72.410380","volume":"6","author":"X. Yu","year":"1995","unstructured":"X. Yu and G. Chen, \u201cOn the local minima free condition of backpropagation learning,\u201d IEEE Transactions on Neural Networks, vol. 6, pp. 1300\u20131303, September 1995.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"6_CR28","first-page":"205","volume-title":"Progress in Neural Networks","author":"P. Frasconi","year":"1997","unstructured":"P. Frasconi, M. Gori, and A. Tesi, \u201cSuccesses and failures of backpropagation: a theoretical investigation,\u201d in Progress in Neural Networks (O. Omidvar and C. Wilson, eds.), ch. 8, pp. 205\u2013242, Norwood, New Jersey: Ablex Publishing, 1997."},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0925-2312(95)00032-1","volume":"13","author":"M. Bianchini","year":"1996","unstructured":"M. Bianchini and M. Gori, \u201cOptimal learning in artificial neural networks: A review of theoretical results,\u201d Neurocomputing, vol. 13, pp. 313\u2013346, 1996.","journal-title":"Neurocomputing"},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/72.478415","volume":"7","author":"M. Gori","year":"1996","unstructured":"M. Gori and M. Maggini, \u201cOptimal convergence of on-line backpropagation,\u201d IEEE Transactions on Neural Networks, vol. 7, pp. 251\u2013253, January 1996.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1109\/72.363492","volume":"6","author":"M. Bianchini","year":"1995","unstructured":"M. Bianchini, P. Frasconi, and M. Gori, \u201cLearning in multilayered networks used as autoassociators,\u201d IEEE Transactions on Neural Networks, vol. 6, pp. 512\u2013515, March 1995.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"6_CR32","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1109\/72.377979","volume":"6","author":"M. Bianchini","year":"1995","unstructured":"M. Bianchini, P. Frasconi, and M. Gori, \u201cLearning without local minima in radial basis function networks,\u201d IEEE, Transactions on Neural Networks, vol. 6, pp. 749\u2013756, May 1995.","journal-title":"IEEE, Transactions on Neural Networks"},{"key":"6_CR33","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/PGEC.1965.264137","volume":"14","author":"T. Cover","year":"1965","unstructured":"T. Cover, \u201cGeometrical and statistical properties of systems of linear inequalities with applications in pattern recognition,\u201d IEEE Transactions on Electronic Computers, vol. 14, pp. 326\u2013334, 1965.","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"6_CR34","first-page":"173","volume-title":"Local minima and backpropagation","author":"T. Poston","year":"1991","unstructured":"T. Poston, C-Lee, Y. Choie, and Y. Kwon, \u201cLocal minima and backpropagation,\u201d in International Joint Conference on Neural Networks, vol. 2, (Seattle, (WA)), pp. 173\u2013176, IEEE Press, July 1991."},{"key":"6_CR35","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1109\/72.165604","volume":"3","author":"X. Yu","year":"1992","unstructured":"X. Yu, \u201cCan backpropagation error surface not have local minima?,\u201d IEEE Transactions on Neural Networks, vol. 3, pp. 1019\u20131020, November 1992.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"6_CR36","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1109\/72.317738","volume":"5","author":"L. Hamey","year":"1994","unstructured":"L. Hamey, \u201cComments on can backpropagation error surface not have local minima,\u201d IEEE Transactions on Neural Networks, vol. 5, pp. 884\u2013845, September 1994.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"6_CR37","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/72.279182","volume":"5","author":"M. Bianchini","year":"1994","unstructured":"M. Bianchini, M. Gori, and M. Maggini, \u201cOn the problem of local minima in recurrent neural networks,\u201d IEEE Transactions on Neural Networks, vol. 5, pp. 167\u2013177, March 1994. Special Issue on Recurrent Neural Networks.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"6_CR38","volume-title":"tech. rep.","author":"P. Frasconi","year":"1988","unstructured":"P. Frasconi, M. Gori, and A. Sperduti, \u201cAdaptive computation of data structures: theoretical foundations,\u201d tech. rep., Dipartimento di Ingegneria dell'Informazione, Universit\u00e0 di Siena, TR-2-98, Siena, IT, 1988."},{"key":"6_CR39","unstructured":"P. Frasconi, M. Gori, and A. Sperduti, \u201cOptimal learning of data structures,\u201d in Proceedings of the IJCAI97, (Nagoya (Japan)), pp. 1066\u20131071, August 1997."},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Y. Bengio, P. Frasconi, and P. Simard, \u201cLearning long-term dependencies with gradient descent is difficult,\u201d IEEE Transactions on Neural Networks, pp. 157\u2013166, March 1994. Special Issue on Recurrent Neural Networks.","DOI":"10.1109\/72.279181"}],"container-title":["Lecture Notes in Computer Science","Adaptive Processing of Sequences and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0053998","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T07:13:18Z","timestamp":1736406798000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0053998"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643418","9783540697527"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/bfb0053998","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"25 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}