Arrow Research search

Author name cluster

Jing Wu

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

18 papers
2 author rows

Possible papers

18

AAAI Conference 2026 Conference Paper

DIET: Machine Unlearning on a Data-Diet

  • Nilakshan Kunananthaseelan
  • Jing Wu
  • Trung Le
  • Gholamreza Haffari
  • Mehrtash Harandi

Machine Unlearning (MU) aims to remove the influence of specific knowledge from a pretrained model. Existing methods often rely on retained training data to preserve utility; such dependence is impractical due to privacy and scalability constraints. A further complication arises when unlearning is applied to vision-language models (VLMs), where entangled multimodal representations make targeted forgetting especially challenging. We propose DIET, a principled retain-data-free unlearning method for VLMs that addresses these challenges by leveraging the geometry of hyperbolic space. The core idea is to push forget embeddings toward class-mismatched prototypes located at the boundary of the hyperbolic space. In hyperbolic geometry, points near the boundary become infinitely distant from interior points. As a result, moving forget embeddings to the boundary makes their influence on the model asymptotically negligible. To formalize this, we guide the forgetting process using the Busemann function, which quantifies directional distance to the boundary. We further develop an adaptive scheme based on optimal transport that selects mismatched prototypes for each forget embedding, enabling flexible unlearning dynamics. Extensive experiments on fine-grained datasets such as Flowers102, OxfordPets, and StanfordCars show that DIET achieves an average forget accuracy of 8.06%, while preserving 69.04% utility using only 16 samples per concept, significantly outperforming the best retain-free baselines with a 117.5% improvement in model utility, and showing competitive performance to retain-data baselines with only a 3.79% drop

EAAI Journal 2026 Journal Article

Explainable stacking-based hybrid machine learning for predicting uni-axial creep deformation in concrete

  • Mahamadou Djibo Zakari
  • Jing Wu
  • Luqi Xie
  • Abdoul Razak Abdou Harouna

To address the complexity of modeling concrete creep behavior and the limitations of traditional models, this study proposes a data-driven hybrid machine learning model for accurate prediction of creep deformation. The Northwestern University creep database is preprocessed to identify the most influential factors, and a stacking-based hybrid model is developed by combining five ensemble tree-based algorithms with an artificial neural network. Bayesian optimization, implemented via the Hyperopt library, is employed for hyperparameter tuning, ensuring optimal model performance. A 10-fold cross-validation is conducted to demonstrate the model's strong generalization capability. The hybrid model outperforms standalone base estimators, achieving a coefficient of determination (R2) of 0. 960 on the testing set. SHapley Additive exPlanations are used to interpret the model's predictions globally and locally, revealing factor importance consistent with experimental findings. A comparison with three widely used traditional models, the Comité Européen du Béton (CEB) Model Code 90–99, Fédération Internationale du Béton (fib) Model Code 2010, and the B4 model on selected testing subsets demonstrates the superiority of the proposed model across six evaluation metrics. The prediction of various creep strains closely aligns with experimentally measured values, further validating the model's accuracy and effectiveness in predicting different types of creep deformations.

EAAI Journal 2026 Journal Article

Secure and energy-efficient unmanned aerial vehicle-enabled visible light communication via a multi-objective optimization approach

  • Lingling Liu
  • Aimin Wang
  • Jing Wu
  • Jiao Lu
  • Jiahui Li
  • Geng Sun

This research investigates a unique approach for providing communication service to terrestrial receivers via using unmanned aerial vehicle-enabled visible light communication. Specifically, we consider a scenario involving multiplex transmitters, multiplex receivers, and a single eavesdropper, each of which is equipped with a single photodetector. Then, a unmanned aerial vehicle deployment multi-objective optimization problem is formulated to simultaneously enhance the uniformity of the optical power received by the receivers, minimize the amount of information collected by the eavesdropper, and minimize the energy consumption of unmanned aerial vehicles, by jointly optimizing the locations and transmission power of unmanned aerial vehicles under specific constraints. Due to the complexity and nonlinearity of the formulated unmanned aerial vehicle deployment multi-objective optimization problem, conventional methods are inadequate for solving it efficiently. Therefore, a multi-objective evolutionary algorithm based on decomposition with chaos initiation and crossover mutation is proposed. Simulation outcomes demonstrate that the proposed approach outperforms other approaches, providing significant improvements in both security and energy efficiency for visible light communication systems. In addition, extensive simulations are conducted to verify the convergence, robustness, adaptability, and scalability of the proposed method under various influencing factors, including terrestrial receiver distributions, unmanned aerial vehicle height variations, visible light communication channel uncertainty, unmanned aerial vehicle position dynamics, as well as scenario scale changes. The results show that the proposed method exhibits superior convergence, robustness, adaptability and scalability, and can flexibly adapt to the dynamic changes of channels and unmanned aerial vehicle positions. Moreover, it ensures coverage fairness, system security and energy efficiency of unmanned aerial vehicles, which further makes it well-suited for practical unmanned aerial vehicle-enabled visible light communication systems operating in dynamic and uncertain environments.

JBHI Journal 2026 Journal Article

TEENet: An Effective Clinical Detection Network for Identifying Spontaneous Echo Contrast Automatically

  • Zhiwen Wu
  • Fei Gu
  • Jing Wu
  • Shikun Sun
  • Changsheng Ma

Spontaneous Echo Contrast (SEC) is a swirling smoke-like echo phenomenon in Transesophageal Echocardiography (TEE) videos caused by slow blood flow and hypercoagulable states. It is a significant indicator for assessing thromboembolic risk. However, current SEC identification requires extensive manual intervention, leading to low accuracy, high costs, and subjectivity. To address these issues, we propose TEENet, an effective clinical detection network for identifying SEC in TEE videos. Specifically, TEENet first generates attention maps for the input clips to highlight important regions and integrates Convolutional Neural Network with the Multi-Head Self-Attention to capture spatiotemporal representations. Furthermore, to enhance the classification performance across different SEC severity grades, we introduce an auxiliary classification module, which simultaneously utilizes the main classification head and auxiliary classification heads. Notably, we constructed a comprehensive dataset of 1106 TEE videos collected during clinical examinations performed at the First Affiliated Hospital of Soochow University from 2018 to 2023, providing a solid foundation for the development and validation of TEENet. Extensive experimental results demonstrate that our proposed network achieves the highest SEC identification accuracy of 92. 4 $\pm$ 1. 3% compared to other spatiotemporal representation networks such as SlowFastR50 (89. 6 $\pm$ 0. 7%) and TimeSformer (74. 9 $\pm$ 1. 8%), which shows strong potential for effective auxiliary diagnosis in clinical practice.

JBHI Journal 2025 Journal Article

FoodCoach: Fully Automated Diet Counseling

  • Jing Wu
  • Simon Mayer
  • Simeon Pilz
  • Yasmine S. Antille
  • Jan L. Albert
  • Melanie Stoll
  • Kimberly Garcia
  • Klaus Fuchs

Unhealthy dietary habits are a major preventable risk factor for widespread non-communicable diseases (NCDs). Diet counseling is effective in managing diet-related NCDs, but constrained by its manual nature and limited (clinical) resources. To address these challenges, we propose FoodCoach, a fully automated diet counseling system that monitors people's food purchases using digital receipts from loyalty cards and provides structured dietary recommendations. We introduce the FoodCoach system's dietary recommender algorithm and architecture, alongside evaluation results from a two-arm randomized controlled trial involving 61 participants. The trial results demonstrate the technical feasibility and potential for scalable, fully automated diet counseling, despite not showing a significant change in participants' food purchase healthiness. We further show how to deploy and extend the FoodCoach system in new contexts, provide all relevant source code, and discuss how to verify and enhance the system efficacy. Our core research contributions are: 1) a novel dietary recommender algorithm designed and implemented with clinical nutritional experts, and 2) a scalable system architecture that employs a knowledge graph for enhanced interoperability and applicability to diverse domains and data sources. From a practical perspective, FoodCoach can augment clinical diet counseling through novel insights about patient food purchases and continuous support between consultations. Its cost-effective automated recommendations can also benefit the general public by helping combat NCD.

AAAI Conference 2025 Conference Paper

Improving Model Probability Calibration by Integration of Large Data Sources with Biased Labels

  • Renat Sergazinov
  • Richard Chen
  • Cheng Ji
  • Jing Wu
  • Daniel Cociorva
  • Hakan Brunzell

Probability calibration transforms raw output of a classification model into empirically interpretable probability. When the model is purposed to detect rare event and only a small expensive data source has clean labels, it becomes extraordinarily challenging to obtain accurate probability calibration. Utilizing an additional large cheap data source is very helpful, however, such data sources oftentimes suffer from biased labels. To this end, we introduce an approximate expectation-maximization (EM) algorithm to extract useful information from the large data sources. For a family of calibration methods based on the logistic likelihood, we derive closed-form updates and call the resulting iterative algorithm CalEM. We show that CalEM inherits convergence guarantees from the approximate EM algorithm. We test the proposed model in simulation and on the real marketing datasets, where it shows significant performance increases.

YNICL Journal 2025 Journal Article

State-specific GluCEST alterations in insular subregions are associated with depression and plasma inflammatory biomarker levels in patients with inflammatory bowel disease

  • Lixue Xu
  • Jun Lu
  • Minsi Zhou
  • Haiyun Shi
  • Jing Zheng
  • Tianxin Cheng
  • Hui Xu
  • Dawei Yang

BACKGROUND: Depression commonly co-occurs with inflammatory bowel disease (IBD). Abnormal glutamate levels in the insula and altered plasma inflammatory biomarkers are observed in IBD and depression. However, the changes in glutamate concentrations in insular subregions in IBD and their relationship with depression and inflammatory markers remain unclear. This study aimed to investigate differences in glutamate concentrations in insular subregions between IBD patients and healthy controls (HCs) and their correlation with depression scores and inflammatory markers. METHODS: Forty-two IBD patients (19 active, IBD-A; 23 in remission, IBD-R) and 46 HCs underwent glutamate chemical exchange saturation transfer (GluCEST) magnetic resonance imaging. Blood samples from 37 IBD patients were collected for plasma inflammatory biomarker analysis. GluCEST indices in insular subregions were measured. The Hospital Anxiety and Depression Scale (HADS-D) was used to estimate depression symptoms. Whole-brain voxel-based analysis using one-way ANOVA explored between-group differences in GluCEST indices within the insula. FDR-corrected partial correlation analysis evaluated the relationships between GluCEST, depression symptoms, and inflammatory factors. RESULTS: GluCEST indices decreased in IBD patients in the left dorsal dysgranular subregion of the insula (dId) (uncorrected p < 0.001, cluster-level FWE-corrected p < 0.05). GluCEST indices in the left dId showed a significant positive correlation with HADS-D in IBD-R (FDR corrected q < 0.05). Additionally, GluCEST indices in the left dId were negatively correlated with CXCL9 (FDR corrected q < 0.05). CONCLUSION: State-specific GluCEST alterations in the left dId are a cerebral metabolic feature of IBD. These changes are associated with depression and inflammatory biomarkers, suggesting that the brain-immune-gut axis might underlie depression in IBD patients.

AAAI Conference 2024 Conference Paper

Concealing Sensitive Samples against Gradient Leakage in Federated Learning

  • Jing Wu
  • Munawar Hayat
  • Mingyi Zhou
  • Mehrtash Harandi

Federated Learning (FL) is a distributed learning paradigm that enhances users' privacy by eliminating the need for clients to share raw, private data with the server. Despite the success, recent studies expose the vulnerability of FL to model inversion attacks, where adversaries reconstruct users’ private data via eavesdropping on the shared gradient information. We hypothesize that a key factor in the success of such attacks is the low entanglement among gradients per data within the batch during stochastic optimization. This creates a vulnerability that an adversary can exploit to reconstruct the sensitive data. Building upon this insight, we present a simple, yet effective defense strategy that obfuscates the gradients of the sensitive data with concealed samples. To achieve this, we propose synthesizing concealed samples to mimic the sensitive data at the gradient level while ensuring their visual dissimilarity from the actual sensitive data. Compared to the previous art, our empirical evaluations suggest that the proposed technique provides the strongest protection while simultaneously maintaining the FL performance. Code is located at https://github.com/JingWu321/DCS-2.

ICRA Conference 2024 Conference Paper

DerainNeRF: 3D Scene Estimation with Adhesive Waterdrop Removal

  • Yunhao Li
  • Jing Wu
  • Lingzhe Zhao
  • Peidong Liu 0001

When capturing images through the glass during rainy or snowy weather conditions, the resulting images often contain waterdrops adhered on the glass surface, and these waterdrops significantly degrade the image quality and performance of many computer vision algorithms. To tackle these limitations, we propose a method to reconstruct the clear 3D scene implicitly from multi-view images degraded by water-drops. Our method exploits an attention network to predict the location of waterdrops and then train a Neural Radiance Fields to recover the 3D scene implicitly. By leveraging the strong scene representation capabilities of NeRF, our method can render high-quality novel-view images with waterdrops removed. Extensive experimental results on both synthetic and real datasets show that our method is able to generate clear 3D scenes and outperforms existing state-of-the-art (SOTA) image adhesive waterdrop removal methods.

NeurIPS Conference 2024 Conference Paper

Enhancing vision-language models for medical imaging: bridging the 3D gap with innovative slice selection

  • Yuli Wang
  • Jian Peng
  • Yuwei Dai
  • Craig Jones
  • Haris Sair
  • Jinglai Shen
  • Nicolas Loizou
  • Jing Wu

Recent approaches to vision-language tasks are built on the remarkable capabilities of large vision-language models (VLMs). These models excel in zero-shot and few-shot learning, enabling them to learn new tasks without parameter updates. However, their primary challenge lies in their design, which primarily accommodates 2D input, thus limiting their effectiveness for medical images, particularly radiological images like MRI and CT, which are typically 3D. To bridge the gap between state-of-the-art 2D VLMs and 3D medical image data, we developed an innovative, one-pass, unsupervised representative slice selection method called Vote-MI, which selects representative 2D slices from 3D medical imaging. To evaluate the effectiveness of vote-MI when implemented with VLMs, we introduce BrainMD, a robust, multimodal dataset comprising 2, 453 annotated 3D MRI brain scans with corresponding textual radiology reports and electronic health records. Based on BrainMD, we further develop two benchmarks, BrainMD-select (including the most representative 2D slice of 3D image) and BrainBench (including various vision-language downstream tasks). Extensive experiments on the BrainMD dataset and its two corresponding benchmarks demonstrate that our representative selection method significantly improves performance in zero-shot and few-shot learning tasks. On average, Vote-MI achieves a 14. 6\% and 16. 6\% absolute gain for zero-shot and few-shot learning, respectively, compared to randomly selecting examples. Our studies represent a significant step toward integrating AI in medical imaging to enhance patient care and facilitate medical research. We hope this work will serve as a foundation for data selection as vision-language models are increasingly applied to new tasks.

EAAI Journal 2024 Journal Article

Improved differential evolution algorithm based on cooperative multi-population

  • Yangyang Shen
  • Jing Wu
  • Minfu Ma
  • Xiaofeng Du
  • Hao Wu
  • Xianlong Fei
  • Datian Niu

This paper introduces an improved differential evolution algorithm based on cooperative multi-population (CMp-DE for short), which combines diverse population collaboration mechanisms and catalytic factors into an improved differential evolution framework. By harnessing various population collaboration mechanisms, the algorithm enhances the diversity of individuals within populations during initial iterations and reduces it during later iterations, thereby harmonizing the algorithm's exploratory and exploitative capabilities. Furthermore, a novel mutation operator is proposed that divides the iterative process into exploration and exploitation phases, thereby augmenting the algorithm's global exploration prowess. Lastly, a catalytic operator is introduced to generate new individuals near post-crossover individuals based on a specified rule, which enhances the algorithm's ability to escape local optima and increasing stability. The proposed CMp-DE is benchmarked against the CEC2017 benchmark test functions and compared against 13 algorithms, including five differential evolution algorithms and their variants, as well as eight state-of-the-art metaheuristic optimization algorithms. This evaluation assesses the CMp-DE's solution accuracy, convergence, stability, and scalability. Finally, the applicability of CMp-DE is validated by addressing six practical optimization problems. The experimental results show that CMp-DE surpasses other algorithms in terms of both convergence accuracy and robustness. Moreover, integrating a catalytic operator with other optimization algorithms notably boosts performance in convergence accuracy and stability. The inclusion of the catalytic operator has significantly enhanced the performance of algorithms compared to their performance before its addition. This underscores the potential of the catalytic operator in improving the performance of various algorithms, particularly in terms of convergence accuracy and robustness.

AAAI Conference 2024 Conference Paper

SwitchTab: Switched Autoencoders Are Effective Tabular Learners

  • Jing Wu
  • Suiyao Chen
  • Qi Zhao
  • Renat Sergazinov
  • Chen Li
  • Shengjie Liu
  • Chongchao Zhao
  • Tianpei Xie

Self-supervised representation learning methods have achieved significant success in computer vision and natural language processing (NLP), where data samples exhibit explicit spatial or semantic dependencies. However, applying these methods to tabular data is challenging due to the less pronounced dependencies among data samples. In this paper, we address this limitation by introducing SwitchTab, a novel self-supervised method specifically designed to capture latent dependencies in tabular data. SwitchTab leverages an asymmetric encoder-decoder framework to decouple mutual and salient features among data pairs, resulting in more representative embeddings. These embeddings, in turn, contribute to better decision boundaries and lead to improved results in downstream tasks. To validate the effectiveness of SwitchTab, we conduct extensive experiments across various domains involving tabular data. The results showcase superior performance in end-to-end prediction tasks with fine-tuning. Moreover, we demonstrate that pre-trained salient embeddings can be utilized as plug-and-play features to enhance the performance of various traditional classification methods (e.g., Logistic Regression, XGBoost, etc.). Lastly, we highlight the capability of SwitchTab to create explainable representations through visualization of decoupled mutual and salient features in the latent space.

NeurIPS Conference 2023 Conference Paper

Balanced Training for Sparse GANs

  • Yite Wang
  • Jing Wu
  • Naira Hovakimyan
  • Ruoyu Sun

Over the past few years, there has been growing interest in developing larger and deeper neural networks, including deep generative models like generative adversarial networks (GANs). However, GANs typically come with high computational complexity, leading researchers to explore methods for reducing the training and inference costs. One such approach gaining popularity in supervised learning is dynamic sparse training (DST), which maintains good performance while enjoying excellent training efficiency. Despite its potential benefits, applying DST to GANs presents challenges due to the adversarial nature of the training process. In this paper, we propose a novel metric called the balance ratio (BR) to study the balance between the sparse generator and discriminator. We also introduce a new method called balanced dynamic sparse training (ADAPT), which seeks to control the BR during GAN training to achieve a good trade-off between performance and computational cost. Our proposed method shows promising results on multiple datasets, demonstrating its effectiveness.

TMLR Journal 2023 Journal Article

Extended Agriculture-Vision: An Extension of a Large Aerial Image Dataset for Agricultural Pattern Analysis

  • Jing Wu
  • David Pichler
  • Daniel Marley
  • Naira Hovakimyan
  • David A Wilson
  • Jennifer Hobbs

A key challenge for much of the machine learning work on remote sensing and earth observation data is the difficulty in acquiring large amounts of accurately labeled data. This is particularly true for semantic segmentation tasks, which are much less common in the remote sensing domain because of the incredible difficulty in collecting precise, accurate, pixel-level annotations at scale. Recent efforts have addressed these challenges both through the creation of supervised datasets as well as the application of self-supervised methods. We continue these efforts on both fronts. First, we generate and release an improved version of the Agriculture-Vision dataset (Chiu et al., 2020b) to include raw, full-field imagery for greater experimental flexibility. Second, we extend this dataset with the release of 3600 large, high-resolution (10cm/pixel), full-field, red-green-blue and near-infrared images for pre-training. Third, we incorporate the Pixel-to-Propagation Module Xie et al. (2021b) originally built on the SimCLR framework into the framework of MoCo-V2 Chen et al.(2020b). Finally, we demonstrate the usefulness of this data by benchmarking different contrastive learning approaches on both downstream classification and semantic segmentation tasks. We explore both CNN and Swin Transformer Liu et al. (2021a) architectures within different frameworks based on MoCo-V2. Together, these approaches enable us to better detect key agricultural patterns of interest across a field from aerial imagery so that farmers may be alerted to problematic areas in a timely fashion to inform their management decisions. Furthermore, the release of these datasets will support numerous avenues of research for computer vision in remote sensing for agriculture.

IJCAI Conference 2023 Conference Paper

Optimizing Crop Management with Reinforcement Learning and Imitation Learning

  • Ran Tao
  • Pan Zhao
  • Jing Wu
  • Nicolas Martin
  • Matthew T. Harrison
  • Carla Ferreira
  • Zahra Kalantari
  • Naira Hovakimyan

Crop management has a significant impact on crop yield, economic profit, and the environment. Although management guidelines exist, finding the optimal management practices is challenging. Previous work used reinforcement learning (RL) and crop simulators to solve the problem, but the trained policies either have limited performance or are not deployable in the real world. In this paper, we present an intelligent crop management system that optimizes nitrogen fertilization and irrigation simultaneously via RL, imitation learning (IL), and crop simulations using the Decision Support System for Agrotechnology Transfer (DSSAT). We first use deep RL, in particular, deep Q-network, to train management policies that require a large number of state variables from the simulator as observations (denoted as full observation). We then invoke IL to train management policies that only need a few state variables that can be easily obtained or measured in the real world (denoted as partial observation) by mimicking the actions of the RL policies trained under full observation. Simulation experiments using the maize crop in Florida (US) and Zaragoza (Spain) demonstrate that the trained policies from both RL and IL techniques achieved more than 45\% improvement in economic profit while causing less environmental impact compared with a baseline method. Most importantly, the IL-trained management policies are directly deployable in the real world as they use readily available information.

AAMAS Conference 2023 Conference Paper

Optimizing Crop Management with Reinforcement Learning and Imitation Learning

  • Ran Tao
  • Pan Zhao
  • Jing Wu
  • Nicolas F. Martin
  • Matthew T. Harrison
  • Carla Ferreira
  • Zahra Kalantari
  • Naira Hovakimyan

To increase crop yield while minimizing environmental impact, we present an intelligent crop management system that optimizes nitrogen fertilization and irrigation simultaneously via reinforcement learning (RL), imitation learning (IL), and crop simulations using DSSAT. We first use deep RL to train management policies that require a large number of state variables from the simulator as observations (denoted as full observation). We then invoke IL to train management policies that only need a limited number of variables that are measurable in the real world (denoted as partial observation) by mimicking the actions of the RL-trained policies under full observation. Simulation experiments using maize in Florida demonstrate that our trained policies under both full and partial observations achieve better outcomes than a baseline policy. Most importantly, the IL-trained management policies are directly deployable in the real world as they use readily available information.

IJCAI Conference 2021 Conference Paper

A Survey on Universal Adversarial Attack

  • Chaoning Zhang
  • Philipp Benz
  • Chenguo Lin
  • Adil Karjauv
  • Jing Wu
  • In So Kweon

The intriguing phenomenon of adversarial examples has attracted significant attention in machine learning and what might be more surprising to the community is the existence of universal adversarial perturbations (UAPs), i. e. a single perturbation to fool the target DNN for most images. With the focus on UAP against deep classifiers, this survey summarizes the recent progress on universal adversarial attacks, discussing the challenges from both the attack and defense sides, as well as the reason for the existence of UAP. We aim to extend this work as a dynamic survey that will regularly update its content to follow new works regarding UAP or universal attack in a wide range of domains, such as image, audio, video, text, etc. Relevant updates will be discussed at: https: //bit. ly/2SbQlLG. We welcome authors of future works in this field to contact us for including your new findings.