{"title":"学习稀疏表示的自动编码器","authors":"Abhinav Sharma, Ruchir Gupta","doi":"10.1109/OCIT56763.2022.00017","DOIUrl":null,"url":null,"abstract":"Many regularized autoencoders learn a sparse rep-resentation of data. This type of representation enhances robust-ness against noise and computational efficiencies. Our objective in this paper is to provide the conditions under which sparsity is encouraged by AE under a little less restrictive view of data. We have shown a relaxed observed representation of input data and given the conditions on AE to promote sparsity.","PeriodicalId":425541,"journal":{"name":"2022 OITS International Conference on Information Technology (OCIT)","volume":"117 23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Autoencoders Learning Sparse Representation\",\"authors\":\"Abhinav Sharma, Ruchir Gupta\",\"doi\":\"10.1109/OCIT56763.2022.00017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many regularized autoencoders learn a sparse rep-resentation of data. This type of representation enhances robust-ness against noise and computational efficiencies. Our objective in this paper is to provide the conditions under which sparsity is encouraged by AE under a little less restrictive view of data. We have shown a relaxed observed representation of input data and given the conditions on AE to promote sparsity.\",\"PeriodicalId\":425541,\"journal\":{\"name\":\"2022 OITS International Conference on Information Technology (OCIT)\",\"volume\":\"117 23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 OITS International Conference on Information Technology (OCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/OCIT56763.2022.00017\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 OITS International Conference on Information Technology (OCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OCIT56763.2022.00017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Many regularized autoencoders learn a sparse rep-resentation of data. This type of representation enhances robust-ness against noise and computational efficiencies. Our objective in this paper is to provide the conditions under which sparsity is encouraged by AE under a little less restrictive view of data. We have shown a relaxed observed representation of input data and given the conditions on AE to promote sparsity.