{"title":"大规模并行实现的反向传播算法的容错性和学习性能","authors":"P. Murali, H. Wechsler, M. Manohar","doi":"10.1109/FMPC.1990.89483","DOIUrl":null,"url":null,"abstract":"Mapping the backpropagation (BP) algorithm onto an SIMD (single-instruction-stream, multiple-data-stream) machine, such as the Massively Parallel Processor, is considered. It is shown that the size of the connectionist network underlying BP can be scaled up to large sizes, resulting in improved performance. Specifically, both fault tolerance and learning speed can be enhanced.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"110 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Fault-tolerance and learning performance of the back-propagation algorithm using massively parallel implementation\",\"authors\":\"P. Murali, H. Wechsler, M. Manohar\",\"doi\":\"10.1109/FMPC.1990.89483\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mapping the backpropagation (BP) algorithm onto an SIMD (single-instruction-stream, multiple-data-stream) machine, such as the Massively Parallel Processor, is considered. It is shown that the size of the connectionist network underlying BP can be scaled up to large sizes, resulting in improved performance. Specifically, both fault tolerance and learning speed can be enhanced.<<ETX>>\",\"PeriodicalId\":193332,\"journal\":{\"name\":\"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":\"110 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FMPC.1990.89483\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1990.89483","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fault-tolerance and learning performance of the back-propagation algorithm using massively parallel implementation
Mapping the backpropagation (BP) algorithm onto an SIMD (single-instruction-stream, multiple-data-stream) machine, such as the Massively Parallel Processor, is considered. It is shown that the size of the connectionist network underlying BP can be scaled up to large sizes, resulting in improved performance. Specifically, both fault tolerance and learning speed can be enhanced.<>