Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Caiyi Liu

dblp:417/2236 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0000-0001-8048-222XORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Edge and fog computing · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Edge and fog computing › resource management
computation resource allocation
1.012026
Joint Optimization of Model Retraining and Inference Services in DT-Assisted Edge Computing · IEEE Trans. Netw. 2026
Edge and fog computing
edge intelligence
1.012026
Joint Optimization of Model Retraining and Inference Services in DT-Assisted Edge Computing · IEEE Trans. Netw. 2026
Edge and fog computing › resource management
edge resource management
1.012026
Joint Optimization of Model Retraining and Inference Services in DT-Assisted Edge Computing · IEEE Trans. Netw. 2026
Edge and fog computing › digital twin
digital twin-assisted edge computing
0.312026
Joint Optimization of Model Retraining and Inference Services in DT-Assisted Edge Computing · IEEE Trans. Netw. 2026

Methods — techniques the papers use, named apart from their topics

online algorithm · 1.0multi-armed bandit · 1.0integer linear programming · 1.0
YearPublicationVenuePosition
2026 Joint Optimization of Model Retraining and Inference Services in DT-Assisted Edge Computing
abstract
With the advance of emerging digital twin (DT) technology, the combination of DT with edge intelligence brings great potential for high-fidelity, delay-sensitive inference services at the network edge. Due to the training data drift over time, the accuracy of an inference model degrades dramatically. To maintain and/or enhance its accuracy, the service model requires to be continuously retrained using newly generated update data. However, model retraining and inference services compete with each other for the limited computing resource in a mobile edge computing network (MEC), which may decrease user satisfaction with services due to unbearable service delays caused by insufficient resource supplies. Therefore, to ensure high fidelity of service models by choosing models for retraining while maximizing user satisfaction, it becomes a great challenge to allocate the limited computing resource in an MEC to both model retraining and inference services. In this paper, we investigate fidelity-aware, delay-sensitive services in a DT-assisted MEC network over a given time horizon. We study a novel user satisfaction maximization problem with the aim to maximize the long-term user satisfaction on services. We first formulate an integer linear programming (ILP) solution to its offline version. We then devise an online algorithm for the problem with a bounded expected cumulative regret, by leveraging an efficient prediction mechanism and a multi-armed bandit (MAB) based resource allocation strategy. Finally, we evaluate the performance of the proposed algorithm via simulations. Simulation results demonstrate that the proposed algorithm is promising, outperforming the comparison benchmarks.
Xuan Ai, Weifa Liang, Caiyi Liu
IEEE Trans. Netw.3