RCCDA: Adaptive Model Updates in the Presence of Concept Drift under a Constrained Resource Budget
Adam Piaseczny, Md Kamran Chowdhury Shisher, Shiqiang Wang, Christopher G. Brinton

TL;DR
This paper introduces RCCDA, a resource-efficient adaptive model update policy for machine learning under concept drift, ensuring high accuracy and strict resource adherence without high computational overhead.
Contribution
We propose RCCDA, a novel, lightweight, and theoretically grounded policy for adaptive model updates that guarantees resource constraints during concept drift.
Findings
Outperforms baseline methods in accuracy under resource constraints
Provably limits update frequency and cost
Effective on multiple domain generalization datasets
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsData Stream Mining Techniques · Advanced Data Storage Technologies · Peer-to-Peer Network Technologies
