Search Results for author: Zhongxuan Han

Found 4 papers, 0 papers with code

WassFFed: Wasserstein Fair Federated Learning

no code implementations11 Nov 2024 Zhongxuan Han, Li Zhang, Chaochao Chen, Xiaolin Zheng, Fei Zheng, Yuyuan Li, Jianwei Yin

However, the limited existing research on fairness in FL does not effectively address two key challenges, i. e., (CH1) Current methods fail to deal with the inconsistency between fair optimization results obtained with surrogate functions and fair classification results.

Fairness Federated Learning

Making Users Indistinguishable: Attribute-wise Unlearning in Recommender Systems

no code implementations6 Oct 2023 Yuyuan Li, Chaochao Chen, Xiaolin Zheng, Yizhao Zhang, Zhongxuan Han, Dan Meng, Jun Wang

To address the PoT-AU problem in recommender systems, we design a two-component loss function that consists of i) distinguishability loss: making attribute labels indistinguishable from attackers, and ii) regularization loss: preventing drastic changes in the model that result in a negative impact on recommendation performance.

Attribute Recommendation Systems

In-processing User Constrained Dominant Sets for User-Oriented Fairness in Recommender Systems

no code implementations4 Sep 2023 Zhongxuan Han, Chaochao Chen, Xiaolin Zheng, Weiming Liu, Jun Wang, Wenjie Cheng, Yuyuan Li

By combining the fairness loss with the original backbone model loss, we address the UOF issue and maintain the overall recommendation performance simultaneously.

Fairness Recommendation Systems

Heterogeneous Information Crossing on Graphs for Session-based Recommender Systems

no code implementations24 Oct 2022 Xiaolin Zheng, Rui Wu, Zhongxuan Han, Chaochao Chen, Linxun Chen, Bing Han

HICG utilizes multiple types of user behaviors in the sessions to construct heterogeneous graphs, and captures users' current interests with their long-term preferences by effectively crossing the heterogeneous information on the graphs.

Contrastive Learning Recommendation Systems +1

Cannot find the paper you are looking for? You can Submit a new open access paper.