Skip to content
Open access

CONDITION NUMBER-AWARE PRUNING: PRESERVING MATHEMATICAL STABILITY IN SPARSE NEURAL NETWORKS

Jul 2026 · International journal of computer information systems and industrial management applications · Vol 18, pp. 726-743 · 0 citations

TL;DR

This paper proposes a condition number-aware pruning framework that explicitly preserves mathematical stability during the pruning process, and significantly improves both standard accuracy and adversarial robustness compared to conventional pruning methods.

Abstract

The increasing scale of deep neural networks has necessitated model compression techniques, with pruning emerging as a prominent approach to reduce computational and memory costs. However, aggressive pruning introduces a critical challenge: the degradation of mathematical stability and adversarial robustness. Recent research reveals that highly pruned weight matrices tend to become ill-conditioned, exhibiting exploding condition numbers that undermine model performance and robustness . This paper proposes a condition number-aware pruning framework that explicitly preserves mathematical stability during the pruning process. We establish theoretical connections between sparsity, condition number, and local Lipschitz continuity, demonstrating that the condition number becomes the dominant factor limiting robustness in over-sparsified models . Our methodology integrates a differentiable Condition Number Constraint (CNC) with transformed sparse regularization (TSCNC) to simultaneously achieve high sparsity and well-conditioned weight matrices. Experimental evaluations on CIFAR-10, CIFAR-100, and Tiny-ImageNet demonstrate that our approach significantly improves both standard accuracy and adversarial robustness compared to conventional pruning methods, achieving superior performance across VGG, ResNet, and WideResNet architectures.

Read PDF

Similar papers

Conference Open access Sep 2026

Diverge to Converge: Mutual Heterogeneous Learning for Robust Pruning

Mutual Heterogeneous Learning (MHL) is proposed, a framework enabling robust pruning via single-model inference that significantly outperforms single-model baselines in both adversarial robustness and corruption robustness, while maintaining competitive clean accuracy.

Jin-Hui Yu, Zikai Zhang, Khaled A. Harras et al. · 0 citations
Aug 2026

Random Sparse Networks Training with Sharpness-Aware Regularization.

This study examines a complementary perspective on LTH and proposes the Dual Lottery Ticket Hypothesis (DLTH), enabling general training for sparse networks and introduces Sharpness-Aware Random Sparse Network Transformation (SA-RST), which uses a regularization term to extrude information from weights slated for maski...

Yue Bai, Mingyuan Zhang, Huan Wang et al. · 0 citations
Open access Jul 2026

Deep Neural Network Compression via Data-Driven Low-Rank Singular Value Decomposition

This paper proposes a novel compression method that uses Singular Value Decomposition (SVD) informed by data examples that achieves substantial reductions in model size and computation with minimal impact on accuracy and demonstrates its applicability in compressing deep neural networks to a fraction of their original...

Abdelfattah Toulaoui, H. Khalfi, I. Hafidi · 0 citations
Preprint Aug 2026

Domain-Aware Pruning: Sparsity and Domain Generalization via Regularized Probabilistic Masking

Beyond efficiency and generalization, DAP natively provides increased robustness to adversarial perturbations and yields highly interpretable models, where the retained weights reliably encapsulate the most domain-invariant and task-critical representations.

Parham Sazdar, Mostafa Tavassolipour, Reshad Hosseini · 0 citations
Aug 2026

Neural Stability Enhancement Through Dynamic Lipschitz Constraints in Generative Adversarial Networks.

This work challenges the conventional fixed-constraint paradigm by formalizing how the effective constraint strength and a bound-implied Lipschitz constant target can depend on architecture and training state and introduces ALC, a modular mechanism that adjusts the Lipschitz constant target rather than introducing anot...

Jue-Xin Zhang, Ying Weng, Xue-Ping Zhao et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.