A Sparse Deep Linear Discriminative Analysis using Sparse Evolutionary Training

Xuefeng Bai, Lijun Yan
{"title":"A Sparse Deep Linear Discriminative Analysis using Sparse Evolutionary Training","authors":"Xuefeng Bai, Lijun Yan","doi":"10.1145/3446132.3446167","DOIUrl":null,"url":null,"abstract":"Deep Linear Discriminative Analysis (DeepLDA) is an effective feature learning method that combines LDA with deep neural network. The core of DeepLDA is putting a LDA based loss function on the top of deep neural network, which is constructed by fully-connected layers. Generally speaking, fully-connected layers will lead to a large consumption of computing resource. What’s more, capacity of the deep neural network may too large to fit training data properly when fully-connected layers are used. Thus, performance of DeepLDA may be improved by increasing sparsity of the deep neural network. In this paper, a sparse training strategy is exploited to train DeepLDA. Dense layers in DeepLDA are replaced by a Erdös-Rényi random graph based sparse topology first. Then, sparse evolutionary training (SET) strategy is employed to train DeepLDA. Preliminary experiments show that DeepLDA trained with SET strategy outperforms DeepLDA trained with fully-connected layers on MINST classification task.","PeriodicalId":125388,"journal":{"name":"Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3446132.3446167","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Deep Linear Discriminative Analysis (DeepLDA) is an effective feature learning method that combines LDA with deep neural network. The core of DeepLDA is putting a LDA based loss function on the top of deep neural network, which is constructed by fully-connected layers. Generally speaking, fully-connected layers will lead to a large consumption of computing resource. What’s more, capacity of the deep neural network may too large to fit training data properly when fully-connected layers are used. Thus, performance of DeepLDA may be improved by increasing sparsity of the deep neural network. In this paper, a sparse training strategy is exploited to train DeepLDA. Dense layers in DeepLDA are replaced by a Erdös-Rényi random graph based sparse topology first. Then, sparse evolutionary training (SET) strategy is employed to train DeepLDA. Preliminary experiments show that DeepLDA trained with SET strategy outperforms DeepLDA trained with fully-connected layers on MINST classification task.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于稀疏进化训练的稀疏深度线性判别分析
深度线性判别分析(Deep Linear Discriminative Analysis, DeepLDA)是一种将深度线性判别分析与深度神经网络相结合的有效特征学习方法。DeepLDA的核心是将一个基于LDA的损失函数放在由全连接层构成的深度神经网络的顶层。一般来说,全连接层会导致大量的计算资源消耗。此外,当使用全连接层时,深度神经网络的容量可能太大而无法正确拟合训练数据。因此,可以通过增加深度神经网络的稀疏度来提高DeepLDA的性能。本文采用稀疏训练策略对DeepLDA进行训练。DeepLDA中的密集层首先被基于稀疏拓扑的Erdös-Rényi随机图所取代。然后,采用稀疏进化训练(SET)策略对DeepLDA进行训练。初步实验表明,SET策略训练的DeepLDA在MINST分类任务上优于全连接层训练的DeepLDA。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Lane Detection Combining Details and Integrity: an Advanced Method for Lane Detection The Cat's Eye Effect Target Recognition Method Based on deep convolutional neural network Leveraging Different Context for Response Generation through Topic-guided Multi-head Attention Siamese Multiplicative LSTM for Semantic Text Similarity Multi-constrained Vehicle Routing Problem Solution based on Adaptive Genetic Algorithm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1