YXYin Xu

Yin Xu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yin Xu has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    MACReD: A Multi-Agent Collaborative Reasoning Framework for Reaction Diagram Parsing

    by Chuang Tang, Chenhao Lin, Yin Xu, Hao Wang, Jinrui Zhou, Xin Li, Mingjun Xiao, Enhong Chen

    Parsing chemical reaction diagrams from scientific literature is challenging due to heterogeneous layouts, intertwined visual elements, and difficulty in integrating visual recognition with chemically consistent reasoning. Existing Vision Language Models advance multimodal understanding but remain unreliable on complex reaction diagrams, where spatial coherence, condition attribution, and reaction-level structural consistency must be jointly resolved. To address these issues, we propose MACReD, a hierarchical multi-agent framework that coordinates specialized agents for molecular perception, arrow understanding, text extraction, and reaction reconstruction within a unified VLM-guided architecture. The Planning Layer supports task-adaptive agent routing, while the Perception and Reasoning Layers integrate heterogeneous visual cues through Multigraph Fusion to construct chemically consistent reaction graphs. Experiments on the RxnScribe benchmark show that MACReD achieves state-of-the-art F1 performance under both Hard and Soft Match criteria, reaching 75.2% and 84.6%, respectively. Specifically, MACReD improves the previous best Hard Match F1 achieved by RxnIM by +2.8 points and the previous best Soft Match F1 achieved by RxnScribe by +4.6 points. Additional evaluation on a manually annotated subset of 100 reaction diagrams shows consistent gains across diverse layouts. Our code. https://github.com/TC9905/MACReD is publicly available.

  • Open Access

    Multimodal deep learning framework for Alzheimer’s stage classification using GAN-augmented MRI and clinical data

    by Talha Shahan Ahmad, Ghulam Hussain Noori, Abdul Wahab, Yin Xu

    Alzheimer’s disease (AD) diagnosis remains challenging due to the scarcity of annotated medical imaging data, pronounced class imbalance, and the subtlety of early-stage structural brain changes. Traditional deep learning approaches often overfit to majority classes and lack interpretability, limiting their clinical adoption. We propose a multimodal deep learning framework that fuses MRI-derived spatial features with standardized clinical parameters to enhance Alzheimer’s stage classification. The pipeline incorporates a GAN-based augmentation module to synthetically expand minority class samples, validated using MS-SSIM and expert review, thereby mitigating class imbalance. MRI features are extracted using a fine-tuned ResNet50, where lower convolutional layers preserve general spatial feature detectors while higher layers adapt to AD-specific morphological patterns. Clinical features, normalized via z-score scaling, are concatenated with MRI-derived embeddings to form a unified multimodal representation. This joint vector is processed through fully connected layers for four-stage classification Non-Demented, Very Mild Demented, Mild Demented and Moderate Demented. Model interpretability is ensured via Grad-CAM for spatial saliency mapping and clinical feature attribution, offering transparent decision support for healthcare practitioners. Experimentally, the framework achieved 97.56% validation accuracy, 0.98 macro precision, 0.97 macro recall and 0.98 macro F1-score, outperforming a baseline CNN (85.00% accuracy) and a GAN-augmented CNN (95.00% accuracy). Minority class recognition, such as for Moderate Demented improved from near-zero representation to 99% precision and recall due to balanced augmentation. This approach offers a scalable, interpretable, and high-accuracy diagnostic solution with the potential to transform automated neurodegenerative disease detection in clinical and telemedicine settings.

  • Enhancing Decentralized Federated Learning With Model Pruning and Adaptive Communication

    by Yin Xu, Mingjun Xiao, Jie Wu, Guoju Gao, Datian Li, Haotian Xu, Tongxiao Zhang

    Federated learning (FL) is a distributed learning paradigm that enables large-scale IoT devices to collaboratively train a shared model while preserving the privacy of local data. To avoid the single-point-of-failure of the conventional parameter server architecture, the study concentrates on the decentralized FL (DFL) paradigm building on the device-to-device communication network. However, existing DFL frameworks encounter challenges related to resource limitations, privacy protection, and data heterogeneity. To overcome these challenges, the study proposes and implements DF $^{2}$ -MPC in industrial IoT, an efficient DFL framework with personalized model pruning and adaptive communication. Specifically, a personalized pruning ratio determination approach is designed by exploiting the model pruning technique. This approach enables all devices to flexibly determine pruning ratios by themselves, thereby achieving both communication savings and privacy protection. Then, this study designs an adaptive neighbor selection scheme, which can enhance model performance and foster model consensus under resource constraints. In addition, the study theoretically proves the convergence performance of DF $^{2}$ -MPC. Finally, extensive simulations on three real-world traces are conducted to corroborate the superiority of DF $^{2}$ -MPC, demonstrating that the method can improve communication efficiency with satisfactory model accuracy and convergence performance.


  • Privacy Preserving Task Push in Spatial Crowdsourcing With Unknown Popularity

    by Yin Xu, Mingjun Xiao, Jie Wu, He Sun

    In this paper, we investigate the privacy-preserving task push problem with unknown popularity in Spatial Crowdsourcing (SC), where the platform needs to select some tasks with unknown popularity and push them to workers. Meanwhile, the preferences of workers and the popularity values of tasks might involve some sensitive information, which should be protected from disclosure. To address these concerns, we propose a Privacy Preserving Auction-based Bandit scheme, termed PPAB. Specifically, on the basis of the Combinatorial Multi-armed Bandit (CMAB) game, we first construct a Differentially Private Auction-based CMAB (DPA-CMAB) model. Under the DPA-CMAB model, we design a privacy-preserving arm-pulling policy based on Diffie-Hellman (DH), Differential Privacy (DP), and upper confidence bound, which includes the DH-based encryption mechanism and the hybrid DP-based protection mechanism. The policy not only can learn the popularity of tasks and make online task push decisions, but also can protect the popularity as well as workers’ preferences from being revealed. Meanwhile, we design an auction-based incentive mechanism to determine the payment for each selected task. Furthermore, we conduct an in-depth analysis of the security and online performance of PPAB, and prove that PPAB satisfies some desired properties (i.e., truthfulness, individual rationality, and computational efficiency). Finally, the significant performance of PPAB is confirmed through extensive simulations on the real-world dataset.


  • Crowdsensing Data Trading for Unknown Market: Privacy, Stability, and Conflicts

    by He Sun, Mingjun Xiao, Yin Xu, Guoju Gao, Shu Zhang

    In recent years, Crowdsensing Data Trading (CDT) has emerged as a new data trading paradigm, where buyers crowdsource data collection tasks to a group of mobile users with sensing devices (a.k.a., sellers) who sell the collected data to them, through a platform as the broker for a long-term data trading. One of the most critical issues in CDT is ensuring the stability of the matching between buyers and sellers in the data trading market. In this paper, we focus on privacy protection and the stability problems in the CDT market with unknown preference sequences of buyers. The goal is to protect sellers' data qualities and ensure the CDT market's stability while maximizing the cumulative data quality for each task. We model this problem as a differentially private multi-player multi-armed competing bandit problem and propose a novel metric of the approximate stability, called $\delta$ -stability. We propose a privacy-preserving stable CDT mechanism called DPS-CB to solve this problem in the centralized setting, which is based on stable matching theory, and competing bandit strategy. Moreover, we extend it into decentralized setting in order to avoid the competitive matching conflicts caused in this setting and propose a Conflicts-avoiding DPS-CB mechanism, called CDPS-CB, by using Bernoulli probability and selecting feasible sets of sellers. In addition, we prove the security and stability of the CDT market under privacy concerns and analyze the regret performance of DPS-CB and CDPS-CB mechanisms, respectively. Finally, the significant performance of these two mechanisms is demonstrated through extensive simulations on a real-world dataset.


  • Age-of-Information-Aware Federated Learning

    by Yin Xu, Ming-Jun Xiao, Chen Wu, Jie Wu, Jin-Rui Zhou, He Sun


  • AoI-Guaranteed Incentive Mechanism for Mobile Crowdsensing With Freshness Concerns

    by Yin Xu, Mingjun Xiao, Yu Zhu, Jie Wu, Sheng Zhang, Jinrui Zhou

    With the explosive spread of smart mobile devices, Mobile CrowdSensing (MCS) has been becoming a promising paradigm, by which a platform can coordinate a group of workers to complete large-scale data collection tasks using their mobile devices. In this paper, we investigate the incentive mechanism design in MCS systems, taking the freshness of collected data and social benefits into consideration. First, the Age of Information (AoI) metric is introduced to measure the freshness of data. Then, we model the incentive mechanism design with AoI guarantees as an incomplete information two-stage Stackelberg game with multiple constraints. Next, we consider the scenario that all participants share the public utility function parameters of the Stackelberg game. By deriving the optimal remuneration paid by the platform and the optimal data update frequency for each worker, and proving the existence of a unique Stackelberg equilibrium, we propose an AoI-guaranteed Incentive Mechanism (AIM) that enables the platform and all workers to maximize their utilities simultaneously. Furthermore, we extend AIM to a general scenario where each participant has no prior knowledge of the utility function parameters of the game. By resorting to the Deep Reinforcement Learning (DRL) technique and modeling the two-stage Stackelberg game as a Markov decision process, we propose a DRL-based Incentive Mechanism (DIM) with AoI guarantees, which makes each participant effectively seek its optimal strategy through trial and error. Meanwhile, the system can guarantee that the AoI values of all data uploaded to the platform are not larger than a given threshold. Finally, numerical experiments on real-world traces are conducted to validate the efficacy and efficiency of AIM and DIM.


  • A Personalized Privacy Preserving Mechanism for Crowdsourced Federated Learning

    by Yin Xu, Mingjun Xiao, Jie Wu, Haisheng Tan, Guoju Gao

    In this paper, we focus on the privacy preserving mechanism design for crowdsourced Federated Learning (FL), where a requester can outsource its model training task to some workers via an FL platform. A potential way to preserve the privacy of workers' local data is to leverage Differential Privacy (DP) mechanisms on local models. However, most of these studies cannot allow workers to dominate their own privacy protection levels by themselves. Thus, we propose a Personalized Privacy Preserving Mechanism, called P3M, to satisfy the heterogeneous privacy needs of workers, which consists of two parts. The first part includes a personalized privacy budget determination problem. We model it as a two-stage Stackelberg game, derive the personalized privacy budget for each worker and the optimal payment for the requester, and prove that they form a unique Stackelberg equilibrium. Second, we design a dynamic perturbation scheme to perturb model parameters. Through the theoretical analysis, we prove that P3M satisfies the desired DP property, and derive the bounds of the variance of average perturbed parameters and the convergence upper bound. This demonstrates that the global model accuracy can be controllable and P3M is endowed with the satisfactory convergence performance. In addition, we extend our problem to the scenario where the total privacy budget of all workers is limited, so as to prevent some workers from setting exorbitant privacy budgets. Under the privacy constraint, we re-determine the personalized privacy budget for each worker. Finally, exhaustive simulations of P3M are conducted based on real-world datasets, and the experimental results corroborate its effectiveness and practicability.


  • Edge Resource Prediction and Auction for Distributed Spatial Crowdsourcing With Differential Privacy

    by Yin Xu, Mingjun Xiao, An Liu, Jie Wu

    Traditional spatial crowdsourcing (SC) systems employ a centralized server platform to provide services for requesters. Such a centralized design requires powerful resource capacity and often cannot accomplish the urgent demands due to the unpredictable network latency. In order to ensure the scalability of systems and the quality of services, we study the distributed SC (DSC), where a diversity of location-relative services provided by various service providers (SPs) can deploy on edge clouds (ECs) with low time latency. Since the edge resources are limited, SPs need to compete for edge resources so as to deploy their desired SC services, and the requested resources must be allocated together to meet the demand of the service. We first design a gated recurrent unit with particle filter (GRUPF) network for SPs to predict future resource demands so as to participate in the competitions judiciously. Then, we model the competitive edge resource allocation problem between SPs and ECs as a combinatorial auction process. Due to the NP-hardness of this problem, an approximation algorithm is proposed to tackle it. Moreover, the leakage of private information such as bids may incur severe economic damage, and most existing studies usually rely on a trusted third party to provide rigorous privacy protection. Therefore, we customize a novel differentially private resource auction (DRA) mechanism, and design a bid confusion strategy based on differential privacy. Through theoretical analysis, we prove that the DRA mechanism meets some desired properties, including $\epsilon $ -differential privacy, individual rationality, computational efficiency, and $\gamma $ -truthfulness. Additionally, we corroborate the significant performances of DRA through extensive simulations on synthetic and real-world data sets.