{"title":"递归随机逼近算法中实际增益序列选择的形式化分析","authors":"Qi Wang","doi":"10.1109/CISS.2013.6552320","DOIUrl":null,"url":null,"abstract":"For many popular stochastic approximation algorithms, such as simultaneous perturbation stochastic approximation method and stochastic gradient method, the practical gain sequence selections are different from the optimal selection, which is theoretically derived from asymptotically performance. We provide formal justification for the reasons why we choose such gain sequence in practice.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"602 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Formal analysis for practical gain sequence selection in recursive stochastic approximation algorithms\",\"authors\":\"Qi Wang\",\"doi\":\"10.1109/CISS.2013.6552320\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For many popular stochastic approximation algorithms, such as simultaneous perturbation stochastic approximation method and stochastic gradient method, the practical gain sequence selections are different from the optimal selection, which is theoretically derived from asymptotically performance. We provide formal justification for the reasons why we choose such gain sequence in practice.\",\"PeriodicalId\":268095,\"journal\":{\"name\":\"2013 47th Annual Conference on Information Sciences and Systems (CISS)\",\"volume\":\"602 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 47th Annual Conference on Information Sciences and Systems (CISS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2013.6552320\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2013.6552320","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Formal analysis for practical gain sequence selection in recursive stochastic approximation algorithms
For many popular stochastic approximation algorithms, such as simultaneous perturbation stochastic approximation method and stochastic gradient method, the practical gain sequence selections are different from the optimal selection, which is theoretically derived from asymptotically performance. We provide formal justification for the reasons why we choose such gain sequence in practice.