{"title":"Simple Iterative Algorithms for Approximate And Bounded Parameter Orthonormality","authors":"S. Douglas, Yu Hong","doi":"10.1109/IEEECONF44664.2019.9049063","DOIUrl":null,"url":null,"abstract":"Orthonormality constraints, in which parameter sets are constrained to be perpendicular to each other and of unit length, are important for many estimation, detection, and classification tasks. Such constraints are not appropriate in all practical scenarios, however. In this paper, we describe simple adaptive algorithms that adjust a matrix so that its rows are close to orthonormality after adaptation, as specified by user-selectable bounds on pairwise inner products and squared vector lengths. The algorithms have rapid convergence. Applications to independent component analysis and deep learning system training show the benefits of the approach.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"13 1","pages":"2101-2105"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEECONF44664.2019.9049063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Orthonormality constraints, in which parameter sets are constrained to be perpendicular to each other and of unit length, are important for many estimation, detection, and classification tasks. Such constraints are not appropriate in all practical scenarios, however. In this paper, we describe simple adaptive algorithms that adjust a matrix so that its rows are close to orthonormality after adaptation, as specified by user-selectable bounds on pairwise inner products and squared vector lengths. The algorithms have rapid convergence. Applications to independent component analysis and deep learning system training show the benefits of the approach.