Demo Data from EDBT 2026 / reviewers in the wild / expert
Zijin Shen
dblp:303/1038
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0003-3540-7997ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
2 papers |
Efficient and distributed learning · 40% Deep learning architectures and training · 20% 3D vision · 20% | |
| Network and information security
1 paper |
Privacy and data protection · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision
cross-modal data augmentation |
0.7 | 1 | 2023 | Cross-Modal Data Augmentation for Tasks of Different Modalities · IEEE Trans. Multim. 2023 |
Machine learning › Deep learning architectures and training
data augmentation |
0.7 | 1 | 2023 | Cross-Modal Data Augmentation for Tasks of Different Modalities · IEEE Trans. Multim. 2023 |
Machine learning › Efficient and distributed learning
federated learning |
0.7 | 1 | 2023 | FedAA: Using Non-sensitive Modalities to Improve Federated Learning while Preserving Image Privacy · ACM Multimedia 2023 |
Machine learning › Representation and self-supervised learning › latent space › latent space manipulation
latent space interpolation |
0.7 | 1 | 2023 | Cross-Modal Data Augmentation for Tasks of Different Modalities · IEEE Trans. Multim. 2023 |
Machine learning › Efficient and distributed learning › federated learning › data heterogeneity
non-IID federated learning |
0.7 | 1 | 2023 | FedAA: Using Non-sensitive Modalities to Improve Federated Learning while Preserving Image Privacy · ACM Multimedia 2023 |
Privacy and data protection › privacy-preserving machine learning
federated learning privacy |
0.7 | 1 | 2023 | FedAA: Using Non-sensitive Modalities to Improve Federated Learning while Preserving Image Privacy · ACM Multimedia 2023 |
Privacy and data protection
image privacy |
0.7 | 1 | 2023 | FedAA: Using Non-sensitive Modalities to Improve Federated Learning while Preserving Image Privacy · ACM Multimedia 2023 |
Methods — techniques the papers use, named apart from their topics
modality sharing · 1.3client identifier discrimination · 1.3adversarial example training · 1.3neural network · 0.7interpolation · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | FedAA: Using Non-sensitive Modalities to Improve Federated Learning while Preserving Image PrivacyabstractFederated learning aims to train a better global model without sharing the sensitive training samples (usually images) of local clients. Since the sample distributions in local clients tend to be different from each other (i.e., non-IID), one of the major challenges for federated learning is to alleviate model degradation when aggregating local models. The degradation can be attributed to the weight divergence that quantifies the difference of local models from different training processes. Furthermore, non-IID also results in feature space heterogeneity during local training, making neurons of local models in the same location have different functions and further exacerbating weight divergence. In this paper, we demonstrate that the problem can be solved by sharing information from the non-sensitive modality (e.g., metadata, non-sensitive descriptions, etc.) while keeping the sensitive information of images protected. In particular, we propose Federated Learning with Adversarial Example and Adversarial Identifier (FedAA) that trains adversarial examples based on the shared non-sensitive modality to fine-tune local models before global aggregation. The training of local models is enhanced by client identifiers that discriminate the source of inputs to force different local models to get similar outputs and be more homogeneous during the local training. Experiments show that FedAA significantly outperforms recent non-IID federated learning algorithms while preserving image privac, by sharing information from non-sensitive modalities. Dong Chen 0017, Siliang Tang, Zijin Shen, Guoming Wang, Jun Xiao 0001, Yueting Zhuang, Carl Yang 0001 |
ACM Multimedia | 3 |
| 2023 | Cross-Modal Data Augmentation for Tasks of Different ModalitiesabstractData augmentation has become one of the keys to alleviating the over-fitting of models on training data and improving the generalization capabilities on testing data. Most existing data augmentation methods only focus on one modality, which is incapable when facing multiple data modalities. Some prior works try to interpolate with random coefficients in the latent space to generate new samples, which can generically work for any data modality. However, these works ignore the extra information conveyed by multimodality data. In fact, the extra information in one modality can provide semantic directions to generate more meaningful samples in another modality. This paper proposes Cross-modal Data Augmentation (CMDA), a simple yet effective data augmentation method to alleviate the over-fitting issue and improve the generalization performance. We evaluate CMDA on unsupervised and supervised tasks of different modalities, on which CMDA consistently and significantly outperforms baselines. For instance, CMDA improves the unsupervised anomaly detection baseline in vision modality from the AUROC$76.46\%, 73.07\%$and 64.36% to$83.25\%, 76.22\%$and 70.57% on three different datasets, respectively. Besides, extensive experiments demonstrate that CMDA is applicable to various neural network architectures. Furthermore, prior methods that interpolate in the latent space need to work with downstream tasks to construct the latent space. In contrast, CMDA can work with or without downstream tasks, which makes the applicability of CMDA more extensive. The source code is publicly available for non-commercial or research use athttps://github.com/Anfeather/CMDA Dong Chen 0017, Yueting Zhuang, Zijin Shen, Carl Yang 0001, Guoming Wang, Siliang Tang, Yi Yang 0001 |
IEEE Trans. Multim. | 3 |