{"title":"一种设计神经网络的映射方法","authors":"K. Rohani, M.-S. Chen, M. Manry","doi":"10.1109/NNSP.1991.239534","DOIUrl":null,"url":null,"abstract":"Several investigators have constructed back-propagation (BP) neural networks by assembling smaller, pre-trained building blocks. This approach leads to faster training and provides a known topology for the network. The authors carry this process down one additional level, by describing methods for mapping given functions to sub-blocks. First, polynomial approximations to the desired function are found. Then the polynomial is mapped to a BP network, using an extension of a constructive proof to universal approximation. Examples are given to illustrate the method.<<ETX>>","PeriodicalId":354832,"journal":{"name":"Neural Networks for Signal Processing Proceedings of the 1991 IEEE Workshop","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A mapping approach for designing neural sub-nets\",\"authors\":\"K. Rohani, M.-S. Chen, M. Manry\",\"doi\":\"10.1109/NNSP.1991.239534\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Several investigators have constructed back-propagation (BP) neural networks by assembling smaller, pre-trained building blocks. This approach leads to faster training and provides a known topology for the network. The authors carry this process down one additional level, by describing methods for mapping given functions to sub-blocks. First, polynomial approximations to the desired function are found. Then the polynomial is mapped to a BP network, using an extension of a constructive proof to universal approximation. Examples are given to illustrate the method.<<ETX>>\",\"PeriodicalId\":354832,\"journal\":{\"name\":\"Neural Networks for Signal Processing Proceedings of the 1991 IEEE Workshop\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Neural Networks for Signal Processing Proceedings of the 1991 IEEE Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NNSP.1991.239534\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neural Networks for Signal Processing Proceedings of the 1991 IEEE Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NNSP.1991.239534","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Several investigators have constructed back-propagation (BP) neural networks by assembling smaller, pre-trained building blocks. This approach leads to faster training and provides a known topology for the network. The authors carry this process down one additional level, by describing methods for mapping given functions to sub-blocks. First, polynomial approximations to the desired function are found. Then the polynomial is mapped to a BP network, using an extension of a constructive proof to universal approximation. Examples are given to illustrate the method.<>