EDBT 2026 Demo / reviewers in the wild / expert
Yang Liu 0165
dblp:51/3710-165 · also Yang Veronica Liu
· DBLP profile ↗
14ranked-venue papers in the field
1as first author
11since 2021 · last 2025
0000-0003-3800-3533ORCID · conflict
Domains — venue-derived; a paper can count in several
Data Mining & Knowledge Discovery · 10Big Data, Cloud & Distributed Data Systems · 3Database Systems & Data Management · 1 (1 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | VFLAIR-LLM: A Comprehensive Framework and Benchmark for Split Learning of LLMsabstractWith the advancement of Large Language Models (LLMs), LLM applications have expanded into a growing number of fields. However, users with data privacy concerns face limitations in directly utilizing LLM APIs, while private deployments incur significant computational demands. This creates a substantial challenge in achieving secure LLM adaptation under constrained local resources. To address this issue, collaborative learning methods, such as Split Learning (SL), offer a resource-efficient and privacy-preserving solution for adapting LLMs to private domains. In this study, we introduce VFLAIR-LLM (available at https://github.com/FLAIR-THU/VFLAIR-LLM), an extensible and lightweight split learning framework for LLMs, enabling privacy-preserving LLM inference and fine-tuning in resource-constrained environments. Our library provides two LLM partition settings, supporting three task types and 18 datasets. In addition, we provide standard modules for implementing and evaluating attacks and defenses. We benchmark 5 attacks and 9 defenses under various Split Learning for LLM(SL-LLM) settings, offering concrete insights and recommendations on the choice of model partition configurations, defense strategies, and relevant hyperparameters for real-world applications. Zixuan Gu, Qiufeng Fan, Yang Liu 0165, Xiaojun Ye 0001 |
KDD (2) | 4 |
| 2025 | HtFLlib: A Comprehensive Heterogeneous Federated Learning Library and BenchmarkabstractAs AI evolves, collaboration among heterogeneous models helps overcome data scarcity by enabling knowledge transfer across institutions and devices.Traditional Federated Learning (FL) only supports homogeneous models, limiting collaboration among clients with heterogeneous model architectures.To address this, Heterogeneous Federated Learning (HtFL) methods are developed to enable collaboration across diverse heterogeneous models while tackling the data heterogeneity issue at the same time.However, a comprehensive benchmark for standardized evaluation and analysis of the rapidly growing HtFL methods is lacking.Firstly, the highly varied datasets, model heterogeneity scenarios, and different method implementations become hurdles to making easy and fair comparisons among HtFL methods.Secondly, the effectiveness and robustness of HtFL methods are under-explored in various scenarios, such as the medical domain and sensor signal modality.To fill this gap, we introduce the first Heterogeneous Federated Learning Library (HtFLlib), an easy-to-use and extensible framework that integrates multiple datasets and model heterogeneity scenarios, offering a robust benchmark for research and practical applications.Specifically, HtFLlib integrates (1) 12 datasets spanning various domains, modalities, and data heterogeneity scenarios; (2) 40 model architectures, ranging from small to large, across three modalities;(3) a modularized and easy-to-extend HtFL codebase with implementations of 10 representative HtFL methods; and (4) systematic evaluations in terms of accuracy, convergence, computation costs, and communication costs.We emphasize the advantages and potential of state-of-the-art HtFL methods and hope that HtFLlib will catalyze advancing HtFL research and enable its broader applications.The code is released at https://github.com/TsingZ0/HtFLlib. Jianqing Zhang, Xinghao Wu, Yanbing Zhou, Xiaoting Sun, Qiqi Cai, Yang Liu 0165, Yang Hua 0001, Zhenzhe Zheng 0001, Jian Cao 0001, Qiang Yang 0001 |
KDD (2) | 6 |
| 2024 | Defending Against Inference and Backdoor Attacks in Vertical Federated Learning via Mutual Information RegularizationabstractVertical Federated Learning (VFL) is widely utilized in real-world applications to enable collaborative learning while protecting local data and models. However, previous works show that parties without labels (passive parties) in VFL can infer the sensitive label or feature information owned by the party with labels (active party), or execute backdoor attacks. Meanwhile, active party can also infer sensitive feature or attribute information from passive party. All these pose great challenges to VFL systems. Former defense methods tend to experience either a loss in overall effectiveness or are too specialized for specific tasks. In this work, we propose a novel method and a unified framework for defending various attacks in VFL altogether, namely Mutual Information Regularization Defense (MID), which limits the mutual information between private raw data and intermediate outputs to achieve a consistently better trade-off between model utility and privacy. We provide both theoretical and experimental evidence to confirm the effectiveness of our MID framework in defending against a wide range of label and feature inference attacks, along with backdoor attacks in VFL. These showcase its promising potential as a versatile and effective defense mechanism, not tied to any specific task. Tianyuan Zou, Yang Liu 0165, Xiaozhou Ye, Ye Ouyang, Ya-Qin Zhang |
IEEE Big Data | 2 |
| 2024 | PerFedRec++: Enhancing Personalized Federated Recommendation with Self-Supervised Pre-TrainingabstractFederated 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. Sichun Luo, Yuanzhang Xiao, Yang Liu 0165, Wenbo Ding 0001, Linqi Song |
ACM Trans. Intell. Syst. Technol. | 4 |
| 2024 | Vertical Federated Learning: Concepts, Advances, and ChallengesabstractVertical Federated Learning (VFL) is a federated learning setting where multiple parties with different features about the same set of users jointly train machine learning models without exposing their raw data or model parameters. Motivated by the rapid growth in VFL research and real-world applications, we provide a comprehensive review of the concept and algorithms of VFL, as well as current advances and challenges in various aspects, including effectiveness, efficiency, and privacy. We provide an exhaustive categorization for VFL settings and privacy-preserving protocols and comprehensively analyze the privacy attacks and defense strategies for each protocol. In the end, we propose a unified framework, termed VFLow, which considers the VFL problem under communication, computation, privacy, as well as effectiveness and fairness constraints. Finally, we review the most recent advances in industrial applications, highlighting open challenges and future directions for VFL. Yang Liu 0165, Yan Kang 0001, Tianyuan Zou, Yanhong Pu, Yuanqin He, Xiaozhou Ye, Ye Ouyang, Ya-Qin Zhang, Qiang Yang 0001 |
IEEE Trans. Knowl. Data Eng. | 1 |
| 2022 | FedCVT: Semi-supervised Vertical Federated Learning with Cross-view TrainingabstractFederated learning allows multiple parties to build machine learning models collaboratively without exposing data. In particular, vertical federated learning (VFL) enables participating parties to build a joint machine learning model based upon distributed features of aligned samples. However, VFL requires all parties to share a sufficient amount of aligned samples. In reality, the set of aligned samples may be small, leaving the majority of the non-aligned data unused. In this article, we propose Federated Cross-view Training (FedCVT), a semi-supervised learning approach that improves the performance of the VFL model with limited aligned samples. More specifically, FedCVT estimates representations for missing features, predicts pseudo-labels for unlabeled samples to expand the training set, and trains three classifiers jointly based upon different views of the expanded training set to improve the VFL model’s performance. FedCVT does not require parties to share their original data and model parameters, thus preserving data privacy. We conduct experiments on NUS-WIDE, Vehicle, and CIFAR10 datasets. The experimental results demonstrate that FedCVT significantly outperforms vanilla VFL that only utilizes aligned samples. Finally, we perform ablation studies to investigate the contribution of each component of FedCVT to the performance of FedCVT. Yan Kang 0001, Yang Liu 0165, Xinle Liang |
ACM Trans. Intell. Syst. Technol. | 2 |
| 2022 | GTG-Shapley: Efficient and Accurate Participant Contribution Evaluation in Federated LearningabstractFederated Learning (FL) bridges the gap between collaborative machine learning and preserving data privacy. To sustain the long-term operation of an FL ecosystem, it is important to attract high-quality data owners with appropriate incentive schemes. As an important building block of such incentive schemes, it is essential to fairly evaluate participants’ contribution to the performance of the final FL model without exposing their private data. Shapley Value (SV)–based techniques have been widely adopted to provide a fair evaluation of FL participant contributions. However, existing approaches incur significant computation costs, making them difficult to apply in practice. In this article, we propose the Guided Truncation Gradient Shapley (GTG-Shapley) approach to address this challenge. It reconstructs FL models from gradient updates for SV calculation instead of repeatedly training with different combinations of FL participants. In addition, we design a guided Monte Carlo sampling approach combined with within-round and between-round truncation to further reduce the number of model reconstructions and evaluations required. This is accomplished through extensive experiments under diverse realistic data distribution settings. The results demonstrate that GTG-Shapley can closely approximate actual Shapley values while significantly increasing computational efficiency compared with the state-of-the-art, especially under non-i.i.d. settings. Zelei Liu, Yuanyuan Chen 0012, Han Yu 0001, Yang Liu 0165, Li-Zhen Cui 0001 |
ACM Trans. Intell. Syst. Technol. | 4 |
| 2022 | Communication-Efficient Federated Learning with Adaptive QuantizationabstractFederated learning (FL) has attracted tremendous attentions in recent years due to its privacy-preserving measures and great potential in some distributed but privacy-sensitive applications, such as finance and health. However, high communication overloads for transmitting high-dimensional networks and extra security masks remain a bottleneck of FL. This article proposes a communication-efficient FL framework with an Adaptive Quantized Gradient (AQG), which adaptively adjusts the quantization level based on a local gradient’s update to fully utilize the heterogeneity of local data distribution for reducing unnecessary transmissions. In addition, client dropout issues are taken into account and an Augmented AQG is developed, which could limit the dropout noise with an appropriate amplification mechanism for transmitted gradients. Theoretical analysis and experiment results show that the proposed AQG leads to 18% to 50% of additional transmission reduction as compared with existing popular methods, including Quantized Gradient Descent (QGD) and Lazily Aggregated Quantized (LAQ) gradient-based methods without deteriorating convergence properties. Experiments with heterogenous data distributions corroborate a more significant transmission reduction compared with independent identical data distributions. The proposed AQG is robust to a client dropping rate up to 90% empirically, and the Augmented AQG manages to further improve the FL system’s communication efficiency with the presence of moderate-scale client dropouts commonly seen in practical FL scenarios. Yuzhu Mao, Zihao Zhao 0001, Guangfeng Yan, Yang Liu 0165, Tian Lan 0001, Linqi Song, Wenbo Ding 0001 |
ACM Trans. Intell. Syst. Technol. | 4 |
| 2022 | Introduction to the Special Issue on the Federated Learning: Algorithms, Systems, and Applications: Part 1abstractLIA Qiang Yang 0001, Yongxin Tong, Yang Liu 0165, Yangqiu Song, Hao Peng 0001, Boi Faltings |
ACM Trans. Intell. Syst. Technol. | 3 |
| 2022 | Preface to Federated Learning: Algorithms, Systems, and Applications: Part 2abstractNo abstract available. Qiang Yang 0001, Yongxin Tong, Yang Liu 0165, Yangqiu Song, Hao Peng 0001, Boi Faltings |
ACM Trans. Intell. Syst. Technol. | 3 |
| 2021 | StarFL: Hybrid Federated Learning Architecture for Smart Urban ComputingabstractFrom facial recognition to autonomous driving, Artificial Intelligence (AI) will transform the way we live and work over the next couple of decades. Existing AI approaches for urban computing suffer from various challenges, including dealing with synchronization and processing of vast amount of data generated from the edge devices, as well as the privacy and security of individual users, including their bio-metrics, locations, and itineraries. Traditional centralized-based approaches require data in each organization be uploaded to the central database, which may be prohibited by data protection acts, such as GDPR and CCPA. To decouple model training from the need to store the data in the cloud, a new training paradigm called Federated Learning (FL) is proposed. FL enables multiple devices to collaboratively learn a shared model while keeping the training data on devices locally, which can significantly mitigate privacy leakage risk. However, under urban computing scenarios, data are often communication-heavy, high-frequent, and asynchronized, posing new challenges to FL implementation. To handle these challenges, we propose a new hybrid federated learning architecture called StarFL. By combining with Trusted Execution Environment (TEE), Secure Multi-Party Computation (MPC), and (Beidou) satellites, StarFL enables safe key distribution, encryption, and decryption, and provides a verification mechanism for each participant to ensure the security of the local data. In addition, StarFL can provide accurate timestamp matching to facilitate synchronization of multiple clients. All these improvements make StarFL more applicable to the security-sensitive scenarios for the next generation of urban computing. Anbu Huang, Yang Liu 0165, Tianjian Chen, Yongkai Zhou, Hongfeng Chai, Qiang Yang 0001 |
ACM Trans. Intell. Syst. Technol. | 2 |
| 2019 | Privacy-preserving Heterogeneous Federated Transfer LearningabstractFederated learning (FL) allows multiple parties to collaboratively train a machine learning model without sharing raw data. However, existing approaches are mainly designed for homogeneous feature spaces and fail to tackle covariate shift and feature heterogeneity without privacy leakage. In this paper, we propose a transfer learning approach to tackle the covariate shift of the overlapped homogeneous feature spaces, and bridge different data owners' heterogeneous feature spaces with stringent privacy preservation in FL. We propose an end-to-end privacy-preserving multi-party learning approach with two variants based on homomorphic encryption and secret sharing techniques, respectively, to build a heterogeneous federated transfer learning (HFTL) framework. Finally, we not only demonstrate experimentally that the HFTL is secure, effective and highly scalable on five benchmark datasets, but also apply it into a real application of in-hospital mortality prediction from MIMIC-III dataset, where privacy is of significant concern. Dashan Gao 0002, Yang Liu 0165, Anbu Huang, Ce Ju, Han Yu 0001, Qiang Yang 0001 |
IEEE BigData | 2 |
| 2019 | Secure and Efficient Federated Transfer LearningabstractMachine Learning models require a vast amount of data for accurate training. In reality, most data is scattered across different organizations and cannot be easily integrated under many legal and practical constraints. Federated Transfer Learning (FTL) was introduced in [1] to improve statistical models under a data federation that allow knowledge to be shared without compromising user privacy, and enable complementary knowledge to be transferred in the network. As a result, a target-domain party can build more flexible and powerful models by leveraging rich labels from a source-domain party. However, the excessive computational overhead of the security protocol involved in this model rendered it impractical. In this work, we aim towards enhancing the efficiency and security of existing models for practical collaborative training under a data federation by incorporating Secret Sharing (SS). In literature, only the semi-honest model for Federated Transfer Learning has been considered. In this paper, we improve upon the previous solution, and also allow malicious players who can arbitrarily deviate from the protocol in our FTL model. This is much stronger than the semi-honest model where we assume that parties follow the protocol precisely. We do so using the one of the practical MPC protocol called SPDZ, thus our model can be efficiently extended to any number of parties even in the case of a dishonest majority. In addition, the models evaluated in our setting significantly outperform the previous work, in terms of both runtime and communication cost. A single iteration in our model executes in 0.8 seconds for the semi-honest case and 1.4 seconds for the malicious case for 500 samples, as compared to 35 seconds taken by the previous implementation. Shreya Sharma 0002, Chaoping Xing, Yang Liu 0165, Yan Kang 0001 |
IEEE BigData | 3 |
| 2019 | Federated Machine Learning: Concept and ApplicationsabstractToday’s artificial intelligence still faces two major challenges. One is that, in most industries, data exists in the form of isolated islands. The other is the strengthening of data privacy and security. We propose a possible solution to these challenges: secure federated learning. Beyond the federated-learning framework first proposed by Google in 2016, we introduce a comprehensive secure federated-learning framework, which includes horizontal federated learning, vertical federated learning, and federated transfer learning. We provide definitions, architectures, and applications for the federated-learning framework, and provide a comprehensive survey of existing works on this subject. In addition, we propose building data networks among organizations based on federated mechanisms as an effective solution to allowing knowledge to be shared without compromising user privacy. Qiang Yang 0001, Yang Liu 0165, Tianjian Chen, Yongxin Tong |
ACM Trans. Intell. Syst. Technol. | 2 |