{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T09:40:03Z","timestamp":1749721203502,"version":"3.41.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Processing Letters"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1023\/a:1009665432594","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"201-210","source":"Crossref","is-referenced-by-count":13,"title":["Deeper Sparsely Nets can be Optimal"],"prefix":"10.1007","volume":"8","author":[{"given":"Valeriu","family":"Beiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanna E.","family":"Makaruk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"181184_CR1","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1016\/0893-6080(94)90089-2","volume":"7","author":"B.G. Horne","year":"1994","unstructured":"B.G. Horne and D.R. Hush, \u201cOn the node complexity of neural networks\u201d, Neural Networks, 7(9), pp. 1413\u20131426, 1994.","journal-title":"Neural Networks"},{"key":"181184_CR2","doi-asserted-by":"crossref","unstructured":"N.P. Red'kin, \u201cSynthesis of threshold circuits for certain classes of Boolean functions\u201d, Kibernetika, 5, pp. 6\u20139, 1970 [English translation in Cybernetics, 6(5), pp. 540\u2013544, 1973].","DOI":"10.1007\/BF01072799"},{"key":"181184_CR3","first-page":"338","volume-title":"Neural Information Processing Systems","author":"D. Hammerstrom","year":"1988","unstructured":"D. Hammerstrom, \u201cThe connectivity analysis of simple association - or - how many connections do you need\u201d, in D.Z. Anderson (ed.) Neural Information Processing Systems, pp. 338\u2013347, AIP New York, NY, 1988."},{"key":"181184_CR4","series-title":"Tech. Rep.","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-1-4615-6099-9_12","volume-title":"Mathematics of Neural Nets: Models, Algorithms and Applications","author":"V. Beiu","year":"1997","unstructured":"V. Beiu, \u201cConstant fan-in digital neural networks are VLSI-optimal\u201d, Tech. Rep. LA-UR\u201397\u201361, Los Alamos National Laboratory, USA, 1997; in S.W. Ellacott, J.C. Mason and I.J. Anderson (eds) Mathematics of Neural Nets: Models, Algorithms and Applications, pp. 89\u201394, Kluwer Academic Publishers: Boston, MA, 1997."},{"key":"181184_CR5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1037\/h0043158","volume":"63","author":"G.A. Miller","year":"1956","unstructured":"G.A. Miller, \u201cThe magical number seven, plus or minus two: some limits on our capacity for processing information\u201d, Psychology Review, 63, pp. 71\u201397 1956.","journal-title":"Psychology Review"},{"key":"181184_CR6","first-page":"946","volume-title":"Advances in Neural Information Processing Systems 3","author":"R.C. Williamson","year":"1990","unstructured":"R.C. Williamson, \u201c\u03b5-entropy and the complexity of feedforward neural networks\u201d, in R.P. Lippmann, J.E Moody and D.S Touretzky (eds) Advances in Neural Information Processing Systems 3, pp. 946\u2013952, Morgan Kaufmann: San Mateo, CA, 1990."},{"key":"181184_CR7","first-page":"1","volume-title":"Neural Information Processing Systems","author":"Y.S. Abu-Mostafa","year":"1988","unstructured":"Y.S. Abu-Mostafa, \u201cConnectivity versus entropy\u201d, in D.Z. Anderson (ed.) Neural Information Processing Systems, pp.1\u20138, AIP New York, NY, 1988."},{"issue":"6","key":"181184_CR8","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1109\/72.329690","volume":"5","author":"D.S. Phatak","year":"1994","unstructured":"D.S. Phatak and I Koren, \u201cConnectivity and performances tradeoffs in the cascade correlation learning architecture\u201d, IEEE Transactions on Neural Networks, 5(6), pp. 930\u2013935, 1994.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"181184_CR9","first-page":"137","volume-title":"Neural Information Processing Systems","author":"J. Bruck","year":"1988","unstructured":"J. Bruck and J.W. Goodmann, \u201cOn the power of neural networks for solving hard problems\u201d, in D.Z. Anderson (ed.) Neural Information Processing Systems, pp. 137\u2013143, AIP New York, NY, 1988 [also in Journal of Complexity, 6, pp. 129\u2013135, 1990]."},{"key":"181184_CR10","unstructured":"V. Beiu, J.A. Peperstraete, J. Vandewalle and R. Lauwereins, \u201cArea-time performances of some neural computations\u201d, in P. Borne, T. Fukuda and S.G. Tzafestas (eds) Proceedings of the IMACS International Symposium on Signal Processing, Robotics and Neural Networks (SPRANN'94), pp. 664\u2013668, Lille, GERF EC, France, 1994."},{"key":"181184_CR11","series-title":"Tech. Rep.","volume-title":"The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network","author":"P.L. Bartlett","year":"1996","unstructured":"P.L. Bartlett, \u201cThe sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network\u201d, Tech. Rep., Dept. Sys. Eng., Australian Natl. Univ., Canberra, 1996 [ftp:syseng.anu.edu.au\/pub\/peter\/TR96d.ps.Z; short version in M.C. Mozer, M.I. Jordan & T. Petsche (eds) Advances in Neural Information Processing Systems 9, pp. 134\u2013140, MIT Press: Cambridge, MA, 1997]."},{"key":"181184_CR12","series-title":"Tech. Rep.","volume-title":"Genetic programming of minimal neural networks using Occam's razor","author":"B.-T. Zhang","year":"1993","unstructured":"B.-T. Zhang and H. M\u00fchlenbein, \u201cGenetic programming of minimal neural networks using Occam's razor\u201d, Tech. Rep. GMD 0734, Schlo\u00df Birlinghoven, St. Augustin, Germany, 1993 [also in Complex Systems, 7(3), pp. 199\u2013220, 1993]."},{"key":"181184_CR13","doi-asserted-by":"crossref","unstructured":"V. Beiu, \u201cOn the circuit and VLSI complexity of threshold gate COMPARISON\u201d,Tech.Rep. LA-UR\u201396\u20133591, Los Alamos National Laboratory, USA, 1996 [also in Neurocomputing 19, pp. 77\u201398, 1998.","DOI":"10.1016\/S0925-2312(97)00099-4"},{"key":"181184_CR14","volume-title":"VLSI Complexity of Discrete Neural Networks","author":"V. Beiu","year":"1998","unstructured":"V. Beiu, VLSI Complexity of Discrete Neural Networks, Gordon & Breach Newark, NJ, 1998."},{"issue":"1","key":"181184_CR15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0893-6080(94)00056-R","volume":"8","author":"J. Wray","year":"1995","unstructured":"J. Wray and G.G.R. Green, \u201cNeural networks, approximation theory, and finite precision computation\u201d, Neural Networks,8(1), pp. 31\u201337, 1995.","journal-title":"Neural Networks"},{"key":"181184_CR16","first-page":"777","volume-title":"Advances in Neural Information Processing Systems","author":"M.R. Walker","year":"1989","unstructured":"M.R. Walker, S.Haghighi, A. Afghan and L.A. Akers, \u201cTraining a limited-interconnect, synthetic neural IC\u201d, in D.S. Touretzky(ed.) Advances in Neural Information Processing Systems 1, pp. 777\u2013784, Morgan Kaufmann: San Mateo, CA, 1989."},{"key":"#cr-split#-181184_CR17.1","unstructured":"V. Beiu, \"When constants are important\", Tech. Rep. LA-UR-97-226, Los Alamos National Laboratory, USA, 1997"},{"key":"#cr-split#-181184_CR17.2","unstructured":"in I. Dumitrache (ed.) Proceedings of the 11th International Conference on Control Systems and Computer Science (CSCS-11), Vol. 2, pp. 106-111, Bucharest, UPBucharest, Romania, 1997."},{"issue":"7","key":"181184_CR18","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1016\/0893-6080(96)00130-X","volume":"9","author":"V. Beiu","year":"1996","unstructured":"V. Beiu and J.G. Taylor, \u201cOn the circuit complexity of sigmoid feedforward neural networks\u201d, Neural Networks, 9(7), pp. 1155\u20131171, 1996.","journal-title":"Neural Networks"},{"issue":"12","key":"181184_CR19","doi-asserted-by":"crossref","first-page":"1402","DOI":"10.1109\/12.106225","volume":"40","author":"K.-Y. Siu","year":"1991","unstructured":"K.-Y. Siu, V.P. Roychowdhury and T. Kailath, \u201cDepth-size tradeoffs for neural computations\u201d, IEEE Transactions on Computer, 40(12), pp. 1402\u20131412, 1991.","journal-title":"IEEE Transactions on Computer"},{"issue":"2","key":"181184_CR20","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1109\/18.312169","volume":"40","author":"V.P. Roychowdhury","year":"1994","unstructured":"V.P. Roychowdhury, A. Orlitsky and K.-Y. Siu, \u201cLower bounds on threshold and related circuits via communication complexity IEEE Transactions on Information Theory, 40(2), pp. 467\u2013474, 1994.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"181184_CR21","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1109\/12.537130","volume":"45","author":"S. Vassiliadis","year":"1996","unstructured":"S. Vassiliadis, S. Cotofana and K. Berteles, \u201c2\u20131 addition and related arithmetic operations with threshold logic\u201d, IEEE Transactions on Computer, 45(9), pp. 1062\u20131068, 1996.","journal-title":"IEEE Transactions on Computer"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009665432594.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009665432594\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009665432594.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T09:13:18Z","timestamp":1749719598000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009665432594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["181184"],"URL":"https:\/\/doi.org\/10.1023\/a:1009665432594","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"type":"print","value":"1370-4621"},{"type":"electronic","value":"1573-773X"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}