Structure Learning for Deep Neural Networks with Competitive Synaptic Pruning

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Ahmadi A.; Mahboobi Esfanjani R.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING INNOVATIONS Year:2025 | Volume:13 | Issue:1 Page(s): 189-196

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Structure Learning for Deep Neural Networks with Competitive Synaptic Pruning

Author(s)

Ahmadi A. | Mahboobi Esfanjani R. | Issue Writer Certificate

Keywords

Deep Neural Networks

Synaptic Pruning

Distillation Column

PID Tuning

Abstract

Background and Objectives: A predefined structure is usually employed for Deep Neural Networks, which results in over- or underfitting, heavy processing load, and storage overhead. Training along with pruning can decrease redundancy in Deep Neural Networks; however, it may lead to a decrease in accuracy.Methods: In this note, we provide a novel approach for structure optimization of Deep Neural Networks based on competition of connections merged with brain-inspired Synaptic Pruning. The efficiency of each network connection is continuously assessed in the proposed scheme based on the global gradient magnitude criterion, which also considers positive scores for strong and more effective connections and negative scores for weak connections. But a connection with a weak score is not removed quickly; instead, it is eliminated when its net score reaches a predetermined threshold. Moreover, the pruning rate is obtained distinctly for each layer of the network.Results: Applying the suggested algorithm to a neural network model of a Distillation Column in a noisy environment demonstrates its effectiveness and applicability.Conclusion: The proposed method, which is inspired by connection competition and Synaptic Pruning in the human brain, enhances learning speed, preserves accuracy, and reduces costs due to its smaller network size. It also handles noisy data more efficiently by continuously assessing network connections

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans