Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/113746
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Data Science and Artificial Intelligenceen_US
dc.contributorDepartment of Computingen_US
dc.creatorLin, Wen_US
dc.creatorLan, Hen_US
dc.creatorHe, Hen_US
dc.creatorLi, Ben_US
dc.date.accessioned2025-06-19T09:04:06Z-
dc.date.available2025-06-19T09:04:06Z-
dc.identifier.issn1545-5971en_US
dc.identifier.urihttp://hdl.handle.net/10397/113746-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rights© 2025 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.en_US
dc.rightsThe following publication W. Lin, H. Lan, H. He and B. Li, "Graph-Relational Federated Learning: Enhanced Personalization and Robustness," in IEEE Transactions on Dependable and Secure Computing, vol. 22, no. 5, pp. 5773-5785, Sept.-Oct. 2025 is available at https://doi.org/10.1109/TDSC.2025.3574329.en_US
dc.subjectGraph neural networksen_US
dc.subjectGraph-relational enhanced federationen_US
dc.subjectPersonalized federated learningen_US
dc.titleGraph-relational federated learning : enhanced personalization and robustnessen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage5773en_US
dc.identifier.epage5785en_US
dc.identifier.volume22en_US
dc.identifier.issue5en_US
dc.identifier.doi10.1109/TDSC.2025.3574329en_US
dcterms.abstractHypernetwork has recently emerged as a promising technique to generate personalized models in federated learning (FL). However, existing works tend to treat each client equally and independently — each client contributes equally to learning the hypernetwork, and their representations are independent in the hypernetwork. Such an independent treatment ignores topological structures among different clients, which are usually reflected in the heterogeneity of client data distribution. In this work, we propose panacea, a novel FL framework that can incorporate client relations as a graph to facilitate learning and personalization by using graph hypernetwork. Empirically, we show panacea achieves state-of-the-art performance in terms of both accuracy and speed on multiple benchmarks. Further, panacea improves the robustness by leveraging the client relation graph. Specifically, it (1) generalizes better to the novel clients outside of the training and (2) is more resilient to various adversarial attacks, including model poisoning and backdoor attacks, which is also proved by our theoretical analysis.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIEEE transactions on dependable and secure computing, Sept-Oct. 2025, v. 22, no. 5, p. 5773-5785en_US
dcterms.isPartOfIEEE transactions on dependable and secure computingen_US
dcterms.issued2025-09-
dc.identifier.eissn1941-0018en_US
dc.description.validate202506 bcchen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumbera3716-
dc.identifier.SubFormID50829-
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextNational Natural Science Foundation of Chinaen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Lin_Graph-relational_Federated_Learning.pdfPre-Published version5.51 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
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.