SFP: Spurious Feature-Targeted Pruning for Out-of-Distribution Generalization
Yingchun Wang, Jingcai Guo, Song Guo, Yi Liu, Jie Zhang, Weizhan Zhang
Abstract
Model substructure learning aims to find an invariant network substructure that can have better out-of-distribution (OOD) generalization than the original full structure. Existing works usually search the invariant substructure using modular risk minimization (MRM) with fully exposed out-domain data, which may bring about two drawbacks: 1) Unfairness, due to the dependence of the full exposure of out-domain data; and 2) Sub-optimal OOD generalization, due to the equally feature-untargeted pruning on the whole data distribution. Based on the idea that in-distribution (ID) data with spurious features may have a lower experience risk, in this paper, we propose a novel Spurious Feature-targeted model Pruning framework, dubbed SFP, to automatically explore invariant substructures without referring to the above drawbacks. Specifically, SFP identifies spurious features within ID instances during training using our theoretically verified task loss, upon which, SFP attenuates the corresponding feature projections in model space to achieve the so-called spurious feature-targeted pruning. This is typically done by removing network branches with strong dependencies on identified spurious features, thus SFP can push the model learning toward invariant features and pull that out of spurious features and devise optimal OOD generalization. Moreover, we also conduct detailed theoretical analysis to provide the rationality guarantee and a proof framework for OOD structures via model sparsity, and for the first time, reveal how a highly biased data distribution affects the model's OOD generalization. Experiments on various OOD datasets show that SFP can significantly outperform both structure-based and non-structure-based OOD generalization SOTAs, with accuracy improvement up to 4.72% and 23.35%, respectively 1 .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 0a09b12f-01f9-443c-b335-3e23bab6c7a5Builds on10
- Distributionally Robust Neural NetworksShiori Sagawa, Pang Wei Koh, Tatsunori B. Hashimoto, Percy LiangICLR 2020 · 1,578 citations
- Out-of-Distribution Generalization via Risk Extrapolation (REx)David Krueger, Ethan Caballero, Jörn-Henrik Jacobsen, Amy Zhang et al.ICML 2021 · 1,163 citations
- Fine-Tuning can Distort Pretrained Features and Underperform Out-of-DistributionAnanya Kumar, Aditi Raghunathan, Robbie Matthew Jones, Tengyu Ma et al.ICLR 2022 · 911 citations
- Environment Inference for Invariant LearningElliot Creager, Jörn-Henrik Jacobsen, Richard S. ZemelICML 2021 · 454 citations
- An Investigation of Why Overparameterization Exacerbates Spurious CorrelationsShiori Sagawa, Aditi Raghunathan, Pang Wei Koh, Percy LiangICML 2020 · 436 citations
Related papers
- Can Subnetwork Structure Be the Key to Out-of-Distribution Generalization?Dinghuai Zhang, Kartik Ahuja, Yilun Xu, Yisen Wang et al.ICML 2021 · 109 citations
- Pruning Spurious Subgraphs for Graph Out-of-Distribution GeneralizationTianjun Yao, Haoxuan Li, Yongqiang Chen, Tongliang Liu et al.NeurIPS 2025
- Training Debiased Subnetworks with Contrastive Weight PruningGeon Yeong Park, Sangmin Lee, Sang Wan Lee, Jong Chul YeCVPR 2023
- Diagnosing and Rectifying Fake OOD Invariance: A Restructured Causal ApproachZiliang Chen, Yongsen Zheng, Zhao-Rong Lai, Quanlong Guan et al.AAAI 2024 · 4 citations
- Learning Graph Invariance by Harnessing SpuriosityTianjun Yao, Yongqiang Chen, Kai Hu, Tongliang Liu et al.ICLR 2025
