pith. sign in

arxiv: 2408.02801 · v1 · pith:4VVQOJIInew · submitted 2024-08-05 · 💻 cs.LG · math.OC· stat.ML

Sparse Deep Learning Models with the ell₁ Regularization

classification 💻 cs.LG math.OCstat.ML
keywords parametersregularizationneuraldeepsparsitylearningmodelsnetworks
0
0 comments X
read the original abstract

Sparse neural networks are highly desirable in deep learning in reducing its complexity. The goal of this paper is to study how choices of regularization parameters influence the sparsity level of learned neural networks. We first derive the $\ell_1$-norm sparsity-promoting deep learning models including single and multiple regularization parameters models, from a statistical viewpoint. We then characterize the sparsity level of a regularized neural network in terms of the choice of the regularization parameters. Based on the characterizations, we develop iterative algorithms for selecting regularization parameters so that the weight parameters of the resulting deep neural network enjoy prescribed sparsity levels. Numerical experiments are presented to demonstrate the effectiveness of the proposed algorithms in choosing desirable regularization parameters and obtaining corresponding neural networks having both of predetermined sparsity levels and satisfactory approximation accuracy.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Adaptive Regularization for Sparsity Control in Bregman-Based Optimizers

    cs.LG 2026-05 unverdicted novelty 6.0

    An adaptive regularization update for Bregman optimizers achieves target sparsity levels from 75% to 99% with faster early convergence and performance matching or exceeding oracle-tuned baselines.

  2. Adaptive Regularization for Sparsity Control in Bregman-Based Optimizers

    cs.LG 2026-05 unverdicted novelty 5.0

    An adaptive lambda update based on current vs target sparsity enables reliable 75-99% sparsity in LinBreg and AdaBreg optimizers while matching or exceeding non-adaptive baseline performance on speaker verification tasks.

  3. Adaptive Regularization for Sparsity Control in Bregman-Based Optimizers

    cs.LG 2026-05 unverdicted novelty 4.0

    Adaptive λ adjustment for target sparsity in LinBreg and AdaBreg, shown to work on speaker verification models with ECAPA-TDNN and ResNet34.