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

Huaiguang Cai

dblp:378/1681 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none

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

Computer networks · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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 · 50% Network optimization and economics · 50%
Artificial intelligence
1 paper
Transfer learning and domain adaptation · 100%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation › model adaptation
model retraining
0.812024
Online Resource Allocation for Edge Intelligence with Colocated Model Retraining and Inference · INFOCOM 2024
Edge and fog computing
edge intelligence
0.812024
Online Resource Allocation for Edge Intelligence with Colocated Model Retraining and Inference · INFOCOM 2024
Network optimization and economics
resource allocation
0.812024
Online Resource Allocation for Edge Intelligence with Colocated Model Retraining and Inference · INFOCOM 2024
Machine learning and data management
inference serving
0.212024
Online Resource Allocation for Edge Intelligence with Colocated Model Retraining and Inference · INFOCOM 2024

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

online approximation algorithm · 2.3competitive ratio analysis · 2.3
YearPublicationVenuePosition
2025 Shapley value-based class activation mapping for improved explainability in neural networks
Huaiguang Cai, Yang Yang 0056, Yongqiang Tang, Zhengya Sun, Wensheng Zhang 0002
Vis. Comput.1
2024 Online Resource Allocation for Edge Intelligence with Colocated Model Retraining and Inference
abstract
With edge intelligence, AI models are increasingly push to the edge to serve ubiquitous users. However, due to the drift of model, data, and task, AI model deployed at the edge suffers from degraded accuracy in the inference serving phase. Model retraining handles such drifts by periodically retraining the model with newly arrived data. When colocating model retraining and model inference serving for the same model on resource-limited edge servers, a fundamental challenge arises in balancing the resource allocation for model retraining and inference, aiming to maximize long-term inference accuracy. This problem is particularly difficult due to the underlying mathematical formulation being time-coupled, non-convex, and NP-hard. To address these challenges, we introduce a lightweight and explainable online approximation algorithm, named ORRIC, designed to optimize resource allocation for adaptively balancing the accuracy of model training and inference. The competitive ratio of ORRIC outperforms that of the traditional Inference-Only paradigm, especially when data drift persists for a sufficiently lengthy time. This highlights the advantages and applicable scenarios of colocating model retraining and inference. Notably, ORRIC can be translated into several heuristic algorithms for different resource environments. Experiments conducted in real scenarios validate the effectiveness of ORRIC.
Huaiguang Cai, Zhi Zhou 0006, Qianyi Huang
INFOCOM1