{"title":"一种鲁棒性自适应滤波方法","authors":"G. Yin, Y.M. Zhu","doi":"10.1109/CDC.1989.70651","DOIUrl":null,"url":null,"abstract":"The robustness of adaptive filtering algorithms is considered. the main effort has been devoted to obtaining reasonably good upper bounds for the iterates when the law of large numbers is only approximately valid. Asymptotic order estimates for the absolute deviation of the iterates are obtained, and an almost sure convergence result is proved. Comments are made regarding the corresponding algorithm with randomly varying truncations.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"112 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A robustness approach to adaptive filtering\",\"authors\":\"G. Yin, Y.M. Zhu\",\"doi\":\"10.1109/CDC.1989.70651\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The robustness of adaptive filtering algorithms is considered. the main effort has been devoted to obtaining reasonably good upper bounds for the iterates when the law of large numbers is only approximately valid. Asymptotic order estimates for the absolute deviation of the iterates are obtained, and an almost sure convergence result is proved. Comments are made regarding the corresponding algorithm with randomly varying truncations.<<ETX>>\",\"PeriodicalId\":156565,\"journal\":{\"name\":\"Proceedings of the 28th IEEE Conference on Decision and Control,\",\"volume\":\"112 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 28th IEEE Conference on Decision and Control,\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1989.70651\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 28th IEEE Conference on Decision and Control,","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1989.70651","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The robustness of adaptive filtering algorithms is considered. the main effort has been devoted to obtaining reasonably good upper bounds for the iterates when the law of large numbers is only approximately valid. Asymptotic order estimates for the absolute deviation of the iterates are obtained, and an almost sure convergence result is proved. Comments are made regarding the corresponding algorithm with randomly varying truncations.<>