Demo Data from VLDB 2026 / reviewers in the wild / expert
Binhui Yao
dblp:331/5495
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 4 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
3 papers |
Efficient and distributed learning · 88% Trustworthy machine learning · 12% | |
| Databases, data mining, and information retrieval
2 papers |
Recommender systems · 100% | |
| Network and information security
1 paper |
Privacy and data protection · 100% |
Topics — the 12 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
federated learning |
1.4 | 2 | 2024 | Rethinking the Representation in Federated Unsupervised Learning with Non-IID Data · CVPR 2024 Reducing Communication for Split Learning by Randomized Top-k Sparsification · IJCAI 2023 |
Machine learning › Trustworthy machine learning
fairness |
0.8 | 1 | 2024 | Intra- and Inter-group Optimal Transport for User-Oriented Fairness in Recommender Systems · AAAI 2024 |
Machine learning › Efficient and distributed learning › federated learning
unsupervised federated learning |
0.8 | 1 | 2024 | Rethinking the Representation in Federated Unsupervised Learning with Non-IID Data · CVPR 2024 |
Recommender systems
fairness-aware recommendation |
0.8 | 1 | 2024 | Intra- and Inter-group Optimal Transport for User-Oriented Fairness in Recommender Systems · AAAI 2024 |
Machine learning › Efficient and distributed learning › distributed training › communication-efficient training
communication optimization |
0.7 | 1 | 2023 | Reducing Communication for Split Learning by Randomized Top-k Sparsification · IJCAI 2023 |
Machine learning › Efficient and distributed learning
model compression |
0.7 | 1 | 2023 | Reducing Communication for Split Learning by Randomized Top-k Sparsification · IJCAI 2023 |
Machine learning › Efficient and distributed learning › model compression
sparsity |
0.7 | 1 | 2023 | Reducing Communication for Split Learning by Randomized Top-k Sparsification · IJCAI 2023 |
Machine learning › Efficient and distributed learning › distributed training › distributed DNN training
split learning |
0.7 | 1 | 2023 | Reducing Communication for Split Learning by Randomized Top-k Sparsification · IJCAI 2023 |
Machine learning › Efficient and distributed learning › communication compression
top-k sparsification |
0.7 | 1 | 2023 | Reducing Communication for Split Learning by Randomized Top-k Sparsification · IJCAI 2023 |
Recommender systems
cross-domain recommendation |
0.7 | 1 | 2023 | PPGenCDR: A Stable and Robust Framework for Privacy-Preserving Cross-Domain Recommendation · AAAI 2023 |
Recommender systems › trustworthy recommendation
privacy-preserving recommendation |
0.7 | 1 | 2023 | PPGenCDR: A Stable and Robust Framework for Privacy-Preserving Cross-Domain Recommendation · AAAI 2023 |
Privacy and data protection
differential privacy |
0.7 | 1 | 2023 | PPGenCDR: A Stable and Robust Framework for Privacy-Preserving Cross-Domain Recommendation · AAAI 2023 |
Methods — techniques the papers use, named apart from their topics
optimal transport · 1.5renyi differential privacy · 1.3generative adversarial network · 1.3uniform regularizer · 0.8unified aggregator · 0.8quantization · 0.7l1 regularization · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Intra- and Inter-group Optimal Transport for User-Oriented Fairness in Recommender SystemsabstractRecommender systems are typically biased toward a small group of users, leading to severe unfairness in recommendation performance, i.e., User-Oriented Fairness (UOF) issue. Existing research on UOF exhibits notable limitations in two phases of recommendation models. In the training phase, current methods fail to tackle the root cause of the UOF issue, which lies in the unfair training process between advantaged and disadvantaged users. In the evaluation phase, the current UOF metric lacks the ability to comprehensively evaluate varying cases of unfairness. In this paper, we aim to address the aforementioned limitations and ensure recommendation models treat user groups of varying activity levels equally. In the training phase, we propose a novel Intra- and Inter-GrOup Optimal Transport framework (II-GOOT) to alleviate the data sparsity problem for disadvantaged users and narrow the training gap between advantaged and disadvantaged users. In the evaluation phase, we introduce a novel metric called ?-UOF, which enables the identification and assessment of various cases of UOF. This helps prevent recommendation models from leading to unfavorable fairness outcomes, where both advantaged and disadvantaged users experience subpar recommendation performance. We conduct extensive experiments on three real-world datasets based on four backbone recommendation models to prove the effectiveness of ?-UOF and the efficiency of our proposed II-GOOT. Zhongxuan Han, Chaochao Chen 0001, Weiming Liu 0005, Binhui Yao, Yuyuan Li 0001, Jianwei Yin |
AAAI | 6 |
| 2024 | Rethinking the Representation in Federated Unsupervised Learning with Non-IID DataabstractFederated learning achieves effective performance in modeling decentralized data. In practice, client data are not well-labeled, which makes it potential for federated unsupervised learning (FUSL) with non-IID data. However, the performance of existing FUSL methods suffers from insufficient representations, i.e., (1) representation collapse entanglement among local and global models, and (2) inconsistent representation spaces among local models. The former indicates that representation collapse in local model will subsequently impact the global model and other local models. The latter means that clients model data representation with inconsistent parameters due to the deficiency of supervision signals. In this work, we propose FedU2which enhances generating uniform and unified representation in FUSL with non-IID data. Specifically, FedU2consists of flexible uniform regularizer (FUR) and efficient unified aggregator (EUA). FUR in each client avoids representation collapse via dispersing samples uniformly, and EUA in server promotes unified representation by constraining consistent client model updating. To extensively validate the performance of FedU2, we conduct both cross-device and cross-silo evaluation experiments on two benchmark datasets, i.e., CIFAR10 and CIFAR100. Xinting Liao, Weiming Liu 0005, Chaochao Chen 0001, Pengyang Zhou 0001, Fengyuan Yu 0001, Huabin Zhu, Binhui Yao, Yanchao Tan |
CVPR | 7 |
| 2023 | PPGenCDR: A Stable and Robust Framework for Privacy-Preserving Cross-Domain RecommendationabstractPrivacy-preserving cross-domain recommendation (PPCDR) refers to preserving the privacy of users when transferring the knowledge from source domain to target domain for better performance, which is vital for the long-term development of recommender systems. Existing work on cross-domain recommendation (CDR) reaches advanced and satisfying recommendation performance, but mostly neglects preserving privacy. To fill this gap, we propose a privacy-preserving generative cross-domain recommendation (PPGenCDR) framework for PPCDR. PPGenCDR includes two main modules, i.e., stable privacy-preserving generator module, and robust cross-domain recommendation module. Specifically, the former isolates data from different domains with a generative adversarial network (GAN) based model, which stably estimates the distribution of private data in the source domain with ́Renyi differential privacy (RDP) technique. Then the latter aims to robustly leverage the perturbed but effective knowledge from the source domain with the raw data in target domain to improve recommendation performance. Three key modules, i.e., (1) selective privacy preserver, (2) GAN stabilizer, and (3) robustness conductor, guarantee the cost-effective trade-off between utility and privacy, the stability of GAN when using RDP, and the robustness of leveraging transferable knowledge accordingly. The extensive empirical studies on Douban and Amazon datasets demonstrate that PPGenCDR significantly outperforms the state-of-the-art recommendation models while preserving privacy. Xinting Liao, Weiming Liu 0005, Binhui Yao, Chaochao Chen 0001 |
AAAI | 4 |
| 2023 | Reducing Communication for Split Learning by Randomized Top-k SparsificationabstractSplit learning is a simple solution for Vertical Federated Learning (VFL), which has drawn substantial attention in both research and application due to its simplicity and efficiency. However, communication efficiency is still a crucial issue for split learning. In this paper, we investigate multiple communication reduction methods for split learning, including cut layer size reduction, top-k sparsification, quantization, and L1 regularization. Through analysis of the cut layer size reduction and top-k sparsification, we further propose randomized top-k sparsification, to make the model generalize and converge better. This is done by selecting top-k elements with a large probability while also having a small probability to select non-top-k elements. Empirical results show that compared with other communication-reduction methods, our proposed randomized top-k sparsification achieves a better model performance under the same compression level. Chaochao Chen 0001, Lingjuan Lyu, Binhui Yao |
IJCAI | 4 |