Yuanzhang Xiao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yuanzhang Xiao has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- Linqi Song
City University of Hong Kong
6 shared publications - Sichun Luo
City University of Hong Kong, Hong Kong, Hong Kong and City University of Hong Kong Shenzhen Research Institute, Shenzhen, China
4 shared publications - Aojun Zhou
Chinese University of Hong Kong, Hong Kong
2 shared publications - Bowei He
MBZUAI, Abu Dhabi, United Arab Emirates and McGill University, Montreal, Canada
2 shared publications - Douglas Ellman
University of Hawaii at Manoa
2 shared publications - Juinn-Horng Deng
Department of Electronic Engineering, Yuan Ze University, Chungli, Taoyuan 32003, Taiwan
2 shared publications
Latest Publications
- Top Cited Papers
- 16 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Signal Processing
- Vol. 20 (1) , 77-89
Integrating Large Language Models Into Recommendation via Mutual Augmentation and Adaptive Aggregation
Conventional recommender systems and Large Language Model (LLM)-based recommender systems each have their strengths and weaknesses. While conventional recommendation methods excel at mining collaborative information and modeling sequential behavior, they struggle with data sparsity and the long-tail problem. LLM, on the other hand, is proficient at utilizing rich textual contexts but faces challenges in mining collaborative or sequential information. Despite their individual successes, there is a significant gap in leveraging their ensemble potential to enhance recommendation performance. In this paper, we introduce a general and model-agnostic framework known as Large language models with mutual augmentation and adaptive aggregation for Recommendation (Llama4Rec), aiming to bridge this gap via explicitly ensemble LLM and conventional recommendation model for more effective recommendation. We propose data augmentation and prompt augmentation strategies tailored to enhance the conventional recommendation model and LLM respectively. An adaptive aggregation module is adopted to combine the predictions of both kinds of models to refine the final recommendation results. Empirical studies on three datasets validate the superiority of Llama4Rec, demonstrating significant improvements in recommendation performance.
- 16 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Signal Processing
- Vol. 20 (1) , 77-89
Top Cited PapersIntegrating Large Language Models Into Recommendation via Mutual Augmentation and Adaptive Aggregation
Conventional recommender systems and Large Language Model (LLM)-based recommender systems each have their strengths and weaknesses. While conventional recommendation methods excel at mining collaborative information and modeling sequential behavior, they struggle with data sparsity and the long-tail problem. LLM, on the other hand, is proficient at utilizing rich textual contexts but faces challenges in mining collaborative or sequential information. Despite their individual successes, there is a significant gap in leveraging their ensemble potential to enhance recommendation performance. In this paper, we introduce a general and model-agnostic framework known as Large language models with mutual augmentation and adaptive aggregation for Recommendation (Llama4Rec), aiming to bridge this gap via explicitly ensemble LLM and conventional recommendation model for more effective recommendation. We propose data augmentation and prompt augmentation strategies tailored to enhance the conventional recommendation model and LLM respectively. An adaptive aggregation module is adopted to combine the predictions of both kinds of models to refine the final recommendation results. Empirical studies on three datasets validate the superiority of Llama4Rec, demonstrating significant improvements in recommendation performance.
- Open Access
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 159582-159596
Spatial Nulling and MIMO Pre-Processing Design for Dual mmWave Active Array SDR Platform With OTA Effects
This research studies transmit pre-processing designs using two millimeter wave (mmWave) active arrays with a multiple input multiple output (MIMO) software-defined radio (SDR) platform under an over-the-air (OTA) communication emulator. It covers the fast Doppler, line-of-sight (LOS) with small delay effect, and MIMO array interference effects. In this emulator, we propose spatial nulling and MIMO pre-processing cancellation techniques to eliminate the MIMO streams interference. First, differential training sequences are utilized to acquire and compensate for the LOS fast Doppler offset. Next, a maximum power beam scanning scheme via the phase shifters of mmWave arrays is employed to estimate the arrival angles between MIMO array transmitter and receiver stations. Subsequently, the steering vectors of the desired and interference signals via these estimated angles are adopted by the phase-only optimization algorithms to calculate the spatial beamforming weights of the two mmWave arrays, which can null the interference stream and retain the desired stream. Because we observed that the residual MIMO interference lingers in the MIMO receiver even after the spatial nulling processing with the interference mitigation, we further propose a MIMO pre-processing filters using the least square method to cancel the residual MIMO interference. Finally, the measurement results of the two mmWave arrays SDR platform with the fast Doppler and the OTA scenarios confirm that the proposed joint spatial nulling and MIMO pre-cancellation techniques can eliminate the MIMO interference and provide the high-quality error vector magnitude (EVM) performance.
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 159582-159596
Open AccessSpatial Nulling and MIMO Pre-Processing Design for Dual mmWave Active Array SDR Platform With OTA Effects
This research studies transmit pre-processing designs using two millimeter wave (mmWave) active arrays with a multiple input multiple output (MIMO) software-defined radio (SDR) platform under an over-the-air (OTA) communication emulator. It covers the fast Doppler, line-of-sight (LOS) with small delay effect, and MIMO array interference effects. In this emulator, we propose spatial nulling and MIMO pre-processing cancellation techniques to eliminate the MIMO streams interference. First, differential training sequences are utilized to acquire and compensate for the LOS fast Doppler offset. Next, a maximum power beam scanning scheme via the phase shifters of mmWave arrays is employed to estimate the arrival angles between MIMO array transmitter and receiver stations. Subsequently, the steering vectors of the desired and interference signals via these estimated angles are adopted by the phase-only optimization algorithms to calculate the spatial beamforming weights of the two mmWave arrays, which can null the interference stream and retain the desired stream. Because we observed that the residual MIMO interference lingers in the MIMO receiver even after the spatial nulling processing with the interference mitigation, we further propose a MIMO pre-processing filters using the least square method to cancel the residual MIMO interference. Finally, the measurement results of the two mmWave arrays SDR platform with the fast Doppler and the OTA scenarios confirm that the proposed joint spatial nulling and MIMO pre-cancellation techniques can eliminate the MIMO interference and provide the high-quality error vector magnitude (EVM) performance.
- Top Cited PapersOpen Access
- 10 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 43 (5) , 1-31
RecRanker: Instruction Tuning Large Language Model as Ranker for Top-k Recommendation
Large language models (LLMs) have demonstrated remarkable capabilities and have been extensively deployed across various domains, including recommender systems. Prior research has employed specialized prompts to leverage the in-context learning capabilities of LLMs for recommendation purposes. More recent studies have utilized instruction tuning techniques to align LLMs with human preferences, promising more effective recommendations. However, existing methods suffer from several limitations. The full potential of LLMs is not fully elicited due to low-quality tuning data and the overlooked integration of conventional recommender signals. Furthermore, LLMs may generate inconsistent responses for different ranking tasks in the recommendation, potentially leading to unreliable results. In this article, we introduce Ranker for top- k Recommendations (RecRanker), tailored for instruction tuning LLMs to serve as the Ranker for top- k Recommendations. Specifically, we introduce importance-aware sampling, clustering-based sampling, and penalty for repetitive sampling for sampling high-quality, representative, and diverse training data. To enhance the prompt, we introduce a position shifting strategy to mitigate position bias and augment the prompt with auxiliary information from conventional recommendation models, thereby enriching the contextual understanding of the LLM. Subsequently, we utilize the sampled data to assemble an instruction-tuning dataset with the augmented prompts comprising three distinct ranking tasks: pointwise, pairwise, and listwise rankings. We further propose a hybrid ranking method to enhance the model performance by ensembling these ranking tasks. Our empirical evaluations demonstrate the effectiveness of our proposed RecRanker in both direct and sequential recommendation scenarios. 1
- 10 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 43 (5) , 1-31
Top Cited PapersOpen AccessRecRanker: Instruction Tuning Large Language Model as Ranker for Top-k Recommendation
Large language models (LLMs) have demonstrated remarkable capabilities and have been extensively deployed across various domains, including recommender systems. Prior research has employed specialized prompts to leverage the in-context learning capabilities of LLMs for recommendation purposes. More recent studies have utilized instruction tuning techniques to align LLMs with human preferences, promising more effective recommendations. However, existing methods suffer from several limitations. The full potential of LLMs is not fully elicited due to low-quality tuning data and the overlooked integration of conventional recommender signals. Furthermore, LLMs may generate inconsistent responses for different ranking tasks in the recommendation, potentially leading to unreliable results. In this article, we introduce Ranker for top- k Recommendations (RecRanker), tailored for instruction tuning LLMs to serve as the Ranker for top- k Recommendations. Specifically, we introduce importance-aware sampling, clustering-based sampling, and penalty for repetitive sampling for sampling high-quality, representative, and diverse training data. To enhance the prompt, we introduce a position shifting strategy to mitigate position bias and augment the prompt with auxiliary information from conventional recommendation models, thereby enriching the contextual understanding of the LLM. Subsequently, we utilize the sampled data to assemble an instruction-tuning dataset with the augmented prompts comprising three distinct ranking tasks: pointwise, pairwise, and listwise rankings. We further propose a hybrid ranking method to enhance the model performance by ensembling these ranking tasks. Our empirical evaluations demonstrate the effectiveness of our proposed RecRanker in both direct and sequential recommendation scenarios. 1
- Open Access
- 18 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 49836-49851
Joint Space-Time Interference Cancellation for mmWave Active Array SDR Platforms in Coexistent Sensing and Communication Systems
This paper investigates the interference issue between sensing and communication millimeter-wave (mmWave) active arrays, such as the sensing array (SA) and communication array (CA), which share the same time and frequency resources at a base station (BS) in integrated sensing and communication (ISAC) systems. To mitigate interference and improve signal quality at the communication user station (CUS), we propose a joint space-time interference cancellation method. This method integrates spatial interference suppression for SA-BS using a deep nulling weight design with 6-bit phase shifters and temporal pre-weight cancellation for CA-BS. Specifically, for the SA-BS array, deep nulling beamforming is achieved through exhaustive search (ES) or genetic algorithm (GA) techniques, leveraging an initial minimum mean square error (MMSE) weight with a 2-bit least significant bit (LSB) precision. For the CA-BS array, interference is further canceled by regenerating an accurate pre-weighted version of the interference signal, necessitating the channel estimation for both SA-BS and CA-BS arrays. Experimental results from a software-defined radio (SDR) platform equipped with developed dual mmWave active arrays confirm that the proposed space-time interference cancellation method effectively eliminates interference in over-the-air (OTA) environments, thereby enhancing the overall performance of mmWave active array systems practically.
- 18 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 49836-49851
Open AccessJoint Space-Time Interference Cancellation for mmWave Active Array SDR Platforms in Coexistent Sensing and Communication Systems
This paper investigates the interference issue between sensing and communication millimeter-wave (mmWave) active arrays, such as the sensing array (SA) and communication array (CA), which share the same time and frequency resources at a base station (BS) in integrated sensing and communication (ISAC) systems. To mitigate interference and improve signal quality at the communication user station (CUS), we propose a joint space-time interference cancellation method. This method integrates spatial interference suppression for SA-BS using a deep nulling weight design with 6-bit phase shifters and temporal pre-weight cancellation for CA-BS. Specifically, for the SA-BS array, deep nulling beamforming is achieved through exhaustive search (ES) or genetic algorithm (GA) techniques, leveraging an initial minimum mean square error (MMSE) weight with a 2-bit least significant bit (LSB) precision. For the CA-BS array, interference is further canceled by regenerating an accurate pre-weighted version of the interference signal, necessitating the channel estimation for both SA-BS and CA-BS arrays. Experimental results from a software-defined radio (SDR) platform equipped with developed dual mmWave active arrays confirm that the proposed space-time interference cancellation method effectively eliminates interference in over-the-air (OTA) environments, thereby enhancing the overall performance of mmWave active array systems practically.
- 19 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 24 (5) , 4425-4439
Unsupervised AoA Estimation Based on Dual-Path Knowledge-Aware Auto-Encoders
In this paper, an unsupervised deep learning-based framework based on dual-path model-driven auto-encoders (AE) is proposed for angle-of-arrivals (AoAs) estimation in massive MIMO systems. Specifically designed for AoA estimation, the proposed framework differs from the conventional AE in two aspects. Firstly, unlike conventional auto-encoders, our framework employs a dual-path neural network for the encoder, decoupling the estimated parameters and enabling independent updates of each paths. Secondly, the decoder has fixed weights that implement the signal propagation model, instead of learnable parameters. This knowledge-aware decoder ensures the output of meaningful physical parameters (i.e., AoAs) which is unattainable by conventional AEs. We also conduct a thorough analysis to characterize the multiple global optima and local optima of the estimation problem. This analysis inspires the design of a low-complexity two-phase training scheme and confirms the convergence of our proposed framework. Consequently, our framework addresses two key challenges in unsupervised learning: the lack of interpretability and the convergence to local optima. Extensive simulations validate our theoretical analysis and demonstrate the performance improvements of our proposed framework.
- 19 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 24 (5) , 4425-4439
Unsupervised AoA Estimation Based on Dual-Path Knowledge-Aware Auto-Encoders
In this paper, an unsupervised deep learning-based framework based on dual-path model-driven auto-encoders (AE) is proposed for angle-of-arrivals (AoAs) estimation in massive MIMO systems. Specifically designed for AoA estimation, the proposed framework differs from the conventional AE in two aspects. Firstly, unlike conventional auto-encoders, our framework employs a dual-path neural network for the encoder, decoupling the estimated parameters and enabling independent updates of each paths. Secondly, the decoder has fixed weights that implement the signal propagation model, instead of learnable parameters. This knowledge-aware decoder ensures the output of meaningful physical parameters (i.e., AoAs) which is unattainable by conventional AEs. We also conduct a thorough analysis to characterize the multiple global optima and local optima of the estimation problem. This analysis inspires the design of a low-complexity two-phase training scheme and confirms the convergence of our proposed framework. Consequently, our framework addresses two key challenges in unsupervised learning: the lack of interpretability and the convergence to local optima. Extensive simulations validate our theoretical analysis and demonstrate the performance improvements of our proposed framework.
- Open Access
- 31 October 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 15 (5) , 1-24
PerFedRec++: Enhancing Personalized Federated Recommendation with Self-Supervised Pre-Training
Federated recommendation systems employ federated learning techniques to safeguard user privacy by transmitting model parameters instead of raw user data between user devices and the central server. Nevertheless, the current federated recommender system faces three significant challenges: (1) data heterogeneity: the heterogeneity of users’ attributes and local data necessitates the acquisition of personalized models to improve the performance of federated recommendation; (2) model performance degradation: the privacy-preserving protocol design in the federated recommendation, such as pseudo item labeling and differential privacy, would deteriorate the model performance; (3) communication bottleneck: the standard federated recommendation algorithm can have a high communication overhead. Previous studies have attempted to address these issues, but none have been able to solve them simultaneously. In this article, we propose a novel framework, named PerFedRec++ , to enhance the personalized federated recommendation with self-supervised pre-training. Specifically, we utilize the privacy-preserving mechanism of federated recommender systems to generate two augmented graph views, which are used as contrastive tasks in self-supervised graph learning to pre-train the model. Pre-training enhances the performance of federated models by improving the uniformity of representation learning. Also, by providing a better initial state for federated training, pre-training makes the overall training converge faster, thus alleviating the heavy communication burden. We then construct a collaborative graph to learn the client representation through a federated graph neural network. Based on these learned representations, we cluster users into different user groups and learn personalized models for each cluster. Each user learns a personalized model by combining the global federated model, the cluster-level federated model, and its own fine-tuned local model. Experiments on three real-world datasets show that our proposed method achieves superior performance over existing methods.
- 31 October 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 15 (5) , 1-24
Open AccessPerFedRec++: Enhancing Personalized Federated Recommendation with Self-Supervised Pre-Training
Federated recommendation systems employ federated learning techniques to safeguard user privacy by transmitting model parameters instead of raw user data between user devices and the central server. Nevertheless, the current federated recommender system faces three significant challenges: (1) data heterogeneity: the heterogeneity of users’ attributes and local data necessitates the acquisition of personalized models to improve the performance of federated recommendation; (2) model performance degradation: the privacy-preserving protocol design in the federated recommendation, such as pseudo item labeling and differential privacy, would deteriorate the model performance; (3) communication bottleneck: the standard federated recommendation algorithm can have a high communication overhead. Previous studies have attempted to address these issues, but none have been able to solve them simultaneously. In this article, we propose a novel framework, named PerFedRec++ , to enhance the personalized federated recommendation with self-supervised pre-training. Specifically, we utilize the privacy-preserving mechanism of federated recommender systems to generate two augmented graph views, which are used as contrastive tasks in self-supervised graph learning to pre-train the model. Pre-training enhances the performance of federated models by improving the uniformity of representation learning. Also, by providing a better initial state for federated training, pre-training makes the overall training converge faster, thus alleviating the heavy communication burden. We then construct a collaborative graph to learn the client representation through a federated graph neural network. Based on these learned representations, we cluster users into different user groups and learn personalized models for each cluster. Each user learns a personalized model by combining the global federated model, the cluster-level federated model, and its own fine-tuned local model. Experiments on three real-world datasets show that our proposed method achieves superior performance over existing methods.
- 5 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Signal Processing
- Vol. 18 (3) , 487-501
Adaptive Top-K in SGD for Communication-Efficient Distributed Learning in Multi-Robot Collaboration
Distributed stochastic gradient descent (D-SGD) with gradient compression has become a popular communication-efficient solution for accelerating optimization procedures in distributed learning systems like multi-robot systems. One commonly used method for gradient compression is Top-K sparsification, which sparsifies the gradients by a fixed degree during model training. However, there has been a lack of an adaptive approach with a systematic treatment and analysis to adjust the sparsification degree to maximize the potential of the model's performance or training speed. This paper proposes a novel adaptive Top-K in Stochastic Gradient Descent framework that enables an adaptive degree of sparsification for each gradient descent step to optimize the convergence performance by balancing the trade-off between communication cost and convergence error with respect to the norm of gradients and the communication budget. Firstly, an upper bound of convergence error is derived for the adaptive sparsification scheme and the loss function. Secondly, we consider communication budget constraints and propose an optimization formulation for minimizing the deep model's convergence error under such constraints. We obtain an enhanced compression algorithm that significantly improves model accuracy under given communication budget constraints. Finally, we conduct numerical experiments on general image classification tasks using the MNIST, CIFAR-10 datasets. For the multi-robot collaboration tasks, we choose the object detection task on the PASCAL VOC dataset. The results demonstrate that the proposed adaptive Top-K algorithm in SGD achieves a significantly better convergence rate compared to state-of-the-art methods, even after considering error compensation.
- 5 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Signal Processing
- Vol. 18 (3) , 487-501
Adaptive Top-K in SGD for Communication-Efficient Distributed Learning in Multi-Robot Collaboration
Distributed stochastic gradient descent (D-SGD) with gradient compression has become a popular communication-efficient solution for accelerating optimization procedures in distributed learning systems like multi-robot systems. One commonly used method for gradient compression is Top-K sparsification, which sparsifies the gradients by a fixed degree during model training. However, there has been a lack of an adaptive approach with a systematic treatment and analysis to adjust the sparsification degree to maximize the potential of the model's performance or training speed. This paper proposes a novel adaptive Top-K in Stochastic Gradient Descent framework that enables an adaptive degree of sparsification for each gradient descent step to optimize the convergence performance by balancing the trade-off between communication cost and convergence error with respect to the norm of gradients and the communication budget. Firstly, an upper bound of convergence error is derived for the adaptive sparsification scheme and the loss function. Secondly, we consider communication budget constraints and propose an optimization formulation for minimizing the deep model's convergence error under such constraints. We obtain an enhanced compression algorithm that significantly improves model accuracy under given communication budget constraints. Finally, we conduct numerical experiments on general image classification tasks using the MNIST, CIFAR-10 datasets. For the multi-robot collaboration tasks, we choose the object detection task on the PASCAL VOC dataset. The results demonstrate that the proposed adaptive Top-K algorithm in SGD achieves a significantly better convergence rate compared to state-of-the-art methods, even after considering error compensation.
- Open Access
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 1707-1716
Improving Long-Tail Item Recommendation with Graph Augmentation
The ubiquitous long-tail distribution of inherent user behaviors results in worse recommendation performance for the items with fewer user records (i.e., tail items) than those with richer ones (i.e., head items). Graph-based recommendation methods (e.g., using graph neural networks) have recently emerged as a powerful tool for recommender systems, often outperforming traditional methods. However, existing techniques for alleviating the long-tail problem mainly focus on traditional methods. There is a lack of graph-based methods that can efficiently deal with the long-tail problem. In this paper, we propose a novel approach, Graph Augmentation for Long-tail Recommendation (GALORE), which can be plugged into any graph-based recommendation models to improve the performance for tail items. GALORE incorporates an edge addition module that enriches the graph's connectivity for tail items by injecting additional item-to-item edges. To further balance the graph structure, GALORE utilizes a degree-aware edge dropping strategy, preserving the more valuable edges from the tail items while selectively discarding less informative edges from the head items. Beyond structural augmentation, we synthesize new data samples, thereby addressing the data scarcity issue for tail items. We further introduce a two-stage training strategy to facilitate the learning for both head and tail items. Comprehensive empirical studies conducted on four datasets show that GALORE outperforms existing methods in terms of the performance for tail items as well as the overall performance.
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 1707-1716
Open AccessImproving Long-Tail Item Recommendation with Graph Augmentation
The ubiquitous long-tail distribution of inherent user behaviors results in worse recommendation performance for the items with fewer user records (i.e., tail items) than those with richer ones (i.e., head items). Graph-based recommendation methods (e.g., using graph neural networks) have recently emerged as a powerful tool for recommender systems, often outperforming traditional methods. However, existing techniques for alleviating the long-tail problem mainly focus on traditional methods. There is a lack of graph-based methods that can efficiently deal with the long-tail problem. In this paper, we propose a novel approach, Graph Augmentation for Long-tail Recommendation (GALORE), which can be plugged into any graph-based recommendation models to improve the performance for tail items. GALORE incorporates an edge addition module that enriches the graph's connectivity for tail items by injecting additional item-to-item edges. To further balance the graph structure, GALORE utilizes a degree-aware edge dropping strategy, preserving the more valuable edges from the tail items while selectively discarding less informative edges from the head items. Beyond structural augmentation, we synthesize new data samples, thereby addressing the data scarcity issue for tail items. We further introduce a two-stage training strategy to facilitate the learning for both head and tail items. Comprehensive empirical studies conducted on four datasets show that GALORE outperforms existing methods in terms of the performance for tail items as well as the overall performance.
- 9 October 2023
- Published by Springer Nature
- p. 313-347
Optimized Integration of Distributed Energy Resources and Internet of Things: Control Algorithms, Machine Learning, and Testbeds
- 9 October 2023
- Published by Springer Nature
- p. 313-347
Optimized Integration of Distributed Energy Resources and Internet of Things: Control Algorithms, Machine Learning, and Testbeds
- Open Access
- 8 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 795-797
CPD 2023: The 6th International Workshop on Combining Physical and Data-Driven Knowledge in Ubiquitous Computing
With the proliferation of connected devices with advanced sensing, computing, and communication capabilities, ubiquitous computing systems have become prevalent nowadays. They have the potential to revolutionize various industries by enabling new applications and services (e.g., patient monitoring, personalized recommendations, traffic control, home energy management). However, in real-world ubiquitous computing systems, data collection can be expensive or impossible. Due to the limited quantity and quality of data available, pure data-driven methods may not perform well. A promising approach to overcome these limitations is to utilize physical knowledge, including domain knowledge from experts, heuristics based on experience, and analytic models of physical phenomena. The theme of this workshop is to advance the theoretical understanding, algorithmic development and system implementations of ubiquitous computing systems that integrate physical knowledge with data-driven methods. The workshop will provide an inclusive gathering for researchers and practitioners from various fields and facilitate future collaborations. The workshop welcomes research papers as well as position papers. The overall goal is to grow the community who are dedicated to improving ubiquitous computing systems by fusing physical knowledge into data-driven methods.
- 8 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 795-797
Open AccessCPD 2023: The 6th International Workshop on Combining Physical and Data-Driven Knowledge in Ubiquitous Computing
With the proliferation of connected devices with advanced sensing, computing, and communication capabilities, ubiquitous computing systems have become prevalent nowadays. They have the potential to revolutionize various industries by enabling new applications and services (e.g., patient monitoring, personalized recommendations, traffic control, home energy management). However, in real-world ubiquitous computing systems, data collection can be expensive or impossible. Due to the limited quantity and quality of data available, pure data-driven methods may not perform well. A promising approach to overcome these limitations is to utilize physical knowledge, including domain knowledge from experts, heuristics based on experience, and analytic models of physical phenomena. The theme of this workshop is to advance the theoretical understanding, algorithmic development and system implementations of ubiquitous computing systems that integrate physical knowledge with data-driven methods. The workshop will provide an inclusive gathering for researchers and practitioners from various fields and facilitate future collaborations. The workshop welcomes research papers as well as position papers. The overall goal is to grow the community who are dedicated to improving ubiquitous computing systems by fusing physical knowledge into data-driven methods.