Yuanyuan Chen 0012

dblp:37/7763-12 · DBLP profile ↗
← Back
10ranked-venue papers
2as first author
8since 2021 · last 2026
0000-0002-5585-9897ORCID · conflict

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

Artificial intelligence and machine learning · 7 · 2 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 5 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 3 · 3 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
7 papers
Efficient and distributed learning · 67% Graph learning · 11% Trustworthy machine learning · 11%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Medical and health informatics · 57% Smart cities and intelligent transportation · 43%

Topics — the 13 heaviest of 16, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
4.362026
Efficient Federated Learning With Mean Block Difference-Based Global Aggregation and Patience-Based Local Training · IEEE Trans. Knowl. Data Eng. 2026
Can Textual Gradient Work in Federated Learning? · ICLR 2025
Historical Embedding-Guided Efficient Large-Scale Federated Graph Learning · Proc. ACM Manag. Data 2024
Machine learning › Efficient and distributed learning › federated learning
communication-efficient federated learning
1.932026
Efficient Federated Learning With Mean Block Difference-Based Global Aggregation and Patience-Based Local Training · IEEE Trans. Knowl. Data Eng. 2026
Efficient Training of Large-Scale Industrial Fault Diagnostic Models through Federated Opportunistic Block Dropout · AAAI 2023
Historical Embedding-Guided Efficient Large-Scale Federated Graph Learning · Proc. ACM Manag. Data 2024
Machine learning › Efficient and distributed learning › federated learning
resource-efficient federated learning
1.012026
Efficient Federated Learning With Mean Block Difference-Based Global Aggregation and Patience-Based Local Training · IEEE Trans. Knowl. Data Eng. 2026
Natural language and speech › Language models and text generation › prompting › prompt engineering
prompt optimization
0.912025
Can Textual Gradient Work in Federated Learning? · ICLR 2025
Machine learning › Efficient and distributed learning › federated learning
federated graph learning
0.812024
Historical Embedding-Guided Efficient Large-Scale Federated Graph Learning · Proc. ACM Manag. Data 2024
Machine learning › Graph learning › graph neural network
graph convolutional network
0.812024
Historical Embedding-Guided Efficient Large-Scale Federated Graph Learning · Proc. ACM Manag. Data 2024
Machine learning › Graph learning › graph sampling
neighbor sampling
0.812024
Historical Embedding-Guided Efficient Large-Scale Federated Graph Learning · Proc. ACM Manag. Data 2024
Machine learning › Trustworthy machine learning › interpretability › training data attribution
influence function
0.512021
HyDRA: Hypergradient Data Relevance Analysis for Interpreting Deep Neural Networks · AAAI 2021
Machine learning › Trustworthy machine learning
interpretability
0.512021
HyDRA: Hypergradient Data Relevance Analysis for Interpreting Deep Neural Networks · AAAI 2021
Machine learning › Trustworthy machine learning › interpretability
training data attribution
0.512021
HyDRA: Hypergradient Data Relevance Analysis for Interpreting Deep Neural Networks · AAAI 2021
Machine learning › Efficient and distributed learning › federated learning › federated learning systems
federated learning platform
0.412020
FedVision: An Online Visual Object Detection Platform Powered by Federated Learning · AAAI 2020
Computer vision › Image recognition and object detection
object detection
0.412020
FedVision: An Online Visual Object Detection Platform Powered by Federated Learning · AAAI 2020
Machine learning › Optimization for machine learning
convergence analysis
0.312026
Efficient Federated Learning With Mean Block Difference-Based Global Aggregation and Patience-Based Local Training · IEEE Trans. Knowl. Data Eng. 2026

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

patience-based local training · 1.0mean block difference aggregation · 1.0layer-wise learning · 1.0textual gradient · 0.9summarization · 0.9prompt aggregation · 0.9historical embedding estimator · 0.8adaptive embedding synchronization · 0.8quantization · 0.7block dropout · 0.7model training protocol · 0.6contribution evaluation · 0.6federated learning · 0.4
YearPublicationVenuePosition
2026 Efficient Federated Learning With Mean Block Difference-Based Global Aggregation and Patience-Based Local Training
abstract
As neural network models grow larger and more complex, federated learning (FL) faces challenges in terms of communication and computation efficiency. To address these issues, layer-wise learning has been proposed. Existing approaches did not leverage useful properties of layer-wise learning including update locking and variations in convergence rates, thereby resulting in sub-par model performance. To bridge this gap, we propose theFederatedMeanBlockDifference-based global model aggregation approach withPatience-based local training (FedMBDP). We automatically partition the neural network model into uncoupled blocks and progressively train them. Determining which blocks to train and aggregate becomes a critical task. To improve computation efficiency, we propose a patience-based local training algorithm to adaptively select training blocks, reducing computation latency. To improve communication efficiency, we introduce a mean block difference-based global model aggregation algorithm to dynamically select blocks for aggregation to minimize communication latency. We provide the convergence analysis of FedMBDP. Extensive experiments on three widely adopted benchmark datasets show that FedMBDP achieves superior performance compared to six state-of-the-art approaches. It reduces FL training latency by 26.37% compared to the best baseline, while achieving similar test accuracy.
Yuanyuan Chen 0012, Xiaoli Tang 0001, Han Yu 0001
IEEE Trans. Knowl. Data Eng.2
2025 Can Textual Gradient Work in Federated Learning?
abstract
Recent studies highlight the promise of LLM-based prompt optimization, especially with TextGrad, which automates ``differentiation'' via texts and backpropagates textual feedback provided by LLMs. This approach facilitates training in various real-world applications that do not support numerical gradient propagation or loss calculation. It opens new avenues for optimization in decentralized, resource-constrained environments, suggesting that users of black-box LLMs (e.g., ChatGPT) could enhance components of LLM agentic systems (such as prompt optimization) through collaborative paradigms like federated learning (FL). In this paper, we systematically explore the potential and challenges of incorporating textual gradient into FL. Our contributions are fourfold. **Firstly**, we introduce a novel FL paradigm, Federated Textual Gradient (FedTextGrad), that allows FL clients to upload their locally optimized prompts derived from textual gradients, while the FL server aggregates the received prompts through text summarization. Unlike traditional FL frameworks, which are designed for numerical aggregation, FedTextGrad is specifically tailored for handling textual data, expanding the applicability of FL to a broader range of problems that lack well-defined numerical loss functions. **Secondly**, building on this design, we conduct extensive experiments to explore the feasibility of federated textual gradients. Our findings highlight the importance of properly tuning key factors (e.g., local steps) in FL training to effectively integrate textual gradients. **Thirdly**, we highlight a major challenge in federated textual gradient aggregation: retaining essential information from distributed prompt updates. Concatenation often produces prompts that exceed the LLM API’s context window, while summarization can degrade performance by generating overly condensed or complex text that lacks key context. **Last but not least**, in response to this issue, we improve the vanilla variant of FedTextGrad by providing actionable guidance to the LLM when summarizing client prompts by leveraging the Uniform Information Density principle. Such a design reduces the complexity of the aggregated global prompt, thereby better incentivizing the LLM's reasoning ability. Through this principled study, we enable the adoption of textual gradients in FL for optimizing LLMs, identify important issues, and pinpoint future directions, thereby opening up a new research area that warrants further investigation.
Ruinan Jin, Wenlong Deng, Yuanyuan Chen 0012, Han Yu 0001, Xiaoxiao Li 0001
ICLR4
2024 Aggregating intrinsic information to enhance BCI performance through federated learning
abstract
Insufficient data is a long-standing challenge for Brain-Computer Interface (BCI) to build a high-performance deep learning model. Though numerous research groups and institutes collect a multitude of EEG datasets for the same BCI task, sharing EEG data from multiple sites is still challenging due to the heterogeneity of devices. The significance of this challenge cannot be overstated, given the critical role of data diversity in fostering model robustness. However, existing works rarely discuss this issue, predominantly centering their attention on model training within a single dataset, often in the context of inter-subject or inter-session settings. In this work, we propose a hierarchical personalized Federated Learning EEG decoding (FLEEG) framework to surmount this challenge. This innovative framework heralds a new learning paradigm for BCI, enabling datasets with disparate data formats to collaborate in the model training process. Each client is assigned a specific dataset and trains a hierarchical personalized model to manage diverse data formats and facilitate information exchange. Meanwhile, the server coordinates the training procedure to harness knowledge gleaned from all datasets, thus elevating overall performance. The framework has been evaluated in Motor Imagery (MI) classification with nine EEG datasets collected by different devices but implementing the same MI task. Results demonstrate that the proposed framework can boost classification performance up to 8.4% by enabling knowledge sharing between multiple datasets, especially for smaller datasets. Visualization results also indicate that the proposed framework can empower the local models to put a stable focus on task-related areas, yielding better performance. To the best of our knowledge, this is the first end-to-end solution to address this important challenge.
Rui Liu 0034, Yuanyuan Chen 0012, Anran Li 0001, Yi Ding 0012, Han Yu 0001, Cuntai Guan
Neural Networks2
2024 Historical Embedding-Guided Efficient Large-Scale Federated Graph Learning
abstract
Graph convolutional networks (GCNs) are promising for graph learning tasks. For privacy-preserving graph learning tasks involving distributed graph datasets, federated learning (FL)-based GCN (FedGCN) training is required. An important open challenge for FedGCN is scaling to large graphs, which typically incurs 1) high computation overhead for handling the explosively-increasing number of neighbors, and 2) high communication overhead of training GCNs involving multiple FL clients. Thus, neighbor sampling is being studied to enhance the scalability of FedGCNs. Existing FedGCN training techniques with neighbor sampling often produce extremely large communication and computation overhead and inaccurate node embeddings, leading to poor model performance. To bridge this gap, we propose the Federated Adaptive Attention-based Sampling (FedAAS) approach. It achieves substantial cost savings by efficiently leveraging historical embedding estimators and focusing the limited communication resources on transmitting the most influential neighbor node embeddings across FL clients. We further design an adaptive embedding synchronization scheme to optimize the efficiency and accuracy of FedAAS on large-scale datasets. Theoretical analysis shows that the approximation error induced by the staleness of historical embedding is upper bounded, and the model is guaranteed to converge in an efficient manner. Extensive experimental evaluation against four state-of-the-art baselines on six real-world graph datasets show that FedAAS achieves up to 5.12% higher test accuracy, while saving communication and computation costs by 95.11% and 94.76%, respectively.
Anran Li 0001, Yuanyuan Chen 0012, Jian Zhang 0087, Mingfei Cheng, Yihao Huang 0001, Yueming Wu 0001, Anh Tuan Luu, Han Yu 0001
Proc. ACM Manag. Data2
2023 Efficient Training of Large-Scale Industrial Fault Diagnostic Models through Federated Opportunistic Block Dropout
abstract
Artificial intelligence (AI)-empowered industrial fault diagnostics is important in ensuring the safe operation of industrial applications. Since complex industrial systems often involve multiple industrial plants (possibly belonging to different companies or subsidiaries) with sensitive data collected and stored in a distributed manner, collaborative fault diagnostic model training often needs to leverage federated learning (FL). As the scale of the industrial fault diagnostic models are often large and communication channels in such systems are often not exclusively used for FL model training, existing deployed FL model training frameworks cannot train such models efficiently across multiple institutions. In this paper, we report our experience developing and deploying the Federated Opportunistic Block Dropout (FedOBD) approach for industrial fault diagnostic model training. By decomposing large-scale models into semantic blocks and enabling FL participants to opportunistically upload selected important blocks in a quantized manner, it significantly reduces the communication overhead while maintaining model performance. Since its deployment in ENN Group in February 2022, FedOBD has served two coal chemical plants across two cities in China to build industrial fault prediction models. It helped the company reduce the training communication overhead by over 70% compared to its previous AI Engine, while maintaining model performance at over 85% test F1 score. To our knowledge, it is the first successfully deployed dropout-based FL approach.
Yuanyuan Chen 0012, Zichen Chen, Yansong Zhao, Zelei Liu, Zengxiang Li, Han Yu 0001
AAAI1
2022 Contribution-Aware Federated Learning for Smart Healthcare
abstract
Artificial intelligence (AI) is a promising technology to transform the healthcare industry. Due to the highly sensitive nature of patient data, federated learning (FL) is often leveraged to build models for smart healthcare applications. Existing deployed FL frameworks cannot address the key issues of varying data quality and heterogeneous data distributions across multiple institutions in this sector. In this paper, we report our experience developing and deploying the Contribution-Aware Federated Learning (CAFL) framework for smart healthcare. It provides an efficient and accurate approach to fairly evaluate FL participants' contribution to model performance without exposing their private data, and improves the FL model training protocol to allow the best performing intermediate models to be distributed to participants for FL training. Since its deployment in Yidu Cloud Technology Inc. in March 2021, CAFL has served 8 well-established medical institutions in China to build healthcare decision support models. It can perform contribution evaluations 2.84 times faster than the best existing approach, and has improved the average accuracy of the resulting models by 2.62% compared to the previous system (which is significant in industrial settings). To our knowledge, it is the first contribution-aware federated learning successfully deployed in the healthcare industry.
Zelei Liu, Yuanyuan Chen 0012, Yansong Zhao, Han Yu 0001, Yang Liu 0165, Renyi Bao, Jinpeng Jiang, Zaiqing Nie, Qian Xu 0005, Qiang Yang 0001
AAAI2
2022 GTG-Shapley: Efficient and Accurate Participant Contribution Evaluation in Federated Learning
abstract
Federated Learning (FL) bridges the gap between collaborative machine learning and preserving data privacy. To sustain the long-term operation of an FL ecosystem, it is important to attract high-quality data owners with appropriate incentive schemes. As an important building block of such incentive schemes, it is essential to fairly evaluate participants’ contribution to the performance of the final FL model without exposing their private data. Shapley Value (SV)–based techniques have been widely adopted to provide a fair evaluation of FL participant contributions. However, existing approaches incur significant computation costs, making them difficult to apply in practice. In this article, we propose the Guided Truncation Gradient Shapley (GTG-Shapley) approach to address this challenge. It reconstructs FL models from gradient updates for SV calculation instead of repeatedly training with different combinations of FL participants. In addition, we design a guided Monte Carlo sampling approach combined with within-round and between-round truncation to further reduce the number of model reconstructions and evaluations required. This is accomplished through extensive experiments under diverse realistic data distribution settings. The results demonstrate that GTG-Shapley can closely approximate actual Shapley values while significantly increasing computational efficiency compared with the state-of-the-art, especially under non-i.i.d. settings.
Zelei Liu, Yuanyuan Chen 0012, Han Yu 0001, Yang Liu 0165, Li-Zhen Cui 0001
ACM Trans. Intell. Syst. Technol.2
2021 HyDRA: Hypergradient Data Relevance Analysis for Interpreting Deep Neural Networks
abstract
The behaviors of deep neural networks (DNNs) are notoriously resistant to human interpretations. In this paper, we propose Hypergradient Data Relevance Analysis, or HyDRA, which interprets the predictions made by DNNs as effects of their training data. Existing approaches generally estimate data contributions around the final model parameters and ignore how the training data shape the optimization trajectory. By unrolling the hypergradient of test loss w.r.t. the weights of training data, HyDRA assesses the contribution of training data toward test data points throughout the training trajectory. In order to accelerate computation, we remove the Hessian from the calculation and prove that, under moderate conditions, the approximation error is bounded. Corroborating this theoretical claim, empirical results indicate the error is indeed small. In addition, we quantitatively demonstrate that HyDRA outperforms influence functions in accurately estimating data contribution and detecting noisy data labels. The source code is available at https://github.com/cyyever/aaai_hydra.
Yuanyuan Chen 0012, Boyang Li 0001, Han Yu 0001, Chunyan Miao
AAAI1
2020 FedVision: An Online Visual Object Detection Platform Powered by Federated Learning
abstract
Visual object detection is a computer vision-based artificial intelligence (AI) technique which has many practical applications (e.g., fire hazard monitoring). However, due to privacy concerns and the high cost of transmitting video data, it is highly challenging to build object detection models on centrally stored large training datasets following the current approach. Federated learning (FL) is a promising approach to resolve this challenge. Nevertheless, there currently lacks an easy to use tool to enable computer vision application developers who are not experts in federated learning to conveniently leverage this technology and apply it in their systems. In this paper, we report FedVision - a machine learning engineering platform to support the development of federated learning powered computer vision applications. The platform has been deployed through a collaboration between WeBank and Extreme Vision to help customers develop computer vision-based safety monitoring solutions in smart city applications. Over four months of usage, it has achieved significant efficiency improvement and cost reduction while removing the need to transmit sensitive data for three major corporate customers. To the best of our knowledge, this is the first real application of FL in computer vision-based tasks.
Yang Liu 0165, Anbu Huang, Youzhi Liu, Yuanyuan Chen 0012, Lican Feng, Tianjian Chen, Han Yu 0001, Qiang Yang 0001
AAAI6
2020 RPN: A Residual Pooling Network for Efficient Federated Learning
abstract
Federated learning is a distributed machine learning framework which enables different parties to collaboratively train a model while protecting data privacy and security. Due to model complexity, network unreliability and connection in-stability, communication cost has became a major bottleneck for applying federated learning to real-world applications. Current existing strategies are either need to manual setting for hyperparameters, or break up the original process into multiple steps, which make it hard to realize end-to-end implementation. In this paper, we propose a novel compression strategy called Residual Pooling Network (RPN). Our experiments show that RPN not only reduce data transmission effectively, but also achieve almost the same performance as compared to standard federated learning. Our new approach performs as an end-to-end procedure, which should be readily applied to all CNN-based model training scenarios for improvement of communication efficiency, and hence make it easy to deploy in real-world application without much human intervention.
Anbu Huang, Yuanyuan Chen 0012, Yang Liu 0165, Tianjian Chen, Qiang Yang 0001
ECAI2