{"title":"并行分布式柯西机的设计","authors":"Yoshiyasu Takefuji, H. Szu","doi":"10.1109/IJCNN.1989.118629","DOIUrl":null,"url":null,"abstract":"A parallel and stochastic version of Hopfield-like neural networks is presented. Cauchy color noise is assumed. The specific noise is desirable for fast convergence to a fixed point representing a neighborhood minimum. It can be quickly quenched at each iteration according to a proven cooling schedule in generating random states on the energy landscape. An exact Cauchy acceptance criterion is analytically derived for hill-climbing capability. The improvement is twofold: a faster cooling schedule (the inversely linear cooling schedule characterized by the Cauchy simulated annealing) and parallel executions of all neurons. Such a Cauchy machine can be electronically implemented, and the design is given.<<ETX>>","PeriodicalId":199877,"journal":{"name":"International 1989 Joint Conference on Neural Networks","volume":"216 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"52","resultStr":"{\"title\":\"Design of parallel distributed Cauchy machines\",\"authors\":\"Yoshiyasu Takefuji, H. Szu\",\"doi\":\"10.1109/IJCNN.1989.118629\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A parallel and stochastic version of Hopfield-like neural networks is presented. Cauchy color noise is assumed. The specific noise is desirable for fast convergence to a fixed point representing a neighborhood minimum. It can be quickly quenched at each iteration according to a proven cooling schedule in generating random states on the energy landscape. An exact Cauchy acceptance criterion is analytically derived for hill-climbing capability. The improvement is twofold: a faster cooling schedule (the inversely linear cooling schedule characterized by the Cauchy simulated annealing) and parallel executions of all neurons. Such a Cauchy machine can be electronically implemented, and the design is given.<<ETX>>\",\"PeriodicalId\":199877,\"journal\":{\"name\":\"International 1989 Joint Conference on Neural Networks\",\"volume\":\"216 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"52\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International 1989 Joint Conference on Neural Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IJCNN.1989.118629\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International 1989 Joint Conference on Neural Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJCNN.1989.118629","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A parallel and stochastic version of Hopfield-like neural networks is presented. Cauchy color noise is assumed. The specific noise is desirable for fast convergence to a fixed point representing a neighborhood minimum. It can be quickly quenched at each iteration according to a proven cooling schedule in generating random states on the energy landscape. An exact Cauchy acceptance criterion is analytically derived for hill-climbing capability. The improvement is twofold: a faster cooling schedule (the inversely linear cooling schedule characterized by the Cauchy simulated annealing) and parallel executions of all neurons. Such a Cauchy machine can be electronically implemented, and the design is given.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
