Pith. sign in

REVIEW 4 cited by

Cost-Effective Retraining of Machine Learning Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.04216 v1 pith:6PNG34KT submitted 2023-10-06 cs.LG

classification cs.LG
keywords retrainingmodelcaracostsdataretraintrade-offalgorithm
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

It is important to retrain a machine learning (ML) model in order to maintain its performance as the data changes over time. However, this can be costly as it usually requires processing the entire dataset again. This creates a trade-off between retraining too frequently, which leads to unnecessary computing costs, and not retraining often enough, which results in stale and inaccurate ML models. To address this challenge, we propose ML systems that make automated and cost-effective decisions about when to retrain an ML model. We aim to optimize the trade-off by considering the costs associated with each decision. Our research focuses on determining whether to retrain or keep an existing ML model based on various factors, including the data, the model, and the predictive queries answered by the model. Our main contribution is a Cost-Aware Retraining Algorithm called Cara, which optimizes the trade-off over streams of data and queries. To evaluate the performance of Cara, we analyzed synthetic datasets and demonstrated that Cara can adapt to different data drifts and retraining costs while performing similarly to an optimal retrospective algorithm. We also conducted experiments with real-world datasets and showed that Cara achieves better accuracy than drift detection baselines while making fewer retraining decisions, ultimately resulting in lower total costs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Provable unlearning in topic modeling and downstream tasks

    cs.LG 2024-11 conditional novelty 7.0 of 10

    Provable (epsilon, delta)-unlearning algorithms for topic models achieve deletion capacity O~(m/(r^2 sqrt(nr))) before fine-tuning and O~(m q/(r sqrt(nr))) after fine-tuning, with the base model untouched in the downs...

  2. LYRA: Label-Free Structural Synchronization and Resource Allocation for UAV Edge Networks

    cs.NI 2026-08 conditional novelty 6.0 of 10

    A label-free disagreement signal and Lyapunov-guided reinforcement learning jointly schedule when and how deeply a UAV edge model should synchronize with a ground oracle.

  3. Optimal Resource Allocation for ML Model Training and Deployment under Concept Drift

    cs.LG 2025-12 reject novelty 6.0 of 10

    Optimal training uses a single front-loaded burst when concept durations are DMRL, and back-loading when they are IMRL; deployment schedules are treated as quasi-convex optimization problems.

  4. Lightweight PID-Based Drift Mitigation for Cellular Traffic Forecasting

    cs.ET 2026-08 conditional novelty 4.0 of 10

    A PID controller layer that adjusts a frozen forecasting model's output reduces MAE and RMSE under injected concept drift in cellular traffic, with up to 30.18% average MAE mitigation on a 16-cell subset.

Pith tools