Global Data Distribution Research Articles

An effective unsupervised domain adaptation for in-field potato disease recognition

Accurate disease recognition through computer vision is crucial for the intelligent management of potato production. Popular data-driven classification methods face challenges including limited labelled data and poor model portability. Unsupervised Domain Adaptation (UDA) addresses these challenges with a novel learning strategy. However, the complex field environment introduces a significant domain shift problem due to varying conditions. Existing UDA methods usually concentrate on aligning global data distribution and employ a single structure for disease feature extraction, thereby limiting their efficacy in true field environment. To tackle this challenge of potato disease recognition, the Multi-Representation Adaptive Network (MRSAN) based on subdomain alignment is presented. MRSAN effectively aligns feature distributions across diverse data by minimising distribution differences among relevant subdomains. Simultaneously, the multi-representation extraction method captures finer details from various perspectives in the disease images. The combination of these two approaches efficiently mitigates the adverse effects caused by various interference factors in field environment. Based on the acquisition conditions of light variation and disease progression, two field potato disease image datasets are created, containing five and six kinds of potato leaf disease, respectively. Extensive transfer experiments are conducted on the two datasets. MRSAN achieves average classification accuracies of 87.03% and 80.06% on the datasets for the corresponding transfer tasks, outperforming the other compared methods. This not only validates the effectiveness of MRSAN but also demonstrates its robust ability to generalise across changes in regard to light variation and disease progression.

From shallows to depths: unveiling hybrid synthetic data modeling for enhanced learning with privacy considerations in naturally imbalanced datasets

Data serves as the foundational element that drives model development and performance in machine learning and deep learning. The learning algorithms are as good as data on which they are trained on. Data constrained environments pose serious threat to the effectiveness of learning algorithms. Data limitations stem from a range of factors, including regulatory restrictions, privacy concerns, and the inherent scarcity of relevant data. This constrained availability of data often leads to class imbalance problem in the context of classification tasks. To address the challenges of limited data, the algorithmic generated data, also known as synthetic data, is gaining significant traction as a cost-effective, readily available, and secure alternative. Synthetic data generation techniques can be employed to enhance dataset size by augmenting data samples and to address class imbalance by increasing the number of minority class instances. These techniques generally fall into two main categories: distance-based shallow models and probability estimation-based deep generative models. Shallow interpolation-based models generate new data points within the local space between existing data points, while deep density estimation based models generate new data by learning the whole distribution of data. . In the context of smaller datasets, deep generative models often struggle to accurately estimate the probability distribution of whole data. To effectively represent the global data distribution, these deep models require initial starting data samples to guide their approximation. This paper examines the potential of integration of shallow and deep generative models in the data generation pipeline for effective synthetic data augmentation which furthers enhanced learning and generalization of downstream tasks. In this work, we present a hybrid approach of tabular data generation involving mixed type data attributes (continuous, discrete) and pay special attention to data imbalance and insufficient data problems. We introduce the Hybrid Data Balancing and Augmentation Approach for Mixed Tabular Data (HDBA-MTD), specifically designed to synthesize samples for underrepresented labels of output class and address issues of insufficient data instances. This approach enhances training data diversity, thereby paying special attention to the downstream classification and generalization performance. Experiments are carried out using benchmark datasets to assess the practicality of the presented hybrid model in real-world scenarios. This work has also attempted to quantify the privacy preservability for real data concerning ethical considerations and data security circumstances. The evaluation and analysis of these experiments show that the present hybrid model performs favorably compared to other current hybrid synthetic data generation methods.

SCGAN: Semi-Centralized Generative Adversarial Network for image generation in distributed scenes

Distributed Generative Adversarial Networks (GANs) are pivotal for generative tasks in distributed data environments. Conventional architectures, whether centralized or decentralized, inadequately balance global and local data distribution integration. We propose the Semi-Centralized Distributed GAN (SCGAN), a hybrid framework combining the merits of both approaches. SCGAN employs dual generators — one decentralized, one centralized — and a feature extractor that optimizes their outputs by dynamically calculating feature distances, thereby achieving a balanced semi-centralized generator. Extensive experiments on five benchmark image datasets reveal that SCGAN surpasses existing models, delivering superior Fréchet Inception Distance (FID) scores and generating highly realistic images. Moreover, SCGAN’s robustness and versatility are demonstrated through its efficacy in downstream applications, including image augmentation and distributed privacy protection. Notably, SCGAN’s generated images were evaluated using a distributed classifier, a quality metric (IS), and human observation, consistently outperforming existing methods. This study highlights SCGAN’s significant advancements in distributed generative modeling and its nuanced approach to managing complex data distributions, particularly excelling in privacy-preserving scenarios.

Simulating federated learning for steatosis detection using ultrasound images

We aimed to implement four data partitioning strategies evaluated with four federated learning (FL) algorithms and investigate the impact of data distribution on FL model performance in detecting steatosis using B-mode US images. A private dataset (153 patients; 1530 images) and a public dataset (55 patient; 550 images) were included in this retrospective study. The datasets contained patients with metabolic dysfunction-associated fatty liver disease (MAFLD) with biopsy-proven steatosis grades and control individuals without steatosis. We employed four data partitioning strategies to simulate FL scenarios and we assessed four FL algorithms. We investigated the impact of class imbalance and the mismatch between the global and local data distributions on the learning outcome. Classification performance was assessed with area under the receiver operating characteristic curve (AUC) on a separate test set. AUCs were 0.93 (95% CI 0.92, 0.94) for source-based partitioning scenario with FedAvg, 0.90 (95% CI 0.89, 0.91) for a centralized model, and 0.83 (95% CI 0.81, 0.85) for a model trained in a single-center scenario. When data was perfectly balanced on the global level and each site had an identical data distribution, the model yielded an AUC of 0.90 (95% CI 0.88, 0.92). When each site contained data exclusively from one single class, irrespective of the global data distribution, the AUC fell in the range of 0.34–0.70. FL applied to B-mode US images provide performance comparable to a centralized model and higher than single-center scenario. Global data imbalance and local data heterogeneity influenced the learning outcome.

Missing Data Imputation with Uncertainty-Driven Network

We study the problem of missing data imputation, which is a fundamental task in the area of data quality that aims to impute the missing data to achieve the completeness of datasets. Though the recent distribution-modeling-based techniques (e.g., distribution generation and distribution matching) can achieve state-of-the-art performance in terms of imputation accuracy, we notice that (1) they deploy a sophisticated deep learning model that tends to be overfitting for missing data imputation; (2) they directly rely on a global data distribution while overlooking the local information. Driven by the inherent variability in both missing data and missing mechanisms, in this paper, we explore the uncertain nature of this task and aim to address the limitations of existing works by proposing an u<u>N</u>certainty-driven netw<u>O</u>rk for <u>M</u>issing data <u>I</u>mputation, termed NOMI. NOMI has three key components, i.e., the retrieval module, the neural network gaussian process imputator (NNGPI) and the uncertainty-based calibration module. NOMI~ runs these components sequentially and in an iterative manner to achieve a better imputation performance. Specifically, in the retrieval module, NOMI~ retrieves local neighbors of the incomplete data samples based on the pre-defined similarity metric. Subsequently, we design NNGPI~ that merges the advantages of both the Gaussian Process and the universal approximation capacity of neural networks. NNGPI~ models the uncertainty by learning the posterior distribution over the data to impute missing values while alleviating the overfitting issue. Moreover, we further propose an uncertainty-based calibration module that utilizes the uncertainty of the imputator on its prediction to help the retrieval module obtain more reliable local information, thereby further enhancing the imputation performance. We also demonstrate that our NOMI~ can be reformulated as an instance of the well-known Expectation Maximization (EM) algorithm, highlighting the strong theoretical foundation of our proposed methods. Extensive experiments are conducted over 12 real-world datasets. The results demonstrate the excellent performance of NOMI in terms of both accuracy and efficiency.

Utilizing cost-effective portable equipment to enhance COVID-19 variant tracking both on-site and at a large scale.

Despite optimistic predictions on the eventual end of COVID-19 (Coronavirus Disease 2019), caution is necessary regarding the emergence of new variants to sustain a positive outlook and effectively address any potential future outbreaks. However, ongoing efforts to track COVID-19 variants are concentrated in developed countries and unique social practices and remote habitats of indigenous peoples present additional challenges. By combining small-sized equipment that is easily accessible and inexpensive, we performed SARS-CoV-2 (Severe Acute Respiratory Syndrome Coronavirus 2) whole genome sequencing and measured the sample-to-answer time and accuracy of this portable variant tracking tool. Our portable design determined the variant of SARS-CoV-2 in an infected individual within 9 hours and 15 minutes without external power or internet connection, surpassing the speed of previous portable tools. It took only 16 minutes to complete sequencing run, whole genome assembly, and lineage determination using a single standalone laptop. We then demonstrated the capability to produce 289 SARS-CoV-2 whole genome sequences in a single portable sequencing run, representing a significant improvement over an existing throughput of 96 sequences per run. We verified the accuracy of portable sequencing by comparison with two other independent sequencing methods. We showed that our high-throughput data consistently represented the circulating variants in Los Angeles, United States, when compared with publicly available sequences. Our scheme is designed to be flexible, rapid, and accurate, making it a valuable tool for large-scale surveillance operations in low- and middle-income countries as well as targeted surveys for vulnerable populations in remote locations.IMPORTANCEThere have been significant efforts to track COVID-19 (Coronavirus Disease 2019) variants, accumulating over 15 million SARS-CoV-2 sequences as of 2023. However, the distribution of global survey data is highly skewed, with nearly half of all countries having inadequate or low levels of genomic surveillance. In addition, indigenous peoples face more severe threats from COVID-19, due to their generally remote residence and unique social practices. Cost-effective portable sequencing tools have been used to investigate Ebola and Zika outbreaks. However, these tools have a sample-to-answer time of around 24 hours and require an internet connection for data transfer to an off-site cloud server. In our study, we rapidly determined COVID-19 variants using only small and inexpensive equipment, with a completion time of 9 hours and 15 minutes. Furthermore, we produced 289 near-full-length SARS-CoV-2 genome sequences from a single portable Nanopore sequencing run, representing a threefold increase in throughput compared with existing Nanopore sequencing methods.

Epoch-Evolving Gaussian Process Guided Learning for Classification.

The conventional mini-batch gradient descent algorithms are usually trapped in the local batch-level distribution information, resulting in the ``zig-zag'' effect in the learning process. To characterize the correlation information between the batch-level distribution and the global data distribution, we propose a novel learning scheme called epoch-evolving Gaussian process guided learning (GPGL) to encode the global data distribution information in a non-parametric way. Upon a set of class-aware anchor samples, our GP model is built to estimate the class distribution for each sample in mini-batch through label propagation from the anchor samples to the batch samples. The class distribution, also named the context label, is provided as a complement for the ground-truth one-hot label. Such a class distribution structure has a smooth property and usually carries a rich body of contextual information that is capable of speeding up the convergence process. With the guidance of the context label and ground-truth label, the GPGL scheme provides a more efficient optimization through updating the model parameters with a triangle consistency loss. Furthermore, our GPGL scheme can be generalized and naturally applied to the current deep models, outperforming the state-of-the-art optimization methods on six benchmark datasets.

Facilitating efficient energy distribution and storage: The role of data consistency technologies in Azure Cosmos DB

This article delves into the critical aspect of data consistency in globally distributed databases, with a specific focus on Azure Cosmos DB, Microsoft’s flagship globally distributed database service. It begins by outlining the inherent challenges of maintaining data consistency across a distributed architecture, such as network latency and the need for effective conflict resolution mechanisms. The introduction sets the stage for a deeper exploration of these challenges and their implications for applications requiring global scalability. The subsequent sections provide a detailed examination of the architecture and features of Azure Cosmos DB, highlighting its global data distribution capabilities, support for multiple data models, and flexible consistency models. The discussion emphasizes the importance of selecting the appropriate consistency level based on application requirements, balancing the trade-offs between consistency, performance, and availability. Further, the article addresses the technical underpinnings and solutions employed by Azure Cosmos DB to achieve data consistency, including advanced algorithms like vector clocks for session consistency and log replication mechanisms for strong and bounded consistency models. These technologies play a pivotal role in ensuring data integrity and timely access across the distributed database. The conclusion synthesizes the insights gained from the exploration of Azure Cosmos DB’s approach to data consistency, underscoring the platform’s adeptness at providing a robust, flexible, and efficient solution for managing data in a globally distributed context. The article emphasizes the critical role of platforms like Azure Cosmos DB in meeting the modern digital enterprise’s demands for real-time data access and integrity across a global infrastructure.

GMRLNet: A graph-based manifold regularization learning framework for placental insufficiency diagnosis on incomplete multimodal ultrasound data.

Multimodal analysis of placental ultrasound (US) and microflow imaging (MFI) could greatly aid in the early diagnosis and interventional treatment of placental insufficiency (PI), ensuring a normal pregnancy. Existing multimodal analysis methods have weaknesses in multimodal feature representation and modal knowledge definitions and fail on incomplete datasets with unpaired multimodal samples. To address these challenges and efficiently leverage the incomplete multimodal dataset for accurate PI diagnosis, we propose a novel graph-based manifold regularization learning (MRL) framework named GMRLNet. It takes US and MFI images as input and exploits their modality-shared and modality-specific information for optimal multimodal feature representation. Specifically, a graph convolutional-based shared and specific transfer network (GSSTN) is designed to explore intra-modal feature associations, thus decoupling each modal input into interpretable shared and specific spaces. For unimodal knowledge definitions, graph-based manifold knowledge is introduced to describe the sample-level feature representation, local inter-sample relations, and global data distribution of each modality. Then, an MRL paradigm is designed for inter-modal manifold knowledge transfer to obtain effective cross-modal feature representations. Furthermore, MRL transfers the knowledge between both paired and unpaired data for robust learning on incomplete datasets. Experiments were conducted on two clinical datasets to validate the PI classification performance and generalization of GMRLNet. State-of-the-art comparisons show the higher accuracy of GMRLNet on incomplete datasets. Our method achieves 0.913 AUC and 0.904 balanced accuracy (bACC) for paired US and MFI images, as well as 0.906 AUC and 0.888 bACC for unimodal US images, illustrating its application potential in PI CAD systems.

Towards Data-Independent Knowledge Transfer in Model-Heterogeneous Federated Learning

Federated Distillation (FD) extends classic Federated Learning (FL) to a more general training framework that enables model-heterogeneous collaborative learning by Knowledge Distillation (KD) across multiple clients and the server. However, existing KD-based algorithms usually require a set of shared input samples for each client to produce soft-prediction for distillation. Worse still, such a manual selection is accompanied by careful deliberations or prior information on clients' private data distribution, which is not in line with the privacy-preserving characteristic of classic FL. In this paper, we propose a novel training framework to achieve data-independent knowledge transfer by properly designing a distributed generative adversarial network (GAN) between the server and clients that can synthesize shared feature representations to facilitate the FD training. Specifically, we deploy a generator on the server and reuse each local model as a federated discriminator to form a lightweight efficient distributed GAN that can automatically synthesize simulated global feature representations for distillation. Moreover, since the synthesized feature representations are usually more faithful and homologous with global data distribution, faster and better training convergence can be obtained. Extensive experiments on different tasks and heterogeneous models demonstrate the effectiveness of the proposed framework on model accuracy and communication overhead.

FedNP: Towards Non-IID Federated Learning via Federated Neural Propagation

Traditional federated learning (FL) algorithms, such as FedAvg, fail to handle non-i.i.d data because they learn a global model by simply averaging biased local models that are trained on non-i.i.d local data, therefore failing to model the global data distribution. In this paper, we present a novel Bayesian FL algorithm that successfully handles such a non-i.i.d FL setting by enhancing the local training task with an auxiliary task that explicitly estimates the global data distribution. One key challenge in estimating the global data distribution is that the data are partitioned in FL, and therefore the ground-truth global data distribution is inaccessible. To address this challenge, we propose an expectation-propagation-inspired probabilistic neural network, dubbed federated neural propagation (FedNP), which efficiently estimates the global data distribution given non-i.i.d data partitions. Our algorithm is sampling-free and end-to-end differentiable, can be applied with any conventional FL frameworks and learns richer global data representation. Experiments on both image classification tasks with synthetic non-i.i.d image data partitions and real-world non-i.i.d speech recognition tasks demonstrate that our framework effectively alleviates the performance deterioration caused by non-i.i.d data.

Modeling global distribution for federated learning with label distribution skew

Federated learning achieves joint training of deep models by connecting decentralized datasources, which can significantly mitigate the risk of privacy leakage. However, in a more general case, the distributions of labels among clients are different, called “label distribution skew”. Directly applying conventional federated learning without consideration of label distribution skew issue significantly hurts the performance of the global model. To this end, we propose a novel federated learning method, named FedMGD, to alleviate the performance degradation caused by the label distribution skew issue. It introduces a global Generative Adversarial Network to model the global data distribution without access to local datasets, so the global model can be trained using the global information of data distribution without privacy leakage. The experimental results demonstrate that our proposed method significantly outperforms the state-of-the-art on several public benchmarks. Code is available at https://www.github.com/Sheng-T/FedMGD.

The Las Hoyas Lagerstätte: a palaeontological view of an Early Cretaceous wetland

Las Hoyas (Cuenca, Spain) represents a unique Early Cretaceous (Barremian) fossil biota of a wetland. The site has yielded a particularly diverse assemblage of >20 000 plant and animal fossils, many of which present unprecedented soft tissue preservation, including microstructural details. Among the most significant discoveries are the oldest angiosperms, the smallest species of chondrichtians and squamates, new theropod dinosaurs, including several enantiornithine birds, the first European tapejarid pterosaur and the most complete eutriconodont mammal. Such discoveries have produced data on important aspects related to plant and animal evolution, such as the first steps in flower development by plants, insights into unknown anatomical and diet specializations in theropod dinosaurs, the development of flight manoeuvrability in early birds, the unexpected global distribution of tapejarid dinosaurs and ground-breaking data on early mammalian hair development. There are many more discoveries to unveil and new research is now linking the immense wealth of palaeobiological information with mathematical procedures to study the ecological structure of the wetland. Supplementary material: Taxonomic structure of the Las Hoyas diversity and systematic list of unearthed taxa are available at https://doi.org/10.6084/m9.figshare.c.6336914

Spectral Clustering With Adaptive Neighbors for Deep Learning.

Spectral clustering is a well-known clustering algorithm for unsupervised learning, and its improved algorithms have been successfully adapted for many real-world applications. However, traditional spectral clustering algorithms are still facing many challenges to the task of unsupervised learning for large-scale datasets because of the complexity and cost of affinity matrix construction and the eigen-decomposition of the Laplacian matrix. From this perspective, we are looking forward to finding a more efficient and effective way by adaptive neighbor assignments for affinity matrix construction to address the above limitation of spectral clustering. It tries to learn an affinity matrix from the view of global data distribution. Meanwhile, we propose a deep learning framework with fully connected layers to learn a mapping function for the purpose of replacing the traditional eigen-decomposition of the Laplacian matrix. Extensive experimental results have illustrated the competitiveness of the proposed algorithm. It is significantly superior to the existing clustering algorithms in the experiments of both toy datasets and real-world datasets.

ScGGAN: single-cell RNA-seq imputation by graph-based generative adversarial network.

Single-cell RNA sequencing (scRNA-seq) data are typically with a large number of missing values, which often results in the loss of critical gene signaling information and seriously limit the downstream analysis. Deep learning-based imputation methods often can better handle scRNA-seq data than shallow ones, but most of them do not consider the inherent relations between genes, and the expression of a gene is often regulated by other genes. Therefore, it is essential to impute scRNA-seq data by considering the regional gene-to-gene relations. We propose a novel model (named scGGAN) to impute scRNA-seq data that learns the gene-to-gene relations by Graph Convolutional Networks (GCN) and global scRNA-seq data distribution by Generative Adversarial Networks (GAN). scGGAN first leverages single-cell and bulk genomics data to explore inherent relations between genes and builds a more compact gene relation network to jointly capture the homogeneous and heterogeneous information. Then, it constructs a GCN-based GAN model to integrate the scRNA-seq, gene sequencing data and gene relation network for generating scRNA-seq data, and trains the model through adversarial learning. Finally, it utilizes data generated by the trained GCN-based GAN model to impute scRNA-seq data. Experiments on simulated and real scRNA-seq datasets show that scGGAN can effectively identify dropout events, recover the biologically meaningful expressions, determine subcellular states and types, improve the differential expression analysis and temporal dynamics analysis. Ablation experiments confirm that both the gene relation network and gene sequence data help the imputation of scRNA-seq data.

Wide & deep generative adversarial networks for recommendation system

Generative Adversarial Networks (GANs) has achieved great success in computer vision like Image Inpainting, Image Super-Resolution. Many researchers apply it to improve the effectiveness of recommendation system. However, GANs-based methods obtain users’ preferences using a single Neural Network framework in generative model, which may not be fully mined. Furthermore, most GANs-based algorithms adopt cross-entropy loss to get pair-wise bias, but these methods don’t reveal global data distribution loss when data are sparse. Those problems will influence the performance of the algorithm and result in poor accuracy. To address these problems, we introduce Wide & Deep Generative Adversarial Networks for Recommendation System (a.k.a W & DGAN) in this paper. On the one hand, we employ Wide & Deep Learning as a generative model capable of extracting both explicit and implicit information of user preferences. Furthermore, we combine Cross-Entropy loss in G with Wasserstein loss in D to get data distribution, then, the joint loss will be to receive the training information feedback from data distribution. Empirical results on three public benchmarks show that W&DGAN significantly outperforms state-of-the-art methods.

Multidimensional grid-based clustering with local differential privacy

Privacy-preserving clustering has received increasing research attention in recent years. Local differential privacy (LDP) is a privacy model without relying on trusted third parties. It plays a crucial role in distributed privacy-preserving clustering. Most previous methods focus on partition-based clustering (e.g., k-means), which necessitates many iterative interactions. Massive iterations cause a division of the privacy budget and increase the amount of individual noise, affecting the clustering utility. To address this issue, we turn to grid-based clustering and design the GC-LDP algorithm to balance the privacy and clustering utility with only three rounds of interactions. In GC-LDP, our core contribution is to develop a non-uniform grid division method via the coefficient of variation (CV), which can generate a grid structure approximating the global data distribution within two rounds of interactions. Besides, we designed a new perturbation mechanism to reduce the amount of individual noise injection. Further, a cell aggregation method is developed by exploring the relative density difference among grids to achieve multi-density clustering. Theoretical analysis and experiments on real-world datasets show that GC-LDP can obtain high-quality clustering results while satisfying local differential privacy.

A Curriculum Batching Strategy for Automatic ICD Coding with Deep Multi-Label Classification Models.

The International Classification of Diseases (ICD) has an important role in building applications for clinical medicine. Extremely large ICD coding label sets and imbalanced label distribution bring the problem of inconsistency between the local batch data distribution and the global training data distribution into the minibatch gradient descent (MBGD)-based training procedure for deep multi-label classification models for automatic ICD coding. The problem further leads to an overfitting issue. In order to improve the performance and generalization ability of the deep learning automatic ICD coding model, we proposed a simple and effective curriculum batching strategy in this paper for improving the MBGD-based training procedure. This strategy generates three batch sets offline through applying three predefined sampling algorithms. These batch sets satisfy a uniform data distribution, a shuffling data distribution and the original training data distribution, respectively, and the learning tasks corresponding to these batch sets range from simple to complex. Experiments show that, after replacing the original shuffling algorithm-based batching strategy with the proposed curriculum batching strategy, the performance of the three investigated deep multi-label classification models for automatic ICD coding all have dramatic improvements. At the same time, the models avoid the overfitting issue and all show better ability to learn the long-tailed label information. The performance is also better than a SOTA label set reconstruction model.

Colonial history and global economics distort our understanding of deep-time biodiversity.

Sampling biases in the fossil record distort estimates of past biodiversity. However, these biases not only reflect the geological and spatial aspects of the fossil record, but also the historical and current collation of fossil data. We demonstrate how the legacy of colonialism and socioeconomic factors, such as wealth, education and political stability, impact the global distribution of fossil data over the past 30 years. We find that a global power imbalance persists in palaeontology, with researchers in high- or upper-middle-income countries holding a monopoly over palaeontological knowledge production by contributing to 97% of fossil data. As a result, some countries or regions tend to be better sampled than others, ultimately leading to heterogeneous spatial sampling across the globe. This illustrates how efforts to mitigate sampling biases to obtain a truly representative view of past biodiversity are not disconnected from the aim of diversifying and decolonizing our discipline.

Fast-Convergent Federated Learning With Adaptive Weighting

Federated learning (FL) enables resource-constrained edge nodes to collaboratively learn a global model under the orchestration of a central server while keeping privacy-sensitive data locally. The non-independent-and-identically-distributed (non-IID) data samples across participating nodes slow model training and impose additional communication rounds for FL to converge. In this paper, we propose <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Fed</monospace> erated <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Ad</monospace> a <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</monospace> tive Weighting ( <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">FedAdp</monospace> ) algorithm that aims to accelerate model convergence under the presence of nodes with non-IID dataset. We observe the implicit connection between the node contribution to the global model aggregation and data distribution on the local node through theoretical and empirical analysis. We then propose to assign different weights for updating the global model based on node contribution adaptively through each training round. The contribution of participating nodes is first measured by the angle between the local gradient vector and the global gradient vector, and then, weight is quantified by a designed non-linear mapping function subsequently. The simple yet effective strategy can reinforce positive (suppress negative) node contribution dynamically, resulting in communication round reduction drastically. Its superiority over the commonly adopted Federated Averaging ( <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">FedAvg</monospace> ) is verified both theoretically and experimentally. With extensive experiments performed in Pytorch and PySyft, we show that FL training with <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">FedAdp</monospace> can reduce the number of communication rounds by up to 54.1% on MNIST dataset and up to 45.4% on FashionMNIST dataset, as compared to <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">FedAvg</monospace> algorithm.