Online Model Retraining and Instance Allocation in Edge Computing Networks

The adoption of deep learning models in V2X scenarios has boosted computing demands in edge computing, while concept drift requires frequent model retraining, further increasing computing resource consumption. However, few works study computing instance allocation considering dynamic model retraining, especially under varying workloads. In this paper, we study the joint online model retraining and instance allocation problem in edge computing networks considering model performance degradation due to concept drift. Solving the online problem is challenging since it is a quadratic binary programming problem and its instance switching cost is time-coupling. We propose an efficient online algorithm, where we first linearize the quadratic term, then regularize the time-linearize the problem and then regularize the timecoupling switching cost to decouple the problem, and finally round the fractional solution by a randomization method. We prove that our proposed algorithm achieves a bounded optimality gap. Simulations demonstrate that our algorithm can achieve a balance between instance costs and model performance.

Authors

Institutions

Publication Details

Published
2025-06-17
DOI
https://doi.org/10.1109/vtc2025-spring65109.2025.11174720
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Online Model Retraining and Instance Allocation in Edge Computing Networks

Shimin Gong, Qian Ma, Fan Yang
Recommender Systems and Techniques
article

Online Model Retraining and Instance Allocation in Edge Computing Networks

Shimin Gong, Qian Ma, Fan Yang
article en

Abstract

The adoption of deep learning models in V2X scenarios has boosted computing demands in edge computing, while concept drift requires frequent model retraining, further increasing computing resource consumption. However, few works study computing instance allocation considering dynamic model retraining, especially under varying workloads. In this paper, we study the joint online model retraining and instance allocation problem in edge computing networks considering model performance degradation due to concept drift. Solving the online problem is challenging since it is a quadratic binary programming problem and its instance switching cost is time-coupling. We propose an efficient online algorithm, where we first linearize the quadratic term, then regularize the time-linearize the problem and then regularize the timecoupling switching cost to decouple the problem, and finally round the fractional solution by a randomization method. We prove that our proposed algorithm achieves a bounded optimality gap. Simulations demonstrate that our algorithm can achieve a balance between instance costs and model performance.

Sun Yat-sen University (CN)
Openalex Percentile: Top 61%
Recommender Systems and Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Online Model Retraining and Instance Allocation in Edge Computing Networks — Shimin Gong, Qian Ma, et al. · (2025) | TGRS Research Map | TGRS