arXiv:2511.11439cs.LGcs.AI2025-11中稿 · USENIX Security 20…

提出无需历史数据的持续学习方法,有效防止安全模型遗忘旧知识。

Retrofit: Continual Learning with Controlled Forgetting for Binary Security Detection and Analysis

  • 通过低秩稀疏约束与置信度仲裁机制控制参数更新,实现可控遗忘。
  • 在恶意软件检测中保留率从20.2%提升至38.6%,超越基准与理想上限。
  • 适用于敏感安全场景,适合需长期维护的二进制分析系统。

二进制安全分析日益依赖深度学习来推理恶意行为与程序语义。然而,随着威胁环境演变和代码表示变化,模型性能常发生退化。尽管持续学习(CL)可通过顺序更新自然应对,但多数现有方法依赖数据重放或无约束更新,在数据敏感的安全环境中应用受限。本文提出RETROFIT,通过在每次更新中调控知识保留与适应性,实现无历史数据的可控遗忘。核心思想是通过无需回溯的参数合并,融合先前训练模型与新微调模型作为知识教师。遗忘控制通过:1)将参数变化限制在低秩稀疏子空间以近似正交性;2)采用置信度引导的动态聚合机制,综合双教师知识。在两项典型任务上的评估表明,RETROFIT持续缓解遗忘并保持适应性。在时间漂移下的恶意软件检测中,保留率从20.2%提升至38.6%,超越所有基线并超过理想上界;在跨反汇编层级的二进制摘要任务中,其BLEU得分超迁移学习方法两倍以上,并在跨表示泛化上优于所有基线。

原文摘要 · Abstract (English)

Binary security has increasingly relied on deep learning to reason about malware behavior and program semantics. However, the performance often degrades as threat landscapes evolve and code representations shift. While continual learning (CL) offers a natural solution through sequential updates, most existing approaches rely on data replay or unconstrained updates, limiting their applicability and effectiveness in data-sensitive security environments. We propose RETROFIT, which regulates knowledge retention and adaptation with controlled forgetting at each update, without requiring historical data. Our key idea is to consolidate previously trained and newly fine-tuned models, serving as teachers of legacy and emergent knowledge, through retrospective-free parameter merging. Forgetting control is achieved by 1) constraining parameter changes to low-rank and sparse subspaces for approximate orthogonality, and 2) employing a confidence-guided arbitration mechanism to dynamically aggregate knowledge from both teachers. Our evaluation on two representative applications demonstrates that RETROFIT consistently mitigates forgetting while maintaining adaptability. In malware detection under temporal drift, it substantially improves the retention score, from 20.2% to 38.6% over CL baselines, and exceeds the oracle upper bound on new data. In binary summarization across decompilation levels, where analyzing stripped binaries is especially challenging, RETROFIT achieves over 2x the BLEU score of transfer learning used in prior work and surpasses all baselines in cross-representation generalization.

持续学习二进制分析恶意软件检测

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。