HESSO: Towards Automatic Efficient and User Friendly Any Neural Network Training and Pruning

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Chen, Tianyi, Qu, Xiaoyi, Aponte, David, Banbury, Colby, Ko, Jongwoo, Ding, Tianyu, Ma, Yong, Lyapunov, Vladimir, Zharkov, Ilya, Liang, Luming
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866908353326743552
author Chen, Tianyi
Qu, Xiaoyi
Aponte, David
Banbury, Colby
Ko, Jongwoo
Ding, Tianyu
Ma, Yong
Lyapunov, Vladimir
Zharkov, Ilya
Liang, Luming
author_facet Chen, Tianyi
Qu, Xiaoyi
Aponte, David
Banbury, Colby
Ko, Jongwoo
Ding, Tianyu
Ma, Yong
Lyapunov, Vladimir
Zharkov, Ilya
Liang, Luming
contents Structured pruning is one of the most popular approaches to effectively compress the heavy deep neural networks (DNNs) into compact sub-networks while retaining performance. The existing methods suffer from multi-stage procedures along with significant engineering efforts and human expertise. The Only-Train-Once (OTO) series has been recently proposed to resolve the many pain points by streamlining the workflow by automatically conducting (i) search space generation, (ii) structured sparse optimization, and (iii) sub-network construction. However, the built-in sparse optimizers in the OTO series, i.e., the Half-Space Projected Gradient (HSPG) family, have limitations that require hyper-parameter tuning and the implicit controls of the sparsity exploration, consequently requires intervening by human expertise. To address such limitations, we propose a Hybrid Efficient Structured Sparse Optimizer (HESSO). HESSO could automatically and efficiently train a DNN to produce a high-performing subnetwork. Meanwhile, it is almost tuning-free and enjoys user-friendly integration for generic training applications. To address another common issue of irreversible performance collapse observed in pruning DNNs, we further propose a Corrective Redundant Identification Cycle (CRIC) for reliably identifying indispensable structures. We numerically demonstrate the efficacy of HESSO and its enhanced version HESSO-CRIC on a variety of applications ranging from computer vision to natural language processing, including large language model. The numerical results showcase that HESSO can achieve competitive even superior performance to varying state-of-the-arts and support most DNN architectures. Meanwhile, CRIC can effectively prevent the irreversible performance collapse and further enhance the performance of HESSO on certain applications.
format Preprint
id arxiv_https___arxiv_org_abs_2409_09085
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle HESSO: Towards Automatic Efficient and User Friendly Any Neural Network Training and Pruning
Chen, Tianyi
Qu, Xiaoyi
Aponte, David
Banbury, Colby
Ko, Jongwoo
Ding, Tianyu
Ma, Yong
Lyapunov, Vladimir
Zharkov, Ilya
Liang, Luming
Machine Learning
Computer Vision and Pattern Recognition
Image and Video Processing
Structured pruning is one of the most popular approaches to effectively compress the heavy deep neural networks (DNNs) into compact sub-networks while retaining performance. The existing methods suffer from multi-stage procedures along with significant engineering efforts and human expertise. The Only-Train-Once (OTO) series has been recently proposed to resolve the many pain points by streamlining the workflow by automatically conducting (i) search space generation, (ii) structured sparse optimization, and (iii) sub-network construction. However, the built-in sparse optimizers in the OTO series, i.e., the Half-Space Projected Gradient (HSPG) family, have limitations that require hyper-parameter tuning and the implicit controls of the sparsity exploration, consequently requires intervening by human expertise. To address such limitations, we propose a Hybrid Efficient Structured Sparse Optimizer (HESSO). HESSO could automatically and efficiently train a DNN to produce a high-performing subnetwork. Meanwhile, it is almost tuning-free and enjoys user-friendly integration for generic training applications. To address another common issue of irreversible performance collapse observed in pruning DNNs, we further propose a Corrective Redundant Identification Cycle (CRIC) for reliably identifying indispensable structures. We numerically demonstrate the efficacy of HESSO and its enhanced version HESSO-CRIC on a variety of applications ranging from computer vision to natural language processing, including large language model. The numerical results showcase that HESSO can achieve competitive even superior performance to varying state-of-the-arts and support most DNN architectures. Meanwhile, CRIC can effectively prevent the irreversible performance collapse and further enhance the performance of HESSO on certain applications.
title HESSO: Towards Automatic Efficient and User Friendly Any Neural Network Training and Pruning
topic Machine Learning
Computer Vision and Pattern Recognition
Image and Video Processing
url https://arxiv.org/abs/2409.09085