Source Datasets Research Articles

NeRF-VPT: Learning Novel View Representations with Neural Radiance Fields via View Prompt Tuning

Neural Radiance Fields (NeRF) have garnered remarkable success in novel view synthesis. Nonetheless, the task of generating high-quality images for novel views persists as a critical challenge. While the existing efforts have exhibited commendable progress, capturing intricate details, enhancing textures, and achieving superior Peak Signal-to-Noise Ratio (PSNR) metrics warrant further focused attention and advancement. In this work, we propose NeRF-VPT, an innovative method for novel view synthesis to address these challenges. Our proposed NeRF-VPT employs a cascading view prompt tuning paradigm, wherein RGB information gained from preceding rendering outcomes serves as instructive visual prompts for subsequent rendering stages, with the aspiration that the prior knowledge embedded in the prompts can facilitate the gradual enhancement of rendered image quality. NeRF-VPT only requires sampling RGB data from previous stage renderings as priors at each training stage, without relying on extra guidance or complex techniques. Thus, our NeRF-VPT is plug-and-play and can be readily integrated into existing methods. By conducting comparative analyses of our NeRF-VPT against several NeRF-based approaches on demanding real-scene benchmarks, such as Realistic Synthetic 360, Real Forward-Facing, Replica dataset, and a user-captured dataset, we substantiate that our NeRF-VPT significantly elevates baseline performance and proficiently generates more high-quality novel view images than all the compared state-of-the-art methods. Furthermore, the cascading learning of NeRF-VPT introduces adaptability to scenarios with sparse inputs, resulting in a significant enhancement of accuracy for sparse-view novel view synthesis. The source code and dataset are available at https://github.com/Freedomcls/NeRF-VPT.

Improving Transferability for Cross-Domain Trajectory Prediction via Neural Stochastic Differential Equation

Multi-agent trajectory prediction is crucial for various practical applications, spurring the construction of many large-scale trajectory datasets, including vehicles and pedestrians. However, discrepancies exist among datasets due to external factors and data acquisition strategies. External factors include geographical differences and driving styles, while data acquisition strategies include data acquisition rate, history/prediction length, and detector/tracker error. Consequently, the proficient performance of models trained on large-scale datasets has limited transferability on other small-size datasets, bounding the utilization of existing large-scale datasets. To address this limitation, we propose a method based on continuous and stochastic representations of Neural Stochastic Differential Equations (NSDE) for alleviating discrepancies due to data acquisition strategy. We utilize the benefits of continuous representation for handling arbitrary time steps and the use of stochastic representation for handling detector/tracker errors. Additionally, we propose a dataset-specific diffusion network and its training framework to handle dataset-specific detection/tracking errors. The effectiveness of our method is validated against state-of-the-art trajectory prediction models on the popular benchmark datasets: nuScenes, Argoverse, Lyft, INTERACTION, and Waymo Open Motion Dataset (WOMD). Improvement in performance gain on various source and target dataset configurations shows the generalized competence of our approach in addressing cross-dataset discrepancies.

Domain Generalizable Person Search Using Unreal Dataset

Collecting and labeling real datasets to train the person search networks not only requires a lot of time and effort, but also accompanies privacy issues. The weakly-supervised and unsupervised domain adaptation methods have been proposed to alleviate the labeling burden for target datasets, however, their generalization capability is limited. We introduce a novel person search method based on the domain generalization framework, that uses an automatically labeled unreal dataset only for training but is applicable to arbitrary unseen real datasets. To alleviate the domain gaps when transferring the knowledge from the unreal source dataset to the real target datasets, we estimate the fidelity of person instances which is then used to train the end-to-end network adaptively. Moreover, we devise a domain-invariant feature learning scheme to encourage the network to suppress the domain-related features. Experimental results demonstrate that the proposed method provides the competitive performance to existing person search methods even though it is applicable to arbitrary unseen datasets without any prior knowledge and re-training burdens.

An efficient targeted design for real-time defect detection of surface defects

In practical industrial applications, the inference speed of deep learning models directly affects the efficiency of industrial production. Therefore, the lightweight real-time detection method of surface defects is an essential task in the industrial process. We need to achieve a favorable balance between efficiency and accuracy since the rising demand for production efficiency. However, most of the existing pixel-level detection methods 1) often adopt huge computational overhead to learn rich features, resulting in slow inference speed and 2) show a performance degradation when applied to different industrial surface defect scenarios. To this end, we propose an efficient targeted design (ETD) for real-time defect detection of surface defects. It consists of two branches: (i) an efficient feature enhancement branch, with global aggregation module (GAM) and cross-scale guide module (CGM) to gradually enhance defect features, and (ii) an edge posterior branch, with verification module (VM) and scale interaction module (SIM) to implicitly guide the boundary details of defects. Specifically, while inheriting this framework, we reconsider the relationship between precision, parameters, and speed so that our model can be applied to different industrial scenarios. Extensive experimental results on four datasets indicate that ETD outperforms other leading saliency detection methods. Meanwhile, our method ETD-S achieves 347 FPS on ESDIs-SOD dataset, 254 FPS on Crack500 dataset, 227 FPS on NRSD-MN dataset and 273 FPS on DAGM dataset. Additionally, we conduct real-time analysis of ETD on an intelligent paradigm for industrial surface defect detection, further demonstrating its efficacy in practical scenarios. ETD demonstrates effective detection performance while achieving a lightweight architecture, which can be implemented using various deep learning frameworks, showcasing substantial potential for real-time surface defect detection. The source code and dataset are publicly available at https://github.com/VDT-2048/ETD.

Investigating the Impact of Wildfires on Lake Water Quality Using Earth Observation Satellites

A study was carried out to investigate the effects of wildfires on lake water quality using a source dataset of 2024 lakes worldwide, covering different lake types and ecological settings. Satellite-derived datasets (Lakes_cci and Fire_cci) were used and a Source Pathway Receptor approach applied which was conceptually represented by fires (burned area) as a source, precipitation/drought representing transport dynamics, and lakes as the ultimate receptor. This identified 106 lakes worldwide that are likely prone to be impacted by wildfires via a terrestrial pathway. Satellite-derived chlorophyll-a (Chl-a) and turbidity variables were used as indicators to detect changes in lake water quality potentially induced by wildfires over a four-year period. The lakes with the largest catchment areas burned and characterized by regular annual fires were located in Africa. Evidence for a strong influence of wildfires was not found across the dataset examined, although clearer responses were seen for some individual lakes. However, among the hydro-morphological characteristics examined, lake depth was found to be significant in determining Chl-a concentration peaks which were higher in shallow and lower in deep lakes. Lake turbidity responses indicated a dependence on lake catchment and weather conditions. While wildfires are likely to contribute to the nutrient load of lakes as found in previous studies, it is possible that in many cases it is not a dominant pressure and that its manifestation as a signal in lake Chl-a or turbidity values depends to a large part on lake typology and catchment characteristics. Assessment of lake water quality changes six months after a fire showed that Chl-a concentrations either increased, decreased, or showed no changes in a similar number of lakes, indicating that a lake specific ecological and hydro-morphological context is important for understanding lake responses to wildfires.

Landmark-based k-factorization multi-view subspace clustering

Multi-view subspace clustering (MSC) has gained significant popularity due to its ability to overcome noise and bias present in single views by fusing information from multiple views. MSC enhances the accuracy and robustness of clustering. However, many existing MSC methods suffer from high computational costs and sub-optimal performance on large-scale datasets, since they often construct a fused graph directly from high-dimensional data and then apply spectral clustering. To address these challenges, we propose a framework called Landmark-based k-Factorization Multi-view Subspace Clustering (LKMSC). Our framework tackles these issues by generating a small number of landmarks p≪n for each view, which form a landmark graph. We represent each entire view as a linear combination of these landmarks, where n is the number of data points. To address inconsistencies that naturally occur in landmark graphs due to multiple views, we utilize Landmark Graphs Alignment. This technique incorporates both feature and structural information to capture the correspondence between landmarks. The aligned graphs are then factorized into consensus k groups, emphasizing structural sparsity. LKMSC efficiently extracts features and reduces dimensionality of the input dataset. It eliminates the need for learning large-scale affinity matrix and feature decomposition. Our approach exhibits linear computational complexity and has demonstrated promising results in numerous experimental evaluations across a range of datasets. The source codes and datasets are available at https://github.com/FY0109/LKMSC.

Graph Confident Learning for Software Vulnerability Detection

Code vulnerability exposes millions of software to the possibility of being attacked, as evidence every year on increasing reports of security issues, such as information leaks, system compromise, and denial of service. Despite with many vulnerability detection models proposed so far, their effectiveness is still limited due to the ignorance of syntactic structural information analysis in source code and the improper handling of labeling errors. To address these issues, we propose the Graph Confident Learning for Software Vulnerability Detection (GCL4SVD) model, a machine learning model to detect software vulnerability in the development phase. It comprises two components: code graph embedding and graph confident learning denoising. To address the syntactic structural information analysis limitation, the code graph embedding component extracts the structure and semantic information of source code with a sliding window mechanism, and then encodes source code into a graph structure to capture the patterns and characteristics of code vulnerabilities. Additionally, the graph confident learning denoising component identifies labeling errors to improve the quality of training set. Experimental results show that GCL4SVD outperforms the state-of-the-art vulnerability detection models on four open source datasets by 3.7%, 3.3%, 2.5%, 0.8% in terms of Accuracy, respectively, and by 10.2%, 21.8%, 8.2%, 11.2% in terms of F1-score.

GraphormerDTI: A graph transformer-based approach for drug-target interaction prediction

The application of Artificial Intelligence (AI) to screen drug molecules with potential therapeutic effects has revolutionized the drug discovery process, with significantly lower economic cost and time consumption than the traditional drug discovery pipeline. With the great power of AI, it is possible to rapidly search the vast chemical space for potential drug-target interactions (DTIs) between candidate drug molecules and disease protein targets. However, only a small proportion of molecules have labelled DTIs, consequently limiting the performance of AI-based drug screening. To solve this problem, a machine learning-based approach with great ability to generalize DTI prediction across molecules is desirable. Many existing machine learning approaches for DTI identification failed to exploit the full information with respect to the topological structures of candidate molecules. To develop a better approach for DTI prediction, we propose GraphormerDTI, which employs the powerful Graph Transformer neural network to model molecular structures. GraphormerDTI embeds molecular graphs into vector-format representations through iterative Transformer-based message passing, which encodes molecules' structural characteristics by node centrality encoding, node spatial encoding and edge encoding. With a strong structural inductive bias, the proposed GraphormerDTI approach can effectively infer informative representations for out-of-sample molecules and as such, it is capable of predicting DTIs across molecules with an exceptional performance. GraphormerDTI integrates the Graph Transformer neural network with a 1-dimensional Convolutional Neural Network (1D-CNN) to extract the drugs' and target proteins' representations and leverages an attention mechanism to model the interactions between them. To examine GraphormerDTI's performance for DTI prediction, we conduct experiments on three benchmark datasets, where GraphormerDTI achieves a superior performance than five state-of-the-art baselines for out-of-molecule DTI prediction, including GNN-CPI, GNN-PT, DeepEmbedding-DTI, MolTrans and HyperAttentionDTI, and is on a par with the best baseline for transductive DTI prediction. The source codes and datasets are publicly accessible at https://github.com/mengmeng34/GraphormerDTI.

Adversarial Transferability in Embedded Sensor Systems: An Activity Recognition Perspective

Machine learning algorithms are increasingly used for inference and decision-making in embedded systems. Data from sensors are used to train machine learning models for various smart functions of embedded and cyber-physical systems ranging from applications in healthcare, autonomous vehicles, and national security. However, recent studies have shown that machine learning models can be fooled by adding adversarial noise to their inputs. The perturbed inputs are called adversarial examples. Furthermore, adversarial examples designed to fool one machine learning system are also often effective against another system. This property of adversarial examples is called adversarial transferability and has not been explored in wearable systems to date. In this work, we take the first stride in studying adversarial transferability in wearable sensor systems from four viewpoints: (1) transferability between machine learning models; (2) transferability across users/subjects of the embedded system; (3) transferability across sensor body locations; and (4) transferability across datasets used for model training. We present a set of carefully designed experiments to investigate these transferability scenarios. We also propose a threat model describing the interactions of an adversary with the source and target sensor systems in different transferability settings. In most cases, we found high untargeted transferability, whereas targeted transferability success scores varied from 0% to 80%. The transferability of adversarial examples depends on many factors such as the inclusion of data from all subjects, sensor body position, number of samples in the dataset, type of learning algorithm, and the distribution of source and target system dataset. The transferability of adversarial examples decreased sharply when the data distribution of the source and target system became more distinct. We also provide guidelines and suggestions for the community for designing robust sensor systems. Code and dataset used in our analysis is publicly available here. 1

Measuring The Spatio-Temporal Distribution of Sulfur Dioxide (SO2) with Copernicus Sentinel-5P Near Real Time in Medan City

This study aims to monitor the impact of sulfur dioxide (SO2), a significant contributor to atmospheric corrosion and associated with air pollution, in urban and industrial areas through empirical models of spatial distribution and temporal estimation in Medan. Datasets of Sentinel 5P NRTI are worth using to monitor the formation of sulfate aerosols or SO2 emissions from natural sources and anthropogenic origin in near real-time from 2019 until 2023 on the local scale, Medan. The source dataset covers 1,11 km of spatial image resolution on orbital in daily revisit time with a spectral bound between the ultraviolet and the shortwave infrared. The measurement of atmospheric SO2 concentrations is generated by enumerating the SO2 vertical column density technique at the soil surface with the cloud-based platform The Earth Engine (EE) Code Editor to handle large data sizes and produce interactive mapping. Based on the availability of auxiliary results, the number of spreading SO2 concentrations fell from 0,92 mmol/m2 in 2019 to 0,41 mmol/m2 in 2023, a reduction of 49.98 percent. The average of SO2 concentrations has decreased substantially over the years. Consequently, these pollutants have recorded long-term health and meteorological parameters impact that substances can rise or reduce acid rain.Keywords: Air pollution, Meteorological parameters, Sentinel 5P NRTI, SO2

Comparison-Transfer Learning Based State-of-Health Estimation for Lithium-Ion Battery

Abstract Rapid and accurate estimation of the state of health of lithium-ion batteries is of great significance. This paper aims to address two issues faced when applying deep learning methods to estimate the health status of lithium-ion batteries: high data quality requirements and poor model generalizability. This paper proposes a comparison-transfer learning approach with cyclic synchronization to estimate the state of health of lithium-ion batteries. First, a cyclic synchronization method based on the Bezier curve fitting algorithm is introduced to synchronize the data obtained at different charge–discharge cycles of the lithium-ion battery, facilitating input to the model. Second, a comparison-transfer network using the Pearson correlation coefficient is proposed to transfer knowledge from the source dataset to predict the target dataset under different environmental temperatures. By training a pre-trained model on the source dataset and utilizing the correlation coefficient to analyze the similarity between the source and target datasets, the accumulated knowledge in the source dataset can be effectively utilized to enhance prediction performance on the target dataset. In the experiments, the proposed method is validated using the lithium-ion battery aging public datasets. The experimental results demonstrate that the proposed approach achieves superior prediction performance in the case of small-sample sizes, exhibiting higher accuracy and stability compared to traditional deep learning methods.

LAP: Liability Antibody Profiler by sequence & structural mapping of natural and therapeutic antibodies.

Antibody-based therapeutics must not undergo chemical modifications that would impair their efficacy or hinder their developability. A commonly used technique to de-risk lead biotherapeutic candidates annotates chemical liability motifs on their sequence. By analyzing sequences from all major sources of data (therapeutics, patents, GenBank, literature, and next-generation sequencing outputs), we find that almost all antibodies contain an average of 3-4 such liability motifs in their paratopes, irrespective of the source dataset. This is in line with the common wisdom that liability motif annotation is over-predictive. Therefore, we have compiled three computational flags to prioritize liability motifs for removal from lead drug candidates: 1. germline, to reflect naturally occurring motifs, 2. therapeutic, reflecting chemical liability motifs found in therapeutic antibodies, and 3. surface, indicative of structural accessibility for chemical modification. We show that these flags annotate approximately 60% of liability motifs as benign, that is, the flagged liabilities have a smaller probability of undergoing degradation as benchmarked on two experimental datasets covering deamidation, isomerization, and oxidation. We combined the liability detection and flags into a tool called Liability Antibody Profiler (LAP), publicly available at lap.naturalantibody.com. We anticipate that LAP will save time and effort in de-risking therapeutic molecules.

Decoupled representation for multi-view learning

Learning multi-view data is a central topic for advanced deep model applications. Existing efforts mainly focus on exploring shared information to maximize the consensus among all the views. However, after reasonably discarding superfluous task-irrelevant noise, the view-specific information is equally essential to downstream tasks. In this paper, we propose to decouple the multi-view representation learning into the shared and specific information extractions with parallel branches, and seamlessly adopt feature fusion in end-to-end models. The common feature is obtained based on the view-agnostic contrastive learning and view-discriminative training to minimize the discrepancy within the views. Simultaneously, the specific feature is learned with orthogonality constraints to minimize the view-level correlation. Besides, the semantic information in the features is reserved with supervised training. After disentangling the representations, we fuse the mutually complementary common and specific features for downstream tasks. Particularly, we provide a theoretical explanation for our method from an information bottleneck perspective. Compared with state-of-the-art multi-view models on benchmark datasets, we empirically demonstrate the advantage of our method in several downstream tasks, such as ordinary classification and few-shot learning. In addition, extensive experiments validate the robustness and transferability of our approach, when applying the learned representation on the source dataset to several target datasets.

The Design and Development of Hands-on Activities for Digital Forensics Education

It has been widely admitted by researchers and educators that hands-on activities are a core component in digital forensics education to help students gain practical skills that are needed in real-world forensic investigations. However, it is not clear in existing works about what kinds of hands-on activities are recommended to be integrated into a digital forensics course and how to design and develop them. In our teaching practice, hands-on activities for a digital forensics course are designed in three categories: 1) activities that assist students in learning how to use common digital forensics tools; 2) activities that help students gain in-depth understanding of the basic concepts and fundamental knowledge that are presented in class lectures; 3) activities that promote students the development of mindsets and data analytical skills that are needed for a digital forensic investigator. Various formats are employed to develop these hands-on exercises in different categories. The educational objectives and student learning outcomes map well to the CAE-CD (Centers of Academic Excellence - Cyber Defense) outcomes by completing their forensic knowledge units. In this paper, we share our idea and experience to design and implement such hands-on assignments in each category for meeting specific educational objectives. Sample exercises are briefly described to explain our idea in each category. Open source tools and data sets are introduced for references. Experiences, lessons, and sample feedback from students are discussed. Our results will provide a point of reference for those who teach digital forensics courses at a college or university, or are developing a digital forensic curriculum.

Multi-scale spatial features and temporal attention mechanisms: advancing the accuracy of ENSO prediction

The exponential progression in oceanic observational technology has fostered the accumulation of substantial time series data pivotal for predictions in ocean meteorology. Foremost among the phenomena observed is El Niño-Southern Oscillation (ENSO), a critical determinant in the interplay of global ocean atmosphere interactions, with its severe manifestations inducing extreme meteorological conditions. Therefore, precisely predicting ENSO events carries immense gravitas. Historically, predictions hinged primarily on dynamic models and statistical approaches; however, the intricate and multifaceted spatiotemporal dynamics of ENSO events have often impeded the accuracy of these traditional methodologies. A notable lacuna in contemporary research is the insufficient exploration of long-term dependencies within oceanic data and the suboptimal integration of spatial information derived from spatiotemporal data. To address these limitations, this study introduces a forward-thinking ENSO prediction framework synergizing multiscale spatial features with temporal attention mechanisms. This innovation facilitates a more profound exploration of temporal and spatial domains, enhancing the retention of extensive-period data while optimizing the use of spatial information. Preliminary analyses executed on the global ocean data assimilation system dataset attest to the superior efficacy of the proposed method, underscoring a substantial improvement over established methods including SA-convolutional long short-term memory, particularly in facilitating long-term predictions.The source code and datasets are provided. The code is available at https://github.com/tse1998/ENSO-prediction.

Integrating data from different taxonomic resolutions to better estimate community alpha diversity

Integrated distribution models (IDMs), in which datasets with different properties are analysed together, are becoming widely used to model species distributions and abundance in space and time. To date, the IDM literature has focused on technical and statistical issues, such as the precision of parameter estimates and mitigation of biases arising from unstructured data sources. However, IDMs have an unrealised potential to estimate ecological properties that could not be properly derived from the source datasets if analysed separately. We present a model that estimates community alpha diversity metrics by integrating one species‐level dataset of presence–absence records with a co‐located dataset of group‐level counts (i.e. lacking information about species identity). We illustrate the ability of community IDMs to capture the true alpha diversity through simulation studies and apply the model to data from the UK Pollinator Monitoring Scheme, to describe spatial variation in the diversity of solitary bees, bumblebees and hoverflies. The simulation and case studies showed that the proposed IDM produced more precise estimates of the community diversity than the single models, and the analysis of the real dataset further showed that the alpha diversity estimates from the IDM were averages of the single models. Our findings also revealed that IDMs had a higher prediction accuracy for all the insect groups in most cases, with this performance linked to the information provided by a data source into the IDM.

Development of a standardized methodology for transfer learning with QSAR models: a purely data-driven approach for source task selection

ABSTRACT Transfer learning is a machine learning technique that works well with chemical endpoints, with several papers confirming its efficiency. Although effective, because the choice of source/assistant tasks is non-trivial, the application of this technique is severely limited by the domain knowledge of the modeller. Considering this limitation, we developed a purely data-driven approach for source task selection that abstracts the need for domain knowledge. To achieve this, we created a supervised learning setting in which transfer outcome (positive/negative) is the variable to be predicted, and a set of six transferability metrics, calculated based on information from target and source datasets, are the features for prediction. We used the ChEMBL database to generate 100,000 transfers using random pairing, and with these transfers, we trained and evaluated our transferability prediction model (TP-Model). Our TP-Model achieved a 135-fold increase in precision while achieving a sensitivity of 92%, demonstrating a clear superiority against random search. In addition, we observed that transfer learning could provide considerable performance increases when applicable, with an average Matthews Correlation Coefficient (MCC) increase of 0.19 when using a single source and an average MCC increase of 0.44 when using multiple sources.

Captionomaly: A Deep Learning Toolbox for Anomaly Captioning in Social Surveillance Systems

Real-time video stream monitoring is gaining huge attention lately with an effort to fully automate this process. On the other hand, reporting can be a tedious task, requiring manual inspection of several hours of daily clippings. Errors are likely to occur because of the repetitive nature of the task causing mental strain on operators. There is a need for an automated system that is capable of real-time video stream monitoring in social systems and reporting them. In this article, we provide a tool aiming to automate the process of anomaly detection and reporting. We combine anomaly detection and video captioning models to create a pipeline for anomaly reporting in descriptive form. A new set of labels by creating descriptive captions for the videos collected from the UCF-Crime (University of Central Florida-Crime) dataset has been formulated. The anomaly detection model is trained on the UCF-Crime, and the captioning model is trained with the newly created labeled set UCF-Crime video description (UCFC-VD). The tool will be used for performing the combined task of anomaly detection and captioning. Automated anomaly captioning would be useful in the efficient reporting of video surveillance data in different social scenarios. Several testing and evaluation techniques were performed. Source code and dataset: https://github.com/Adit31/Captionomaly-Deep-Learning-Toolbox-for-Anomaly-Captioning.

Exploring Dense Retrieval for Dialogue Response Selection

Recent progress in deep learning has continuously improved the accuracy of dialogue response selection. However, in real-world scenarios, the high computation cost forces existing dialogue response selection models to rank only a small number of candidates, recalled by a coarse-grained model, precluding many high-quality candidates. To overcome this problem, we present a novel and efficient response selection model and a set of tailor-designed learning strategies to train it effectively. The proposed model consists of a dense retrieval module and an interaction layer, which could directly select the proper response from a large corpus. We conduct re-rank and full-rank evaluations on widely used benchmarks to evaluate our proposed model. Extensive experimental results demonstrate that our proposed model notably outperforms the state-of-the-art baselines on both re-rank and full-rank evaluations. Moreover, human evaluation results show that the response quality could be improved further by enlarging the candidate pool with nonparallel corpora. In addition, we also release high-quality benchmarks that are carefully annotated for more accurate dialogue response selection evaluation. All source codes, datasets, model parameters, and other related resources have been publicly available. 1

A Survey of Generative Adversarial Networks for Synthesizing Structured Electronic Health Records

Electronic Health Records (EHRs) are a valuable asset to facilitate clinical research and point of care applications; however, many challenges such as data privacy concerns impede its optimal utilization. Deep generative models, particularly Generative Adversarial Networks (GANs), show great promise in generating synthetic EHR data by learning underlying data distributions while achieving excellent performance and addressing these challenges. This work aims to survey the major developments in various applications of GANs for EHRs and provides an overview of the proposed methodologies. For this purpose, we combine perspectives from healthcare applications and machine learning techniques in terms of source datasets and the fidelity and privacy evaluation of the generated synthetic datasets. We also compile a list of the metrics and datasets used by the reviewed works, which can be utilized as benchmarks for future research in the field. We conclude by discussing challenges in GANs for EHRs development and proposing recommended practices. We hope that this work motivates novel research development directions in the intersection of healthcare and machine learning.