Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/116816
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorWang, Y-
dc.creatorGuo, J-
dc.creatorGuo, S-
dc.creatorLiu, Y-
dc.creatorZhang, J-
dc.creatorZhang, W-
dc.date.accessioned2026-01-21T03:52:53Z-
dc.date.available2026-01-21T03:52:53Z-
dc.identifier.isbn979-8-4007-0686-8-
dc.identifier.urihttp://hdl.handle.net/10397/116816-
dc.description32nd ACM International Conference on Multimedia, Melbourne VIC, Australia, 28 October 2024 - 1 November 2024en_US
dc.language.isoenen_US
dc.publisherThe Association for Computing Machineryen_US
dc.rightsThis work is licensed under a Creative Commons Attribution International 4.0 License (https://creativecommons.org/licenses/by/4.0/).en_US
dc.rights©2024 Copyright held by the owner/author(s).en_US
dc.rightsThe following publication Wang, Y., Guo, J., Guo, S., Liu, Y., Zhang, J., & Zhang, W. (2024). SFP: Spurious Feature-Targeted Pruning for Out-of-Distribution Generalization Proceedings of the 32nd ACM International Conference on Multimedia, Melbourne VIC, Australia is available at https://doi.org/10.1145/3664647.3680969.en_US
dc.subjectDeep neural networken_US
dc.subjectModel pruningen_US
dc.subjectModule detectionen_US
dc.subjectOut-of-distribution generalizationen_US
dc.titleSFP : spurious feature-targeted pruning for out-of-distribution generalizationen_US
dc.typeConference Paperen_US
dc.identifier.spage8412-
dc.identifier.epage8420-
dc.identifier.doi10.1145/3664647.3680969-
dcterms.abstractRecent studies reveal that even highly biased dense networks can contain an invariant substructure with superior out-of-distribution (OOD) generalization. While existing works commonly seek these substructures using global sparsity constraints, the uniform imposition of sparse penalties across samples with diverse levels of spurious contents renders such methods suboptimal. The precise adaptation of model sparsity, specifically tailored for spurious features, remains a significant challenge. Motivated by the insight that in-distribution (ID) data containing spurious features may exhibit lower experiential risk, we propose a novel Spurious Feature-targeted Pruning framework, dubbed SFP, to induce the authentic invariant substructures without referring to the above concerns. Specifically, SFP distinguishes spurious features within ID instances during training by a theoretically validated threshold. It then penalizes the corresponding feature projections onto the model space, steering the optimization towards subspaces spanned by those invariant factors. Moreover, we also conduct detailed theoretical analysis to provide a rationality guarantee and a proof framework for OOD structures based on model sparsity. Experiments on various OOD datasets show that SFP can significantly outperform both structure-based and non-structure-based OOD generalization state-of-the-art (SOTA) methods by large margins.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIn MM ’24: Proceedings of the 32nd ACM International Conference on Multimedia, p. 8412-8420. New York, NY: The Association for Computing Machinery, 2024-
dcterms.issued2024-
dc.identifier.scopus2-s2.0-85209796463-
dc.relation.ispartofbookMM ’24: Proceedings of the 32nd ACM International Conference on Multimedia-
dc.relation.conferenceACM International Conference on Multimedia [MM]-
dc.publisher.placeNew York, NYen_US
dc.description.validate202601 bcch-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_Scopus/WOSen_US
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextThis research was supported by funding from the Hong Kong RGC General Research Fund (No. 152211/23E, 152164/24E, 152203/20E, 152244/21E, 152169/22E, 152228/23E), Research Impact Fund (No. R5060-19, No. R5034-18), Areas of Excellence Scheme (AoE/E-601/22-R), the National Natural Science Foundation of China (No. 62102327, 62192781, 62172326, and 62137002), the PolyU Internal Fund (No. P0043932), the Key-Area Research and Development Program of Guangdong Province (No. 2021B0101400003), and the Project of China Knowledge Centre for Engineering Science and Technology.This research was also supported by NVIDIA AI Technology Center.en_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryCCen_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
3664647.3680969.pdf2.15 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.