在资源受限下自适应应对数据分布变化,提升模型长期准确性
RCCDA: Adaptive Model Updates in the Presence of Concept Drift under a Constrained Resource Budget
- 基于历史损失与可调阈值动态决定更新时机,避免频繁训练
- 理论证明更新频率和资源消耗可控,性能稳定不下降
- 适合实时系统部署,尤其在计算资源紧张时表现更优
在真实场景中,机器学习模型常面临数据分布随时间变化(概念漂移)的挑战。当必须在严格资源限制下维持模型性能时,现有方法往往依赖高开销的漂移检测机制,且无法保证资源使用上限或提供理论性能保障。为此,我们提出RCCDA:一种利用历史损失信息和可调漂移阈值的动态更新策略,通过分析模型损失在任意更新决策下的演化规律,结合李雅普诺夫漂移-惩罚框架,设计出轻量级、贪心最优的更新政策,可严格限制更新频率与成本。在四个领域泛化数据集上的实验表明,该策略在多种概念漂移模式下,均以更低资源开销实现了更高的推理准确率,显著优于基线方法,特别适用于实时机器学习部署。
原文摘要 · Abstract (English)
Machine learning (ML) algorithms deployed in real-world environments are often faced with the challenge of adapting models to concept drift, where the task data distributions are shifting over time. The problem becomes even more difficult when model performance must be maintained under adherence to strict resource constraints. Existing solutions often depend on drift-detection methods that produce high computational overhead for resource-constrained environments, and fail to provide strict guarantees on resource usage or theoretical performance assurances. To address these shortcomings, we propose RCCDA: a dynamic model update policy that optimizes ML training dynamics while ensuring compliance to predefined resource constraints, utilizing only past loss information and a tunable drift threshold. In developing our policy, we analytically characterize the evolution of model loss under concept drift with arbitrary training update decisions. Integrating these results into a Lyapunov drift-plus-penalty framework produces a lightweight greedy-optimal policy that provably limits update frequency and cost. Experimental results on four domain generalization datasets demonstrate that our policy outperforms baseline methods in inference accuracy while adhering to strict resource constraints under several schedules of concept drift, making our solution uniquely suited for real-time ML deployments.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。