Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yiqun Diao

dblp:272/5213 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
5since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 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
4 papers
Efficient and distributed learning · 79% Transfer learning and domain adaptation · 18% Deep learning architectures and training · 3%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 77% Data mining · 23%
Network and information security
1 paper
Privacy and data protection · 100%

Topics — the 11 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
2.742024
Federated Transformer: Multi-Party Vertical Federated Learning on Practical Fuzzily Linked Data · NeurIPS 2024
Exploiting Label Skews in Federated Learning with Model Concatenation · AAAI 2024
Towards Addressing Label Skews in One-Shot Federated Learning · ICLR 2023
Machine learning › Transfer learning and domain adaptation
label shift
1.422024
Exploiting Label Skews in Federated Learning with Model Concatenation · AAAI 2024
Towards Addressing Label Skews in One-Shot Federated Learning · ICLR 2023
Machine learning › Efficient and distributed learning › federated learning
data heterogeneity
0.812024
Exploiting Label Skews in Federated Learning with Model Concatenation · AAAI 2024
Machine learning › Efficient and distributed learning › federated learning
model aggregation
0.812024
Exploiting Label Skews in Federated Learning with Model Concatenation · AAAI 2024
Machine learning › Efficient and distributed learning › federated learning › federated learning architecture
vertical federated learning
0.812024
Federated Transformer: Multi-Party Vertical Federated Learning on Practical Fuzzily Linked Data · NeurIPS 2024
Machine learning and data management › online learning
stream learning
0.812024
OEBench: Investigating Open Environment Challenges in Real-World Relational Data Streams · Proc. VLDB Endow. 2024
Privacy and data protection › privacy-preserving machine learning
federated learning privacy
0.812024
Federated Transformer: Multi-Party Vertical Federated Learning on Practical Fuzzily Linked Data · NeurIPS 2024
Machine learning › Efficient and distributed learning › distributed training
data partitioning
0.612022
Federated Learning on Non-IID Data Silos: An Experimental Study · ICDE 2022
Machine learning › Efficient and distributed learning › federated learning › data heterogeneity
non-IID federated learning
0.612022
Federated Learning on Non-IID Data Silos: An Experimental Study · ICDE 2022
Machine learning › Deep learning architectures and training
transformer
0.212024
Federated Transformer: Multi-Party Vertical Federated Learning on Practical Fuzzily Linked Data · NeurIPS 2024
Data mining
clustering
0.212024
OEBench: Investigating Open Environment Challenges in Real-World Relational Data Streams · Proc. VLDB Endow. 2024

Methods — techniques the papers use, named apart from their topics

transformer architecture · 1.5fuzzy identifier encoding · 1.5differential privacy · 1.5secure multiparty computation · 0.8secure multi-party computation · 0.8information bottleneck analysis · 0.8incremental learning · 0.8clustering · 0.8benchmarking · 0.8one-shot federated learning · 0.7experimental study · 0.6
YearPublicationVenuePosition
2024 Exploiting Label Skews in Federated Learning with Model Concatenation
abstract
Federated Learning (FL) has emerged as a promising solution to perform deep learning on different data owners without exchanging raw data. However, non-IID data has been a key challenge in FL, which could significantly degrade the accuracy of the final model. Among different non-IID types, label skews have been challenging and common in image classification and other tasks. Instead of averaging the local models in most previous studies, we propose FedConcat, a simple and effective approach that concatenates these local models as the base of the global model to effectively aggregate the local knowledge. To reduce the size of the global model, we adopt the clustering technique to group the clients by their label distributions and collaboratively train a model inside each cluster. We theoretically analyze the advantage of concatenation over averaging by analyzing the information bottleneck of deep neural networks. Experimental results demonstrate that FedConcat achieves significantly higher accuracy than previous state-of-the-art FL methods in various heterogeneous label skew distribution settings and meanwhile has lower communication costs. Our code is publicly available at https://github.com/sjtudyq/FedConcat.
Yiqun Diao, Qinbin Li, Bingsheng He
AAAI1
2024 Federated Transformer: Multi-Party Vertical Federated Learning on Practical Fuzzily Linked Data
abstract
Federated Learning (FL) is an evolving paradigm that enables multiple parties to collaboratively train models without sharing raw data. Among its variants, Vertical Federated Learning (VFL) is particularly relevant in real-world, cross-organizational collaborations, where distinct features of a shared instance group are contributed by different parties. In these scenarios, parties are often linked using fuzzy identifiers, leading to a common practice termed as _multi-party fuzzy VFL_. Existing models generally address either multi-party VFL or fuzzy VFL between two parties. Extending these models to practical multi-party fuzzy VFL typically results in significant performance degradation and increased costs for maintaining privacy. To overcome these limitations, we introduce the _Federated Transformer (FeT)_, a novel framework that supports multi-party VFL with fuzzy identifiers. FeT innovatively encodes these identifiers into data representations and employs a transformer architecture distributed across different parties, incorporating three new techniques to enhance performance. Furthermore, we have developed a multi-party privacy framework for VFL that integrates differential privacy with secure multi-party computation, effectively protecting local representations while minimizing associated utility costs. Our experiments demonstrate that the FeT surpasses the baseline models by up to 46\% in terms of accuracy when scaled to 50 parties. Additionally, in two-party fuzzy VFL settings, FeT also shows improved performance and privacy over cutting-edge VFL models.
Zhaomin Wu, Junyi Hou, Yiqun Diao, Bingsheng He
NeurIPS3
2024 OEBench: Investigating Open Environment Challenges in Real-World Relational Data Streams
abstract
How to get insights from relational data streams in a timely manner is a hot research topic. Data streams can present unique challenges, such as distribution drifts, outliers, emerging classes, and changing features, which have recently been described as open environment challenges for machine learning. While existing studies have been done on incremental learning for data streams, their evaluations are mostly conducted with synthetic datasets. Thus, a natural question is how those open environment challenges look like and how existing incremental learning algorithms perform on real-world relational data streams. To fill this gap, we develop an Open Environment Benchmark named OEBench to evaluate open environment challenges in real-world relational data streams. Specifically, we investigate 55 real-world relational data streams and establish that open environment scenarios are indeed widespread, which presents significant challenges for stream learning algorithms. Through benchmarks with existing incremental learning algorithms, we find that increased data quantity may not consistently enhance the model accuracy when applied in open environment scenarios, where machine learning models can be significantly compromised by missing values, distribution drifts, or anomalies in real-world data streams. The current techniques are insufficient in effectively mitigating these challenges brought by open environments. More researches are needed to address real-world open environment challenges. All datasets and code are open-sourced in https://github.com/Xtra-Computing/OEBench.
Yiqun Diao, Yutong Yang, Qinbin Li, Bingsheng He, Mian Lu
Proc. VLDB Endow.1
2023 Towards Addressing Label Skews in One-Shot Federated Learning
Yiqun Diao, Qinbin Li, Bingsheng He
ICLR1
2022 Federated Learning on Non-IID Data Silos: An Experimental Study
abstract
Due to the increasing privacy concerns and data regulations, training data have been increasingly fragmented, forming distributed databases of multiple “data silos” (e.g., within different organizations and countries). To develop effective machine learning services, there is a must to exploit data from such distributed databases without exchanging the raw data. Recently, federated learning (FL) has been a solution with growing interests, which enables multiple parties to collaboratively train a machine learning model without exchanging their local data. A key and common challenge on distributed databases is the heterogeneity of the data distribution among the parties. The data of different parties are usually non-independently and identically distributed (i.e., non-IID). There have been many FL algorithms to address the learning effectiveness under non-IID data settings. However, there lacks an experimental study on systematically understanding their advantages and disadvantages, as previous studies have very rigid data partitioning strategies among parties, which are hardly representative and thorough. In this paper, to help researchers better understand and study the non-IID data setting in federated learning, we propose comprehensive data partitioning strategies to cover the typical non-IID data cases. Moreover, we conduct extensive experiments to evaluate state-of-the-art FL algorithms. We find that non-IID does bring significant challenges in learning accuracy of FL algorithms, and none of the existing state-of-the-art FL algorithms outperforms others in all cases. Our experiments provide insights for future studies of addressing the challenges in “data silos”.
Qinbin Li, Yiqun Diao, Quan Chen 0002, Bingsheng He
ICDE2
2020 BiHand: Recovering Hand Mesh with Multi-stage Bisected Hourglass Networks
Lixin Yang 0001, Jiasen Li, Yiqun Diao, Cewu Lu
BMVC4