{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:39:09Z","timestamp":1752230349153},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Networks"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1016\/0893-6080(94)90026-4","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T03:25:55Z","timestamp":1051241155000},"page":"321-329","source":"Crossref","is-referenced-by-count":34,"title":["What size network is good for generalization of a specific task of interest?"],"prefix":"10.1016","volume":"7","author":[{"given":"Bagrat","family":"Amirikian","sequence":"first","affiliation":[]},{"given":"Hajime","family":"Nishimura","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0893-6080(94)90026-4_BIB1","article-title":"A universal theorem on learning curves","author":"Amari","year":"1992"},{"key":"10.1016\/0893-6080(94)90026-4_BIB2","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1162\/neco.1992.4.4.605","article-title":"Four types of learning curves","volume":"4","author":"Amari","year":"1992","journal-title":"Neural Computation"},{"key":"10.1016\/0893-6080(94)90026-4_BIB3","unstructured":"Amari, S., & Murata, N. Statistical theory of curves under entropic loss criterion (Tech. Rep. METR91-12). Tokyo, Japan: The University of Tokyo, Department of Mathematical Engineering and Instrumentation Physics, Faculty of Engineering."},{"key":"10.1016\/0893-6080(94)90026-4_BIB4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF00198479","article-title":"A neural network learns trajectory of motion from the least action principle","volume":"66","author":"Amirikian","year":"1992","journal-title":"Biological Cybernetics"},{"key":"10.1016\/0893-6080(94)90026-4_BIB5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF00204596","article-title":"On the ability of neural networks to perform generalization by induction","volume":"61","author":"Anshelevich","year":"1989","journal-title":"Biological Cybernetics"},{"key":"10.1016\/0893-6080(94)90026-4_BIB6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1162\/neco.1989.1.1.151","article-title":"What size net gives valid generalization?","volume":"1","author":"Baum","year":"1989","journal-title":"Neural Computation"},{"key":"10.1016\/0893-6080(94)90026-4_BIB7","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and the Vapnik-Chervonenkis dimension","volume":"36","author":"Blumer","year":"1989","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/0893-6080(94)90026-4_BIB8","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1209\/0295-5075\/4\/10\/020","article-title":"Exhaustive thermodynamical analysis of Boolean learning networks","volume":"4","author":"Carnevali","year":"1987","journal-title":"Europhysics Letters"},{"key":"10.1016\/0893-6080(94)90026-4_BIB9","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1162\/neco.1992.4.2.249","article-title":"How tight are the Vapnik-Chervonenkis bounds?","volume":"4","author":"Cohn","year":"1992","journal-title":"Neural Computation"},{"key":"10.1016\/0893-6080(94)90026-4_BIB10","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/PGEC.1965.264137","article-title":"Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition","volume":"EC-14","author":"Cover","year":"1965","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"10.1016\/0893-6080(94)90026-4_BIB11","first-page":"877","article-title":"Large automatic learning, rule extraction, and generalization","volume":"1","author":"Denker","year":"1987","journal-title":"Complex Systems"},{"key":"10.1016\/0893-6080(94)90026-4_BIB12","series-title":"Proceedings of the 1988 Workshop on Computational Learning Theory","article-title":"A general lower bound on the number of examples needed for learning","author":"Ehrenfeucht","year":"1988"},{"key":"10.1016\/0893-6080(94)90026-4_BIB13","first-page":"1568","article-title":"A statistical approach to learning and generalization in layered neural networks","volume":"78","author":"Levin","year":"1990"},{"key":"10.1016\/0893-6080(94)90026-4_BIB14","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1209\/0295-5075\/4\/4\/020","article-title":"Learning networks of neurons with Boolean logic","volume":"4","author":"Patarnello","year":"1987","journal-title":"Europhysics Letters"},{"key":"10.1016\/0893-6080(94)90026-4_BIB15","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1080\/03081077808960690","article-title":"On the connection between the complexity and credibility of inferred models","volume":"4","author":"Pearl","year":"1978","journal-title":"International Journal of General Systems"},{"key":"10.1016\/0893-6080(94)90026-4_BIB16","volume":"Vols. 1, 2","year":"1986"},{"key":"10.1016\/0893-6080(94)90026-4_BIB17","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1162\/neco.1990.2.3.374","article-title":"Exhaustive Learning","volume":"2","author":"Schwartz","year":"1990","journal-title":"Neural Computation"},{"key":"10.1016\/0893-6080(94)90026-4_BIB18","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Communications of ACM"},{"key":"10.1016\/0893-6080(94)90026-4_BIB19","doi-asserted-by":"crossref","first-page":"6210","DOI":"10.1103\/PhysRevA.42.6210","article-title":"Learning in feedforward Boolean networks","volume":"42","author":"Van den Broeck","year":"1990","journal-title":"Physical Review A"},{"key":"10.1016\/0893-6080(94)90026-4_BIB20","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"On the uniform convergence of relative frequences of events to their probabilities","volume":"16","author":"Vapnik","year":"1971","journal-title":"Theory of Probability and its Applications"},{"key":"10.1016\/0893-6080(94)90026-4_BIB21","first-page":"319","article-title":"The relationship between Occam's razor and convergent guessing","volume":"4","author":"Wolpert","year":"1990","journal-title":"Complex Systems"},{"key":"10.1016\/0893-6080(94)90026-4_BIB22","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0893-6080(05)80023-1","article-title":"Stacked generalization","volume":"5","author":"Wolpert","year":"1992","journal-title":"Neural Networks"}],"container-title":["Neural Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0893608094900264?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0893608094900264?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T19:25:43Z","timestamp":1553282743000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0893608094900264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0893608094900264"],"URL":"https:\/\/doi.org\/10.1016\/0893-6080(94)90026-4","relation":{},"ISSN":["0893-6080"],"issn-type":[{"value":"0893-6080","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}