Skip to content
Conference Open access

Diverge to Converge: Mutual Heterogeneous Learning for Robust Pruning

Sep 2026 · Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence · 0 citations · 45 references

TL;DR

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.

Abstract

Neural network pruning is crucial for efficient deployment on resource-constrained devices, yet achieving high sparsity often leads to significant robustness degradation against adversarial perturbations and corruptions. Recent works typically rely on single-model fine-tuning along a fixed optimization trajectory, which renders the network susceptible to local optima and noise while failing to restore the multiple robustness properties compromised during compression. In this paper, we propose Mutual Heterogeneous Learning (MHL), a framework enabling robust pruning via single-model inference. MHL instantiates heterogeneity through two complementary mechanisms: layer-wise Lipschitz regularization for intermediate feature smoothness and adaptive margin objective for difficulty-aware boundary separation. To guide these diverse experts to converge, we employ entropy-based mutual distillation with a strategic schedule that shifts the optimization trajectory from exploring diverse feature subspaces to consolidating a unified robust model. Extensive experiments on 4 clean and corruption benchmarks and adversarial attacks demonstrate that MHL significantly outperforms single-model baselines in both adversarial robustness (+5%) and corruption robustness (+2.6%) while maintaining competitive clean accuracy.

Read PDF

Similar papers

Preprint Aug 2026

Learning with Bilevel-Minimax Optimization for Efficient and Reliable Transfer Attacks

This work proposes BMAT (Bilevel-Minimax Adversarial Transfer), an integrated bottom-up solver that combines a Soft Weight Modulator and an Implicit Gradient Approximator to enable ternary coupling among initialization, surrogate adaptation, and perturbation optimization.

Yao-Hua Liu, Yi-Fan Guo, Jia-Xin Gao · 0 citations
Preprint Jul 2026

Adversarial LassoNet: Robust Feature Selection via Stability-Driven Sparse Learning

Adversarial LassoNet is proposed, a stability-driven sparse feature selection framework that integrates input-space adversarial perturbations with the hierarchical sparsity mechanism of LassoNet and an NTK-inspired spectral analysis to characterize how perturbation-driven training can reduce gradient concentration.

Zhenghao Huang, Peicheng Xu, Junbiao Pang et al. · 0 citations
Preprint Aug 2026

Robust CurveMoE: Multi-Norm Adversarial Defense for Mixture-of-Experts Models via Mode Connectivity

Experiments show that Robust CurveMoE consistently improves clean, norm-specific, and Union accuracy over MSD and ERMC and introduces contribution-guided partial updating, which selects influential curve parameters using initialization-based gradient scores, and theoretically bound the objective gap between partial and...

Xu Zhang, Wanggui Ren · 0 citations
Preprint Jul 2026

Robustness Meets Uncertainty: Evidential Adversarial Training for Robust Selective Classification

Evidential Adversarial Training (EV-AT), which models uncertainty through a Dirichlet distribution and combines an evidence-based loss promoting clean accuracy and reliable uncertainty with a robust evidence-alignment loss matching clean and adversarial predictions in log Dirichlet-parameter space, is proposed.

Nicolas Sournac, Ahmed Baha Ben Jmaa, B. Braeckeveldt · 0 citations
Aug 2026

Balancing clean accuracy and gradient robustness via mask-guided mixup and adaptive label refinement

A robustness-oriented training framework that integrates Mask-Guided Adversarial Mixup (MGAM) and Adaptive Timescale Exponential Moving Average (AT-EMA) that provides a practical data-regularization strategy for improving training stability in adversarial learning is proposed.

Guo Niu, Huanlin Mo, Shengjun Deng et al. · 0 citations
Open access Jul 2026

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

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.

Jeromy R, K Bhavani, K.Mohana Lakshmi 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.