A Group Regularization Framework of Convolutional Neural Networks Based on the Impact of <i>Lₚ</i> Regularizers on Magnitude

Group regularization is commonly employed in network pruning to achieve structured model compression. However, the rationale behind existing studies on group regularization predominantly hinges on the sparsity capabilities of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{p}$ </tex-math></inline-formula> regularizers. This singular focus may lead to erroneous interpretations. In response to these limitations, this article proposes a novel framework for evaluating the penalization efficacy of group regularization methods by analyzing the impact of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{p}$ </tex-math></inline-formula> regularizers on weight magnitudes and weight group magnitudes. Within this framework, we demonstrate that <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{1,2}$ </tex-math></inline-formula> regularization, contrary to prevailing literature, indeed exhibits favorable performance in structured pruning tasks. Motivated by this insight, we introduce a hybrid group regularization approach that integrates <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{1,2}$ </tex-math></inline-formula> regularization and group <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{1/2}$ </tex-math></inline-formula> regularization (denoted as HGL1,2&<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{1/2}$ </tex-math></inline-formula>). This novel method addresses the challenge of selecting appropriate <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{p}$ </tex-math></inline-formula> regularizers for penalizing weight groups by leveraging <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{1,2}$ </tex-math></inline-formula> regularization for penalizing groups with magnitudes exceeding a critical threshold while employing group <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{1/2}$ </tex-math></inline-formula> regularization for other groups. Experimental evaluations are conducted to verify the efficiency of the proposed hybrid group regularization method and the viability of the introduced framework.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Systems Man and Cybernetics Systems
Published
2024-09-26
DOI
https://doi.org/10.1109/tsmc.2024.3453549
Citations
2
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
0.69

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Group Regularization Framework of Convolutional Neural Networks Based on the Impact of Lₚ Regularizers on Magnitude

Ansheng Deng, Yaokai Hu, Feng Li, Huisheng Zhang et al.
2 citations
IEEE Transactions on Systems Man and Cybernetics Systems
Neural Networks and Applications
0.69
article

A Group Regularization Framework of Convolutional Neural Networks Based on the Impact of Lₚ Regularizers on Magnitude

Ansheng Deng, Yaokai Hu, Feng Li, Huisheng Zhang, Jacek M. Zurada
article en
2 citations

Abstract

Group regularization is commonly employed in network pruning to achieve structured model compression. However, the rationale behind existing studies on group regularization predominantly hinges on the sparsity capabilities of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{p}$ </tex-math></inline-formula> regularizers. This singular focus may lead to erroneous interpretations. In response to these limitations, this article proposes a novel framework for evaluating the penalization efficacy of group regularization methods by analyzing the impact of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{p}$ </tex-math></inline-formula> regularizers on weight magnitudes and weight group magnitudes. Within this framework, we demonstrate that <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{1,2}$ </tex-math></inline-formula> regularization, contrary to prevailing literature, indeed exhibits favorable performance in structured pruning tasks. Motivated by this insight, we introduce a hybrid group regularization approach that integrates <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{1,2}$ </tex-math></inline-formula> regularization and group <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{1/2}$ </tex-math></inline-formula> regularization (denoted as HGL1,2&<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{1/2}$ </tex-math></inline-formula>). This novel method addresses the challenge of selecting appropriate <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{p}$ </tex-math></inline-formula> regularizers for penalizing weight groups by leveraging <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{1,2}$ </tex-math></inline-formula> regularization for penalizing groups with magnitudes exceeding a critical threshold while employing group <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{1/2}$ </tex-math></inline-formula> regularization for other groups. Experimental evaluations are conducted to verify the efficiency of the proposed hybrid group regularization method and the viability of the introduced framework.

IEEE Transactions on Systems Man and Cybernetics SystemsVol. 54(12)
University of Louisville (US), Dalian Maritime University (CN)
China Postdoctoral Science Foundation, National Key Research and Development Program of China
Openalex Percentile: Top 24%
Neural Networks and Applications
0.69
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.