Zheyuan Liu

Zheyuan Liu

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
13 May 2024
Verified
Conference Paper
Open access
ZLZheyuan Liu
Zheyuan Liu
XHXiaoxin He
Xiaoxin He
YTYijun Tian
Yijun Tian
Nitesh ChawlaNitesh Chawla
Nitesh Chawla

13 May 2024
Verified
Conference Paper
Open access
ZLZheyuan Liu
Zheyuan Liu
GDGuangyao Dou
Guangyao Dou
ECEli Chien
Eli Chien
CZChunhui Zhang
Chunhui Zhang
YTYijun Tian
Yijun Tian
ZZZiwei Zhu
Ziwei Zhu
Machine Unlearning (MU) algorithms have become increasingly critical due to the imperative adherence to data privacy regulations. The primary objective of MU is to erase the influence of specific data samples on a given model without the need to retrain it from scratch. Accordingly, existing methods focus on maximizing user privacy protection. However, there are different degrees of privacy regulations for each real-world web-based application. Exploring the full spectrum of trade-offs between privacy, model utility, and runtime efficiency is critical for practical unlearning scenarios. Furthermore, designing the MU algorithm with simple control of the aforementioned trade-off is desirable but challenging due to the inherent complex interaction. To address the challenges, we present Controllable Machine Unlearning (ConMU), a novel framework designed to facilitate the calibration of MU. The ConMU framework contains three integral modules: an important data selection module that reconciles the runtime efficiency and model generalization, a progressive Gaussian mechanism module that balances privacy and model generalization, and an unlearning proxy that controls the trade-offs between privacy and runtime efficiency. Comprehensive experiments on various benchmark datasets have demonstrated the robust adaptability of our control mechanism and its superiority over established unlearning methods. ConMU explores the full spectrum of the Privacy-Utility-Efficiency trade-off and allows practitioners to account for different real-world regulations. Source code available at: https://github.com/guangyaodou/ConMU

1 January 2025
Verified
Conference Paper
Open access
PDF file
ZLZheyuan Liu
Zheyuan Liu
GDGuangyao Dou
Guangyao Dou
MJMengzhao Jia
Mengzhao Jia
ZTZhaoxuan Tan
Zhaoxuan Tan
QZQingkai Zeng
Qingkai Zeng
MJMeng Jiang
Meng Jiang
Zheyuan Liu, Guangyao Dou, Mengzhao Jia, Zhaoxuan Tan, Qingkai Zeng, Yongle Yuan, Meng Jiang. Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2025.

30 April 2023
Verified
Conference Paper
Open access
ZLZheyuan Liu
Zheyuan Liu
CZChunhui Zhang
Chunhui Zhang
YTYijun Tian
Yijun Tian
EZErchi Zhang
Erchi Zhang
CHChao Huang
Chao Huang
CZChuxu Zhang
Chuxu Zhang
Graph Neural Networks (GNNs) have demonstrated a great representation learning capability on graph data and have been utilized in various downstream applications. However, real-world data in web-based applications (e.g., recommendation and advertising) always contains bias, preventing GNNs from learning fair representations. Although many works were proposed to address the fairness issue, they suffer from the significant problem of insufficient learnable knowledge with limited attributes after debiasing. To address this problem, we develop Graph-Fairness Mixture of Experts (G-Fame), a novel plug-and-play method to assist any GNNs to learn distinguishable representations with unbiased attributes. Furthermore, based on G-Fame, we propose G-Fame++, which introduces three novel strategies to improve the representation fairness from node representations, model layer, and parameter redundancy perspectives. In particular, we first present the embedding diversified method to learn distinguishable node representations. Second, we design the layer diversified strategy to maximize the output difference of distinct model layers. Third, we introduce the expert diversified method to minimize expert parameter similarities to learn diverse and complementary representations. Extensive experiments demonstrate the superiority of G-Fame and G-Fame++ in both accuracy and fairness, compared to state-of-the-art methods across multiple graph datasets.

23 June 2024
Verified
Conference Paper
Open access
ZLZhiding Liang
Zhiding Liang
GLGang Liu
Gang Liu
ZLZheyuan Liu
Zheyuan Liu
JCJinglei Cheng
Jinglei Cheng
THTianyi Hao
Tianyi Hao
YSYiyu Shi
Yiyu Shi
In recent years, quantum computing has emerged as a transformative force in the field of combinatorial optimization, offering novel approaches to tackling complex problems that have long challenged classical computational methods. Among these, the Quantum Approximate Optimization Algorithm (QAOA) stands out for its potential to efficiently solve the Max-Cut problem, a quintessential example of combinatorial optimization. However, practical application faces challenges due to current limitations on quantum computational resource. Our work optimizes QAOA initialization, using Graph Neural Networks (GNN) as a warm-start technique. This sacrifices affordable computational resource on classical computer to reduce quantum computational resource overhead, enhancing QAOA's effectiveness. Experiments with various GNN architectures demonstrate the adaptability and stability of our framework, highlighting the synergy between quantum algorithms and machine learning. Our findings show GNN's potential in improving QAOA performance, opening new avenues for hybrid quantum-classical approaches in quantum computing and contributing to practical applications.

1 January 2025
Verified
Conference Paper
Open access
PDF file
ZLZheyuan Liu
Zheyuan Liu
GDGuangyao Dou
Guangyao Dou
XYXiangchi Yuan
Xiangchi Yuan
CZChunhui Zhang
Chunhui Zhang
ZTZhaoxuan Tan
Zhaoxuan Tan
MJMeng Jiang
Meng Jiang
Zheyuan Liu, Guangyao Dou, Xiangchi Yuan, Chunhui Zhang, Zhaoxuan Tan, Meng Jiang. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.