Xiangxiang Dai

Xiangxiang Dai

Auto-generated profile, based on publicly available information

Xiangxiang Dai

Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 March 2022 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
XDXiangxiang Dai
Xiangxiang Dai
PYPeng Yang
Peng Yang
XZXinyu Zhang
Xinyu Zhang
ZDZhewei Dai
Zhewei Dai
LYLi Yu
Li Yu
Video camera plays a growing important role in advancing industrial control towards a higher level of automation. Thus, video analytics become highly demanded, especially for low-latency and high-accuracy analytic results. Yet, the data volume produced by camera clusters is prohibitively high. In this article, we propose Respire , a system that can remove redundant frames for reducing the cost of transmission and processing based on edge computing nodes, while maintaining useful frames for high analytic accuracy. Specifically, Respire incorporates a new way for characterizing the spatial–temporal redundancy between frames. Then, Respire prioritizes the uploading of frames for redundancy reduction. As the search space of the entire collected frames is exponential for the set of frames containing the maximal information, we jointly consider offline and online pruning of frames and propose a heuristic algorithm to reduce the search space. Extensive real-world dataset-based experiments demonstrate that the proposed system can significantly reduce communication and computation costs, while providing sufficient information for guaranteed video analytic accuracy.

4 July 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
XDXiangxiang Dai
Xiangxiang Dai
ZWZhiyong Wang
Zhiyong Wang
JXJize Xie
Jize Xie
XLXutong Liu
Xutong Liu
JLJohn C.S. Lui
John C.S. Lui
In the domain of conversational recommendation systems (CRSs), the development of recommenders capable of eliciting user preferences through conversation has marked a significant advancement. These systems have been enhanced by incorporating conversational key-terms related to items, which streamline the recommendation process by reducing the extensive exploration that traditional interactive recommenders necessitate. Despite these advancements, CRSs still face significant challenges. The vast number of users and the difficulty in accurately capturing preferences lead to persistent inaccuracies, even when direct user interactions are employed to refine the understanding of user preferences. To tackle these challenges, we propose two innovative bandit algorithms: RCLUMB (Robust Clustering of Misspecified Bandits) and RSCLUMB (Robust Set-based Clustering of Misspecified Bandits). These algorithms employ dynamic graphs and evolving cluster sets, respectively, to represent the changing structure of user preferences, thus leveraging collaborative user preferences to accelerate the learning process. Our algorithms are designed to be resilient against errors in preference modeling and the resulting inaccuracies in clustering. We rigorously analyze the performance of our algorithms and establish regret upper bounds of $O(\epsilon _*T\sqrt{md\log T} + d\sqrt{mT}\log T)$ under milder assumptions than previous works, matching the state-of-the-art results in several degenerate cases. Through extensive experiments on synthetic and real-world datasets, our algorithms demonstrate superior performance over existing algorithms.

24 February 2025 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
JHJiawei Hou
Jiawei Hou
PYPeng Yang
Peng Yang
XDXiangxiang Dai
Xiangxiang Dai
TQTian Qin
Tian Qin
FLFeng Lyu
Feng Lyu
In this paper, we investigate the problem of enhancing cooperative LiDAR-based perception accuracy in vehicular edge networks. The key to solving this problem is the selection of connected and autonomous vehicles (CAVs) that can collectively provide maximum perception performance. In specific, extensive motivating experiments on an open benchmark dataset are conducted, which reveal that the cooperative perception accuracy is a submodular combination of selected CAVs, and such selection is non-trivial due to high vehicular mobility as well as unstable vehicular network conditions. Then, we develop an Edge coordinated COoperative Perception (ECOP) framework, taking into account both cooperative vehicle selection and adaptive bandwidth allocation. The novelty of the ECOP design is threefold. First, a new metric named perceptual gain is designed, which properly quantifies the individual perception contributions of each CAV without incurring additional computational overhead. Secondly, an online vehicle selection strategy, which utilizes continual learning to assess the perceptual gain of each CAV, is devised. Theoretical analysis indicates that the proposed vehicle selection strategy can achieve asymptotically diminishing learning regret, highlighting its effectiveness in adapting to vehicular mobility. Finally, an optimal bandwidth allocation method is proposed, which can adapt to heterogeneous and unstable vehicular network conditions. Simulation results demonstrate that, compared with other benchmarks, ECOP can select vehicle sets with the highest cooperative perception accuracy and ensure real-time perception in the presence of fluctuating bandwidth. Furthermore, a case study is presented to visualize the effectiveness of the proposed ECOP framework.

28 October 2024
Verified
Conference Paper
Open access
XDXiangxiang Dai
Xiangxiang Dai
ZZZeyu Zhang
Zeyu Zhang
PYPeng Yang
Peng Yang
YXYuedong Xu
Yuedong Xu
XLXutong Liu
Xutong Liu
JLJohn C.S. Lui
John C.S. Lui
The rapid evolution of multimedia and computer vision technologies requires adaptive visual model deployment strategies to effectively handle diverse tasks and varying environments. This work introduces AxiomVision, a novel framework that can guarantee accuracy by leveraging edge computing to dynamically select the most efficient visual models for video analytics under diverse scenarios. Utilizing a tiered edge-cloud architecture, AxiomVision enables the deployment of a broad spectrum of visual models, from lightweight to complex DNNs, that can be tailored to specific scenarios while considering camera source impacts. In addition, AxiomVision provides three core innovations: (1) a dynamic visual model selection mechanism utilizing continual online learning, (2) an efficient online method that efficiently takes into account the influence of the camera's perspective, and (3) a topology-driven grouping approach that accelerates the model selection process. With rigorous theoretical guarantees, these advancements provide a scalable and effective solution for visual tasks inherent to multimedia systems, such as object detection, classification, and counting. Empirically, AxiomVision achieves a 25.7% improvement in accuracy.

22 August 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Open access
XDXiangxiang Dai
Xiangxiang Dai
ZWZhiyong Wang
Zhiyong Wang
JXJize Xie
Jize Xie
TYTong Yu
Tong Yu
JLJohn C. S. Lui
John C. S. Lui
Conversational recommendation systems (CRSs) are increasingly prevalent, but they are susceptible to the influence of corrupted user behaviors, such as deceptive click ratings. These behaviors can skew the recommendation process, resulting in suboptimal results. Traditional bandit algorithms, which are typically oriented to single users, do not capitalize on implicit social connections between users, which could otherwise enhance learning efficiency. Furthermore, they cannot identify corrupted users in a real-time, multi-user environment. In this paper, we propose a novel bandit problem, Online Learning and Detecting Corrupted Users (OLDCU), to learn and utilize unknown user relations from disrupted behaviors to speed up learning and detect corrupted users in an online setting. This problem is non-trivial due to the dynamic nature of user behaviors and the difficulty of online detection. To robustly learn and leverage the unknown relations among potentially corrupted users, we propose a novel bandit algorithm RCLUB-WCU, incorporating a conversational mechanism. This algorithm is designed to handle the complexities of disrupted behaviors and to make accurate user relation inferences. To detect corrupted users with bandit feedback, we further devise a novel online detection algorithm, OCCUD, which is based on RCLUB-WCU's inferred user relations and designed to adapt over time. We prove a sub-linear regret bound for RCLUB-WCU, demonstrating its efficiency. We also analyze the detection accuracy of OCCUD, showing its effectiveness in identifying corrupted users. Through extensive experiments, we validate the performance of our methods. Our results show that RCLUB-WCU and OCCUD outperform previous bandit algorithms and achieve high corrupted user detection accuracy, providing robust and efficient solutions in the field of CRSs.

15 December 2025 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
YLYuxin Liang
Yuxin Liang
PYPeng Yang
Peng Yang
XDXiangxiang Dai
Xiangxiang Dai
YHYuanyuan He
Yuanyuan He
FLFeng Lyu
Feng Lyu
In this paper, we design an edge-assisted mobile Artificial Intelligence-Generated Content (AIGC) service system. The core of this system is the orchestrated multi-dimensional resource allocation and generative AI model deployment for efficient AIGC service provisioning at the edge. The heterogeneous resource demands of these models strain scarce resources of edge servers. This scarcity calls for a resource-efficient allocation policy whose goal conflicts with ensuring resource fairness for tasks requested by concurrent users. Specifically, such a policy risks enabling resource monopolization by certain tasks, starving others. To address these challenges, we start by characterizing behaviors of the resource demand, fairness-efficiency trade-off and model deployment, including the dominant resource and recency-aware model reuse. Accordingly, the system incorporates two key modules that work in tandem: an Elastic Multi-Resource Allocator, employs a δ-fairness elastic allocation policy to balance fairness and efficiency by controlling deviations from absolute fairness; and a Model Deployment Manager, updates deployment status by adapting model recency and storage cost. To jointly optimize the actions of both modules, we formulate a mixed-integer nonlinear programming problem. Considering timescale decoupling between the per-slot resource allocation and sporadic model deployment, we decouple it into two subproblems and solve them via meta-heuristics and progressive filling. Extensive experimental results reveal the effectiveness of our system, which improves the utility of resource allocation by up to 17.39%, and the utility of model deployment by 11.22% while ensuring fairness, as well as its scalability under increased user concurrency.