<p>Software defect prediction (SDP) is a critical task in software engineering, aiming to identify fault-prone modules before deployment. This paper introduces the Efficient Communication Federated Meta-Learning (ECFML) framework for cross-project defect prediction (CPDP). ECFML integrates Model-Agnostic Meta-Learning (MAML) with a lightweight Mobile Vision Transformer (MobileViT)-inspired backbone adapted for tabular software metrics. Feature vectors are projected into token sequences and processed via 1D convolutions and transformer mixing, enabling effective representation learning with a compact footprint (<InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_24440_Article_IEq1.gif" Format="GIF" Height="6" Rendition="HTML" Resolution="72" Type="Linedraw" Width="17" /> </InlineMediaObject> <EquationSource Format="TEX">\(\sim\)</EquationSource> </InlineEquation>142&#xa0;k parameters, <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_24440_Article_IEq1.gif" Format="GIF" Height="6" Rendition="HTML" Resolution="72" Type="Linedraw" Width="17" /> </InlineMediaObject> <EquationSource Format="TEX">\(\sim\)</EquationSource> </InlineEquation>0.54&#xa0;MB). This design reduces both computation and communication overhead in federated environments. Experiments on the AEEEM benchmark (EQ, JDT, PDE) show that ECFML achieves competitive or superior performance compared to ResNet-18 and U-Net. On EQ, it yields the highest gains in F1-score and AUC; on PDE it consistently improves F1-score and G-Mean; and on JDT it achieves performance comparable to strong baselines, reflecting stable generalization across heterogeneous projects. Privacy is enforced via Laplace Differential Privacy with a fixed clipping bound specified a priori, ensuring pure <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_24440_Article_IEq3.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="11" /> </InlineMediaObject> <EquationSource Format="TEX">\(\varepsilon\)</EquationSource> </InlineEquation>-DP guarantees per round under conservative composition (<InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_24440_Article_IEq4.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="78" /> </InlineMediaObject> <EquationSource Format="TEX">\(\varepsilon _{\text {total}} = T \varepsilon\)</EquationSource> </InlineEquation>). Robustness analysis further shows that the framework maintains stronger performance than baselines under additive Gaussian noise and FGSM perturbations, though degradation remains under stronger adversarial settings. Overall, ECFML strikes a balance between predictive accuracy, privacy preservation, and communication efficiency, making it a viable solution for federated, privacy-sensitive software repositories.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A privacy-preserving federated meta-learning framework for cross-project defect prediction in software systems

  • Jhansi Lakshmi Potharlanka,
  • Kareena Yashmin Shaik,
  • Bharath Kumar N

摘要

Software defect prediction (SDP) is a critical task in software engineering, aiming to identify fault-prone modules before deployment. This paper introduces the Efficient Communication Federated Meta-Learning (ECFML) framework for cross-project defect prediction (CPDP). ECFML integrates Model-Agnostic Meta-Learning (MAML) with a lightweight Mobile Vision Transformer (MobileViT)-inspired backbone adapted for tabular software metrics. Feature vectors are projected into token sequences and processed via 1D convolutions and transformer mixing, enabling effective representation learning with a compact footprint ( \(\sim\) 142 k parameters, \(\sim\) 0.54 MB). This design reduces both computation and communication overhead in federated environments. Experiments on the AEEEM benchmark (EQ, JDT, PDE) show that ECFML achieves competitive or superior performance compared to ResNet-18 and U-Net. On EQ, it yields the highest gains in F1-score and AUC; on PDE it consistently improves F1-score and G-Mean; and on JDT it achieves performance comparable to strong baselines, reflecting stable generalization across heterogeneous projects. Privacy is enforced via Laplace Differential Privacy with a fixed clipping bound specified a priori, ensuring pure \(\varepsilon\) -DP guarantees per round under conservative composition ( \(\varepsilon _{\text {total}} = T \varepsilon\) ). Robustness analysis further shows that the framework maintains stronger performance than baselines under additive Gaussian noise and FGSM perturbations, though degradation remains under stronger adversarial settings. Overall, ECFML strikes a balance between predictive accuracy, privacy preservation, and communication efficiency, making it a viable solution for federated, privacy-sensitive software repositories.