Abstract
Artificial neural networks (ANNs) are increasingly being used for a variety of machine learning problems. However, increased density of interconnections in ANNs leads to high computational and power requirements. One way to reduce the power is to reduce the number of interconnections which can be achieved using least absolute shrinkage and selection operator (LASSO) techniques. In this brief, we propose an alternative smoothing function to LASSO regularization and an incremental pruning algorithm on feedforward ANNs with an aim of achieving maximally sparse networks with minimal performance degradation. We compare the results obtained using the proposed smoothing function with the existing smoothing functions. Further, we also evaluate the performance of the proposed incremental pruning algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Circuits and Systems II: Express Briefs
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
