Skip to content
Conference Open access

PILO: Principal Component-based Implicit Regularization with Low-rank Optimization for Robust Transfer Learning

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

TL;DR

PILO is established, a new, more effective paradigm for robust transfer learning through principled and targeted parameter optimization, and significantly outperforms state-of-the-art full-parameter and parameter-efficient methods in robust accuracy across multiple benchmarks.

Abstract

Adapting large, adversarially pre-trained models to specialized domains via transfer learning is a promising path toward building secure AI systems. However, a critical challenge arises when fine-tuning on limited downstream data: models often suffer from catastrophic forgetting of robustness, where the generalizable robust features from pre-training are erased, leading to severe robust overfitting. To address this, we first establish the underlying principle that adversarial vulnerability is not diffuse, but is concentrated in a low-dimensional subspace defined by the principal components of the model's weight matrices. We then introduce Principal component-based Implicit regularization with Low-rank Optimization (PILO), a novel parameter-efficient framework that operationalizes this insight. PILO employs a principled decoupling of learning objectives: a spectrally-guided adversarial branch, initialized via Singular Value Decomposition (SVD), performs a surgical update on the identified vulnerable subspace to enhance robustness. This is complemented by a transient, standard low-rank branch that gently adapts the model to natural data, preserving clean accuracy. This dual-branch design acts as a form of implicit spectral regularization, anchoring the model to its robust pre-trained state. Extensive experiments show that PILO significantly outperforms state-of-the-art full-parameter and parameter-efficient methods in robust accuracy across multiple benchmarks, all while reducing trainable parameters by up to 71%. Our work thus establishes a new, more effective paradigm for robust transfer learning through principled and targeted parameter optimization.

Read PDF

Similar papers

2026

Joint Adversarial and Subdomain Adaptation: A Dual-Strategy Framework for Robust Cross-Domain Modulation Recognition

While deep learning has significantly advanced automatic modulation recognition in complex environments, its performance is often limited by domain shifts caused by factors like channel fading and frequency offset. Domain adaptation has emerged as the primary paradigm to address this challenge. However, existing method...

Ming Cheng, Wen Deng, Jintian Xiong et al. · 0 citations
Open access Aug 2026

Adversarial Purification by Consistency-aware Latent Space Optimization on Data Manifolds.

This paper reveals that samples generated by a well-trained generative model are close to clean ones but far from adversarial ones, and proposes Consistency Model-based Adversarial Purification (CMAP), which optimizes vectors within the latent space of a pre-trained consistency model to generate samples for restoring c...

Shuhai Zhang, Jiahao Yang, Hui Luo et al. · 0 citations
Preprint Aug 2026

Adversarial Training Without Input Gradients via Low-Rank Householder Expansions

That such a regularizer exists is the main finding: the methods that dispense with the inner search all obtain their local geometry by differentiating with respect to the input, and it is shown this is not necessary.

T. C. Johnson, Donsub Rim · 0 citations
Conference Open access Sep 2026

Progressive Adversarial Multi-View Alignment for Unsupervised Embedded Feature Selection with Linear Complexity

A Progressive Adversarial Feature Selection (ProAd-FS) framework for large-scale multi-view learning is proposed, which formulates this static trade-off objective as a dynamic competitive process and achieves state-of-the-art performance while being highly scalable as well.

Shi-Xuan Zhou, Yi Xiang, Hao-Xiang Qin et al. · 0 citations
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

MC-SNN: Multicenter Stochastic Neural Network for Adversarially Robust Learning.

A multicenter learning method that leverages the advantage of stochastic neural networks (SNNs) for feature uncertainty learning and induces multiple centers for each class of samples in latent space to fit data more delicately, named the multicenter SNN (MC-SNN).

Meng Hu, Ran Wang, Yanting Guo 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.