Ning Wang

EAAI Journal 2026 Journal Article

An interpretable civil case judgment prediction method based on logical reasoning and knowledge enhancement

• Shibo Cui
• Yu Sun
• Ning Wang
• Wenguang Yan

Civil case judgment prediction attempts to help judicial decision-making by artificial intelligence methods, and its accuracy directly affects judicial efficiency and social fairness perception. Current mainstream methods typically rely heavily on the case’s surface aspects while ignoring the underlying legal reasoning, and they are limited by the black-box model’s lack of interpretability, which is insufficient to cope with multi-class disputes and confusing cases. To address these issues, we propose an interpretable judgment prediction method that combines logical reasoning and knowledge enhancement, performing multi-task prediction in civil cases. First, a self-critique chain of thought reasoning module is created to extract the logical relationships implied by the case facts via the large language model, and discrete prompt alignment is used to improve the logical interpretability of judgment prediction. Second, the knowledge enhancement module is designed to inject external legal knowledge while adaptively filtering noise. Furthermore, a multi-task expert recommendation process is presented to pick the appropriate expert sub-model via a dynamic gating network, thereby enhancing the discrimination capability of multi-category disputes. Experiments with real datasets demonstrate that the method outperforms existing methods in terms of accuracy and interpretability. Experiments on a dataset of confusing cases demonstrate the method’s superior generalization ability in complex scenarios.

AAAI Conference 2026 Conference Paper

FIXME: Towards End-to-End Benchmarking of LLM-Aided Design Verification

• Gwok-Waa Wan
• SamZaak Wong
• Shengchu Su
• Chenxu Niu
• Ning Wang
• Xinlai Wan
• Qixiang Chen
• Mengnv Xing

We introduce FIXME, the first end-to-end and large-scale benchmark for evaluating Large Language Models (LLMs) in hardware design functional verification (FV). Comprising 747 tasks derived from real-world hardware designs, FIXME spans five core FV sub-sets: specification comprehension, reference model generation, testbench generation, assertion design, and RTL debugging. To ensure high data quality, we developed an AI-human collaborative framework for agile data curation and annotation. This process resulted in 25,000 lines of verified RTL, 35,000 lines of enhanced testbenches, and over 1,200 SystemVerilog Assertions. Furthermore, through expert-guided optimization within the multi-agent aided flow, we achieved a remarkable 45.57% improvement in average functional coverage, underscoring the benchmark's robustness. Through evaluation of state-of-the-art LLMs like GPT-4.1, FIXME identifies key limitations and provides actionable insights, advancing the potential of LLM-driven automation in hardware design functional verification.

AAAI Conference 2026 Conference Paper

REAP: Enhancing RAG with Recursive Evaluation and Adaptive Planning for Multi-Hop Question Answering

• Yijie Zhu
• Haojie Zhou
• Wanting Hong
• Tailin Liu
• Ning Wang

Retrieval-augmented generation (RAG) has been extensively employed to mitigate hallucinations in large language models (LLMs). However, existing methods for multi-hop reasoning tasks often lack global planning, increasing the risk of falling into local reasoning impasses. Insufficient exploitation of retrieved content and the neglect of latent clues fail to ensure the accuracy of reasoning outcomes. To overcome these limitations, we propose **R**ecursive **E**valuation and **A**daptive **P**lanning (REAP), whose core idea is to explicitly maintain structured sub-tasks and facts related to the current task through the Sub-task Planner (SP) and Fact Extractor (FE) modules. SP maintains a global perspective, guiding the overall reasoning direction and evaluating the task state based on the outcomes of FE, enabling dynamic optimization of the task-solving trajectory. FE performs fine-grained analysis over retrieved content to extract reliable answers and clues. These two modules incrementally enrich a logically coherent representation of global knowledge, enhancing the reliability and the traceability of the reasoning process. Furthermore, we propose a unified task paradigm design that enables effective multi-task fine-tuning, significantly enhancing SP's performance on complex, data-scarce tasks. We conduct extensive experiments on multiple public multi-hop datasets, and the results demonstrate that our method significantly outperforms existing RAG methods in both in-domain and out-of-domain settings, validating its effectiveness in complex multi-hop reasoning tasks.

EAAI Journal 2025 Journal Article

A classification method for online consultation on civil disputes based on deep transfer learning with small datasets

• Ning Wang
• Shibo Cui
• Enhui Zhao
• Baiji Jin

With the widespread use of artificial intelligent systems to resolve civil disputes, the classification function of online consultation intelligence systems has become increasingly significant, providing accurate knowledge support for later decision-making. However, the informality of online consultation and cross-platform data decentralization, together with the small amount of data, cause typical machine learning approaches to perform poorly when dealing with such data. In light of this, this study provides a deep transfer learning-based method to solving the challenge of classifying online consultation for civil disputes with unbalanced and small datasets via cross-platform knowledge transfer. First, ontology design and modeling are integrated to normalize cross-domain feature representations and reduce the impact of linguistic ambiguity on transfer results. Second, improved marginal fisher analysis is applied to improve the model's performance of intra-class compactness and inter-class separation. Then, joint distribution adaptation with conditional feature mapping is proposed to alleviate the adverse impact of outliers on transfer learning using a conditional feature mapping mechanism. Finally, online datasets on Chinese civil disputes are used to validate the method. The results indicate that the method is more effective than other popular machine learning techniques with evaluation metrics showing accuracy 84. 17 % and recall 84. 40 %. The study can provide technical support for artificial intelligence systems that lack data deposition and has practical significance for improving the efficiency of civil dispute mediation.

IJCAI Conference 2025 Conference Paper

Advancing Embodied Agent Security: From Safety Benchmarks to Input Moderation

• Ning Wang
• Zihan Yan
• Weiyang Li
• Chuan Ma
• He Chen
• Tao Xiang

Embodied agents exhibit immense potential across a multitude of domains, making the assurance of their behavioral safety a fundamental prerequisite for their widespread deployment. However, existing research predominantly concentrates on the security of general large language models, lacking specialized methodologies for establishing safety benchmarks and input moderation tailored to embodied agents. To bridge this gap, this paper introduces a novel input moderation framework, meticulously designed to safeguard embodied agents. This framework encompasses the entire pipeline, including taxonomy definition, dataset curation, moderator architecture, model training, and rigorous evaluation. Notably, we introduce EAsafetyBench, a meticulously crafted safety benchmark engineered to facilitate both the training and stringent assessment of moderators specifically designed for embodied agents. Furthermore, we propose Pinpoint, an innovative prompt-decoupled input moderation scheme that harnesses a masked attention mechanism to effectively isolate and mitigate the influence of functional prompts on moderation tasks. Extensive experiments conducted on diverse benchmark datasets and models validate the feasibility and efficacy of the proposed approach. The results demonstrate that our methodologies achieve an impressive average detection accuracy of 94. 58%, surpassing the performance of existing state-of-the-art techniques, alongside an exceptional moderation processing time of merely 0. 002 seconds per instance. The source code and datasets can be found at https: //github. com/ZihanYan-CQU/EAsafetyBench.

EAAI Journal 2025 Journal Article

Dual-stage manifold preserving mixed supervised learning for bogie fault diagnosis under variable conditions

• Ning Wang
• Limin Jia
• Yong Qin
• Dechen Yao
• Jianwei Yang
• Zhipeng Wang

Bogie fault diagnosis for bogie is crucial to the safety of rail systems. However, since bogies work under normal states most of the time, the sporadic faulty samples are often submerged in massive normal samples, which are difficult to be distinguished and labeled. Therefore, the labeled training data are always insufficient or even lack of some certain fault states (novel faults), which brings great challenges to fault diagnosis, especially under variable working conditions. Therefore, this paper proposes a new framework named dual-stage manifold preserving mixed supervised learning (d-MMSL) to simultaneously absorb from labeled and unlabeled data effectively. Firstly, manifold similarity (MSLP) is presented to cluster unlabeled samples according to one-off calculation of the manifold similarity. In MSLP, the Best-versus-Second-Best differences and uncertain values are utilized to measure manifold distance and maintain the inherent structure of data. Secondly, Local manifold regularization - broad learning system (LMR-BLS) is presented to o deal with the problem of linear and nonlinear function transformation using simple incremental structure, which could further separate fuzzy sets from MSLP and distinguish the operation conditions of known states accurately. The proposed framework has been verified by a classical dataset and actual vibration data collected from bogies, which achieves a F1-score of 0. 99. It is proven that this framework outperforms traditional methods in accuracy and efficiency.

IROS Conference 2025 Conference Paper

Human-Robot Cooperative Heavy Payload Manipulation based on Whole-Body Model Predictive Control

• Ning Wang
• Shuo Liu
• Tin Lun Lam
• Tianwei Zhang 0002

Human-robot collaborative manipulation with mobile, multiple manipulators is crucial for expanding robotic applications, requiring precise handling of coupled force-position constraints between partners. Current systems, however, exhibit end-effector oscillations and instability during dynamic interactions. To overcome these limitations, this work develops a collaborative framework integrating a collaborative controller and a whole-body controller. The collaborative controller employs the object’s center-of-mass dynamics model with real-time contact forces and motion states to predict trajectories while coordinating with an attitude stabilization controller to adjust the desired end-effector poses. The whole-body controller utilizes model predictive control to generate coordinated motions that strictly follow pose commands from the collaborative controller, ensuring stable transportation. Simulation and physical experiments validate the proposed framework’s effectiveness in real-world scenarios.

ICML Conference 2025 Conference Paper

MVA: Linear Attention with High-order Query-Keys Integration and Multi-level Vocabulary Decomposition

• Ning Wang
• Zekun Li 0014
• Tongxin Bai
• Man Yao
• Zhen Qin
• Guoqi Li 0002

Linear attention offers the advantages of linear inference time and fixed memory usage compared to Softmax attention. However, training large-scale language models with linear attention from scratch remains prohibitively expensive and exhibits significant performance gaps compared to Softmax-based models. To address these challenges, we focus on transforming pre-trained Softmax-based language models into linear attention models. We unify mainstream linear attention methods using a high-order QK integration theory and a multi-level vocabulary decomposition. Specifically, the QK integration theory explains the efficacy of combining linear and sparse attention from the perspective of information collection across different frequency bands. The multi-level vocabulary decomposition exponentially expands memory capacity by recursively exploiting compression loss from compressed states. Through detailed error analysis, we demonstrate superior approximation of Softmax attention achieved by our approach. To further improve performance and reduce training costs, we adopt a soft integration strategy with attention scores, effectively combining a sliding window mechanism. With less than 100M tokens, our method fine-tunes models to achieve linear complexity while retaining 99% of their original performance. Compared to state-of-the-art linear attention model and method, our approach improves MMLU scores by 1. 2 percentage points with minimal fine-tuning. Furthermore, even without the sliding window mechanism, our method achieves state-of-the-art performance on all test sets with 10B tokens.

NeurIPS Conference 2025 Conference Paper

Prompt-guided Disentangled Representation for Action Recognition

• Tianci Wu
• Guangming Zhu
• Lu Jiang
• Siyuan Wang
• Ning Wang
• Nuoye Xiong
• Liang Zhang

Action recognition is a fundamental task in video understanding. Existing methods typically extract unified features to process all actions in one video, which makes it challenging to model the interactions between different objects in multi-action scenarios. To alleviate this issue, we explore disentangling any specified actions from complex scenes as an effective solution. In this paper, we propose Prompt-guided Disentangled Representation for Action Recognition (ProDA), a novel framework that disentangles any specified actions from a multi-action scene. ProDA leverages Spatio-temporal Scene Graphs (SSGs) and introduces Dynamic Prompt Module (DPM) to guide a Graph Parsing Neural Network (GPNN) in generating action-specific representations. Furthermore, we design a video-adapted GPNN that aggregates information using dynamic weights. Extensive experiments on two complex video action datasets, Charades and SportsHHI, demonstrate the effectiveness of our approach against state-of-the-art methods. Our code can be found in https: //github. com/iamsnaping/ProDA. git.

AAAI Conference 2024 Conference Paper

Cycle-Consistency Learning for Captioning and Grounding

• Ning Wang
• Jiajun Deng
• Mingbo Jia

We present that visual grounding and image captioning, which perform as two mutually inverse processes, can be bridged together for collaborative training by careful designs. By consolidating this idea, we introduce CyCo, a cyclic-consistent learning framework to ameliorate the independent training pipelines of visual grounding and image captioning. The proposed framework (1) allows the semi-weakly supervised training of visual grounding; (2) improves the performance of fully supervised visual grounding; (3) yields a general captioning model that can describe arbitrary image regions. Extensive experiments show that our fully supervised grounding model achieves state-of-the-art performance, and the semi-weakly supervised one also exhibits competitive performance compared to the fully supervised counterparts. Our image captioning model has the capability to freely describe image regions and meanwhile shows impressive performance on prevalent captioning benchmarks.

JBHI Journal 2024 Journal Article

Guest Editorial: Special Issue on Recent Technologies in IoT for E-Health Applications

• Chi Lin
• Chang Wu Yu
• Ning Wang
• Syed Hassan Ahmed

EAAI Journal 2024 Journal Article

Iterative minority oversampling and its ensemble for ordinal imbalanced datasets

• Ning Wang
• Zhong-Liang Zhang
• Xing-Gang Luo

Ordinal classification of imbalanced datasets is a challenging problem that occurs in many real-world applications. The main challenge is to simultaneously consider the classes ordering and imbalanced distribution. Although the classic synthetic instances oversampling techniques can improve the identification of minority classes, they easily incur the damage of the classes ordering when the synthetic instances fall in non-adjacent classes regions. In this paper, we propose a powerful method for handling the imbalanced problem embedded in the ordinal classification, namely Iterative Minority oversampling technique for imbalanced Ordinal Classification (IMOC). Concretely, we first develop an iterative identification procedure to select the minority instance that is hardest to learn. Then, a weighted oversampling probability distribution that respects the ordinal nature is used to generate synthetic minority instances to balance the skewed distribution. Furthermore, two novel ensemble versions are developed to boost the capability of our proposed IMOC. In order to verify the effectiveness and robustness of our proposed methods, an extensive experimental study is carried out on a large number of datasets from real-world applications. The experimental results supported by proper statistical tests indicate that our proposed methods outperform state-of-the-art algorithms in terms of the most frequently used performance measures.

JMLR Journal 2024 Journal Article

Statistical analysis for a penalized EM algorithm in high-dimensional mixture linear regression model

• Ning Wang
• Xin Zhang
• Qing Mai

The expectation-maximization (EM) algorithm and its variants are widely used in statistics. In high-dimensional mixture linear regression, the model is assumed to be a finite mixture of linear regression and the number of predictors is much larger than the sample size. The standard EM algorithm, which attempts to find the maximum likelihood estimator, becomes infeasible for such model. We devise a group lasso penalized EM algorithm and study its statistical properties. Existing theoretical results of regularized EM algorithms often rely on dividing the sample into many independent batches and employing a fresh batch of sample in each iteration of the algorithm. Our algorithm and theoretical analysis do not require sample-splitting, and can be extended to multivariate response cases. The proposed methods also have encouraging performances in numerical studies. [abs] [ pdf ][ bib ] &copy JMLR 2024. ( edit, beta )

AAAI Conference 2023 Conference Paper

Controllable Image Captioning via Prompting

• Ning Wang
• Jiahao Xie
• Jihao Wu
• Mingbo Jia
• Linlin Li

Despite the remarkable progress of image captioning, existing captioners typically lack the controllable capability to generate desired image captions, e.g., describing the image in a rough or detailed manner, in a factual or emotional view, etc. In this paper, we show that a unified model is qualified to perform well in diverse domains and freely switch among multiple styles. Such a controllable capability is achieved by embedding the prompt learning into the image captioning framework. To be specific, we design a set of prompts to fine-tune the pre-trained image captioner. These prompts allow the model to absorb stylized data from different domains for joint training, without performance degradation in each domain. Furthermore, we optimize the prompts with learnable vectors in the continuous word embedding space, avoiding the heuristic prompt engineering and meanwhile exhibiting superior performance. In the inference stage, our model is able to generate desired stylized captions by choosing the corresponding prompts. Extensive experiments verify the controllable capability of the proposed method. Notably, we achieve outstanding performance on two diverse image captioning benchmarks including COCO Karpathy split and TextCaps using a unified model.

AAAI Conference 2023 Conference Paper

Efficient Image Captioning for Edge Devices

• Ning Wang
• Jiangrong Xie
• Hang Luo
• Qinglin Cheng
• Jihao Wu
• Mingbo Jia
• Linlin Li

Recent years have witnessed the rapid progress of image captioning. However, the demands for large memory storage and heavy computational burden prevent these captioning models from being deployed on mobile devices. The main obstacles lie in the heavyweight visual feature extractors (i.e., object detectors) and complicated cross-modal fusion networks. To this end, we propose LightCap, a lightweight image captioner for resource-limited devices. The core design is built on the recent CLIP model for efficient image captioning. To be specific, on the one hand, we leverage the CLIP model to extract the compact grid features without relying on the time-consuming object detectors. On the other hand, we transfer the image-text retrieval design of CLIP to image captioning scenarios by devising a novel visual concept extractor and a cross-modal modulator. We further optimize the cross-modal fusion model and parallel prediction heads via sequential and ensemble distillations. With the carefully designed architecture, our model merely contains 40M parameters, saving the model size by more than 75% and the FLOPs by more than 98% in comparison with the current state-of-the-art methods. In spite of the low capacity, our model still exhibits state-of-the-art performance on prevalent datasets, e.g., 136.6 CIDEr on COCO Karpathy test split. Testing on the smartphone with only a single CPU, the proposed LightCap exhibits a fast inference speed of 188ms per image, which is ready for practical applications.

EAAI Journal 2023 Journal Article

Semantic attention and relative scene depth-guided network for underwater image enhancement

• Tingkai Chen
• Ning Wang
• Yanzheng Chen
• Xiangjun Kong
• Yejin Lin
• Hong Zhao
• Hamid Reza Karimi

In this paper, to solve unique underwater degradation challenges covering low contrast, color deviation and blurring, etc. , a novel semantic attention and relative scene depth-guided network (SARSDN) for underwater image enhancement is proposed. Main contributions are as follows: (1) By combining with diverse characteristics of red–green–blue, hue-saturation-value and Lab spaces, the multi-color space feature representation network (MSFRN) is elaborately developed, such that domain shifting can be effectively alleviated; (2) By utilizing position attention and devising multi-dilated-convolution depth perception unit, the underwater relative scene depth estimation network (URSDEN) is proposed to adapt attention weights to regions with different degrees of degradation, thereby exclusively accommodating scene depth-dependent attenuation and scattering; (3) The underwater scene semantic segmentation network (USSSN) is devised to estimate semantic attention map for reducing artifacts and increasing integrity of foreground objects during underwater image enhancement by virtue of encoder–decoder framework with deformable convolution network; and (4) The entire SARSDN scheme is ultimately created in a modular manner by integrating MSFRN, URSDEN and USSSN modules. Comprehensive experiments and comparisons thoroughly illustrate that the developed SARSDN framework outperforms typical underwater image enhancement approaches from both subjective and objective aspects, where UIQM scores are 0. 8263, 0. 9393, 1. 1817, 0. 5289, 0. 6517, 0. 5393, 0. 7917 and 0. 4651 higher than those of IBLA, ULAP, HLRP, UCM, RGHS, MLLE, UGAN and FUnIE-GAN schemes, respectively.

ICRA Conference 2022 Conference Paper

Diff-Net: Image Feature Difference Based High-Definition Map Change Detection for Autonomous Driving

• Lei He 0004
• Shengjie Jiang
• Xiaoqing Liang
• Ning Wang
• Shiyu Song

Up-to-date High-Definition (HD) maps are essential for self-driving cars. To achieve constantly updated HD maps, we present a deep neural network (DNN), Diff-Net, to detect changes in them. Compared to traditional methods based on object detectors, the essential design in our work is a parallel feature difference calculation structure that infers map changes by comparing features extracted from the camera and rasterized images. To generate these rasterized images, we project map elements onto images in the camera view, yielding meaningful map representations that can be consumed by a DNN accordingly. As we formulate the change detection task as an object detection problem, we leverage the anchor-based structure that predicts bounding boxes with different change status categories. To the best of our knowledge, the proposed method is the first end-to-end network that tackles the high-definition map change detection task, yielding a single stage solution. Furthermore, rather than relying on single frame input, we introduce a spatio-temporal fusion module that fuses features from history frames into the current, thus improving the overall performance. Finally, we comprehensively validate our method's effectiveness using freshly collected datasets. Results demonstrate that our Diff-Net achieves better performance than the baseline methods and is ready to be integrated into a map production pipeline maintaining an up-to-date HD map.

JBHI Journal 2022 Journal Article

ULECGNet: An Ultra-Lightweight End-to-End ECG Classification Neural Network

• Jianbiao Xiao
• Jiahao Liu
• Huanqi Yang
• Qingsong Liu
• Ning Wang
• Zhen Zhu
• Yulong Chen
• Yu Long

ECG classification is a key technology in intelligent electrocardiogram (ECG) monitoring. In the past, traditional machine learning methods such as support vector machine (SVM) and K-nearest neighbor (KNN) have been used for ECG classification, but with limited classification accuracy. Recently, the end-to-end neural network has been used for ECG classification and shows high classification accuracy. However, the end-to-end neural network has large computational complexity including a large number of parameters and operations. Although dedicated hardware such as field-programmable gate array (FPGA) and application-specific integrated circuit (ASIC) can be developed to accelerate the neural network, they result in large power consumption, large design cost, or limited flexibility. In this work, we have proposed an ultra-lightweight end-to-end ECG classification neural network that has extremely low computational complexity (∼8. 2k parameters & ∼227k multiplication/addition operations) and can be squeezed into a low-cost microcontroller (MCU) such as MSP432 while achieving 99. 1% overall classification accuracy. This outperforms the state-of-the-art ECG classification neural network. Implemented on MSP432, the proposed design consumes only 0. 4 mJ and 3. 1 mJ per heartbeat classification for normal and abnormal heartbeats respectively for real-time ECG classification.

AAAI Conference 2021 Conference Paper

Contrastive Transformation for Self-supervised Correspondence Learning

• Ning Wang
• Wengang Zhou
• Houqiang Li

In this paper, we focus on the self-supervised learning of visual correspondence using unlabeled videos in the wild. Our method simultaneously considers intra- and inter-video representation associations for reliable correspondence estimation. The intra-video learning transforms the image contents across frames within a single video via the frame pair-wise affinity. To obtain the discriminative representation for instance-level separation, we go beyond the intra-video analysis and construct the inter-video affinity to facilitate the contrastive transformation across different videos. By forcing the transformation consistency between intra- and inter-video levels, the fine-grained correspondence associations are well preserved and the instance-level feature discrimination is effectively reinforced. Our simple framework outperforms the recent selfsupervised correspondence methods on a range of visual tasks including video object tracking (VOT), video object segmentation (VOS), pose keypoint tracking, etc. It is worth mentioning that our method also surpasses the fully-supervised affinity representation (e. g. , ResNet) and performs competitively against the recent fully-supervised algorithms designed for the specific tasks (e. g. , VOT and VOS).

IROS Conference 2020 Conference Paper

Adaptive Informative Sampling with Environment Partitioning for Heterogeneous Multi-Robot Systems

• Yunfei Shi
• Ning Wang
• Jianmin Zheng
• Yang Zhang
• Sha Yi
• Wenhao Luo
• Katia P. Sycara

Multi-robot systems are widely used in environmental exploration and modeling, especially in hazardous environments. However, different types of robots are limited by different mobility, battery life, sensor type, etc. Heterogeneous robot systems are able to utilize various types of robots and provide solutions where robots are able to compensate each other with their different capabilities. In this paper, we consider the problem of sampling and modeling environmental characteristics with a heterogeneous team of robots. To utilize heterogeneity of the system while remaining computationally tractable, we propose an environmental partitioning approach that leverages various robot capabilities by forming a uniformly defined heterogeneity cost space. We combine with the mixture of Gaussian Processes model-learning framework to adaptively sample and model the environment in an efficient and scalable manner. We demonstrate our algorithm in field experiments with ground and aerial vehicles.

AIIM Journal 2020 Journal Article

Disease phenotype synonymous prediction through network representation learning from PubMed database

• Shiwen Ma
• Kuo Yang
• Ning Wang
• Qiang Zhu
• Zhuye Gao
• Runshun Zhang
• Baoyan Liu
• Xuezhong Zhou

Synonym mapping between phenotype concepts from different terminologies is difficult because terminology databases have been developed largely independently. Existing maps of synonymous phenotype concepts from different terminology databases are highly incomplete, and manually mapping is time consuming and laborious. Therefore, building an automatic method for predictive mapping of synonymous phenotypes is of special importance. We propose a classifier-based phenotype mapping prediction model (CPM) to predict synonymous relationships between phenotype concepts from different terminology databases. The model takes network semantic representations of phenotypes as input and predicts synonymous relationships by training binary classifiers with a voting strategy. We compared the performance of the CPM with a similarity-based phenotype mapping prediction model (SPM), which predicts mapping based on the ranked cosine similarity of candidate mapping concepts. Based on a network representation N2V-TFIDF, with a majority voting strategy method MV, the CPM achieved accuracy of 0. 943, which was 15. 4% higher than that of the SPM using the cosine similarity method (0. 789) and 23. 8% higher than that of the SSDTM method (0. 724) proposed in our previous work.

AAAI Conference 2020 Conference Paper

POST: POlicy-Based Switch Tracking

• Ning Wang
• Wengang Zhou
• Guojun Qi
• Houqiang Li

In visual object tracking, by reasonably fusing multiple experts, ensemble framework typically achieves superior performance compared to the individual experts. However, the necessity of parallelly running all the experts in most existing ensemble frameworks heavily limits their efficiency. In this paper, we propose POST, a POlicy-based Switch Tracker for robust and efficient visual tracking. The proposed POST tracker consists of multiple weak but complementary experts (trackers) and adaptively assigns one suitable expert for tracking in each frame. By formulating this expert switch in consecutive frames as a decision-making problem, we learn an agent via reinforcement learning to directly decide which expert to handle the current frame without running others. In this way, the proposed POST tracker maintains the performance merit of multiple diverse models while favorably ensuring the tracking efficiency. Extensive ablation studies and experimental comparisons against state-of-the-art trackers on 5 prevalent benchmarks verify the effectiveness of the proposed method.

JBHI Journal 2020 Journal Article

TSE-CNN: A Two-Stage End-to-End CNN for Human Activity Recognition

• Jiahui Huang
• Shuisheng Lin
• Ning Wang
• Guanghai Dai
• Yuxiang Xie
• Jun Zhou

Human activity recognition has been widely used in healthcare applications such as elderly monitoring, exercise supervision, and rehabilitation monitoring. Compared with other approaches, sensor-based wearable human activity recognition is less affected by environmental noise and therefore is promising in providing higher recognition accuracy. However, one of the major issues of existing wearable human activity recognition methods is that although the average recognition accuracy is acceptable, the recognition accuracy for some activities (e. g. , ascending stairs and descending stairs) is low, mainly due to relatively less training data and complex behavior pattern for these activities. Another issue is that the recognition accuracy is low when the training data from the test subject are limited, which is a common case in real practice. In addition, the use of neural network leads to large computational complexity and thus high power consumption. To address these issues, we proposed a new human activity recognition method with two-stage end-to-end convolutional neural network and a data augmentation method. Compared with the state-of-the-art methods (including neural network based methods and other methods), the proposed methods achieve significantly improved recognition accuracy and reduced computational complexity.

EAAI Journal 2019 Journal Article

Cuckoo search algorithm with onlooker bee search for modeling PEMFCs using T2FNN

• Xiaohua Zhu
• Ning Wang

The accurate mathematical model plays an important role in the simulation and analysis of proton exchange membrane fuel cells (PEMFCs). This paper proposes the nonlinear modeling approach using type-2 fuzzy neural network (T2FNN) for PEMFCs. For the optimal tuning of the T2FNN, a novel cuckoo search algorithm, the cuckoo search algorithm with onlooker bee search (ObCS) is proposed. In ObCS, the opposition based learning strategy is used to make the initial population distribution more uniform. A modified local search strategy on onlooker bee search is designed to improve the local search ability. Numerical experiments with two groups of test functions show that the ObCS has a higher quality of solutions in comparison with the basic CS, the two improved CSs, and the other state-of-the-art optimization algorithms. Finally, the ObCS is applied to optimize the parameters of the T2FNN for modeling a PEMFC. The experimental results demonstrate that the ObCS and RLS based T2FNN is a more efficient technique by comparing with the CS and RLS based T2FNN.

JBHI Journal 2019 Journal Article

HerGePred: Heterogeneous Network Embedding Representation for Disease Gene Prediction

• Kuo Yang
• Ruyu Wang
• Guangming Liu
• Zixin Shu
• Ning Wang
• Runshun Zhang
• Jian Yu
• Jianxin Chen

The discovery of disease-causing genes is a critical step towards understanding the nature of a disease and determining a possible cure for it. In recent years, many computational methods to identify disease genes have been proposed. However, making full use of disease-related (e. g. , symptoms) and gene-related (e. g. , gene ontology and protein-protein interactions) information to improve the performance of disease gene prediction is still an issue. Here, we develop a heterogeneous disease-gene-related network (HDGN) embedding representation framework for disease gene prediction (called HerGePred). Based on this framework, a low-dimensional vector representation (LVR) of the nodes in the HDGN can be obtained. Then, we propose two specific algorithms, namely, an LVR-based similarity prediction and a random walk with restart on a reconstructed heterogeneous disease-gene network (RWRDGN), to predict disease genes with high performance. First, to validate the rationality of the framework, we analyze the similarity-based overlap distribution of disease pairs and design an experiment for disease-gene association recovery, the results of which revealed that the LVR of nodes performs well at preserving the local and global network structure of the HDGN. Then, we apply tenfold cross validation and external validation to compare our methods with other well-known disease gene prediction algorithms. The experimental results show that the RW-RDGN performs better than the state-of-the-art algorithm. The prediction results of disease candidate genes are essential for molecular mechanism investigation and experimental validation. The source codes of HerGePred and experimental data are available at https://github.com/yangkuoone/HerGePred.

IJCAI Conference 2019 Conference Paper

MUSICAL: Multi-Scale Image Contextual Attention Learning for Inpainting

• Ning Wang
• Jingyuan Li
• Lefei Zhang
• Bo Du

We study the task of image inpainting, where an image with missing region is recovered with plausible context. Recent approaches based on deep neural networks have exhibited potential for producing elegant detail and are able to take advantage of background information, which gives texture information about missing region in the image. These methods often perform pixel/patch level replacement on the deep feature maps of missing region and therefore enable the generated content to have similar texture as background region. However, this kind of replacement is a local strategy and often performs poorly when the background information is misleading. To this end, in this study, we propose to use a multi-scale image contextual attention learning (MUSICAL) strategy that helps to flexibly handle richer background information while avoid to misuse of it. However, such strategy may not promising in generating context of reasonable style. To address this issue, both of the style loss and the perceptual loss are introduced into the proposed method to achieve the style consistency of the generated image. Furthermore, we have also noticed that replacing some of the down sampling layers in the baseline network with the stride 1 dilated convolution layers is beneficial for producing sharper and fine-detailed results. Experiments on the Paris Street View, Places, and CelebA datasets indicate the superior performance of our approach compares to the state-of-the-arts.

AAMAS Conference 2018 Conference Paper

Clustering Behavior to Recognize Subjective Beliefs in Human-Agent Teams

• David V. Pynadath
• Ning Wang
• Ericka Rovira
• Michael J. Barnes

Trust is critical to the success of human-agent teams, and a critical antecedents to trust is transparency. To best interact with human teammates, an agent explain itself so that they understand its decision-making process. However, individual differences among human teammates require that the agent dynamically adjust its explanation strategy based on their unobservable subjective beliefs. The agent must therefore recognize its teammates’ subjective beliefs relevant to trust-building (e. g. , their understanding of the agent’s capabilities and process). We leverage a nonparametric method to enable an agent to use its history of prior interactions as a means for recognizing and predicting a new teammate’s subjective beliefs. We first gather data combining observable behavior sequences with survey-based observations of typically unobservable perceptions. We then use a nearest-neighbor approach to identify the prior teammates most similar to the new one. We use these neighbors’ responses to infer the likelihood of possible beliefs, as in collaborative filtering. The results provide insights into the types of beliefs that are easy (and hard) to infer from purely behavioral observations.

AAMAS Conference 2016 Conference Paper

The Impact of POMDP-Generated Explanations on Trust and Performance in Human-Robot Teams

• Ning Wang
• David V. Pynadath
• Susan G. Hill

Researchers have observed that people will more accurately trust an autonomous system, such as a robot, if they have a more accurate understanding of its decision-making process. Studies have shown that hand-crafted explanations can help maintain effective team performance even when the system is less than 100% reliable. However, current explanation algorithms are not sufficient for making a robot’s quantitative reasoning (in terms of both uncertainty and conflicting goals) transparent to human teammates. In this work, we develop a novel mechanism for robots to automatically generate explanations of reasoning based on Partially Observable Markov Decision Problems (POMDPs). Within this mechanism, we implement alternate natural-language templates and then measure their differential impact on trust and team performance within an agent-based online testbed that simulates a human-robot team task. The results demonstrate that the added explanation capability leads to improvement in transparency, trust, and team performance. Furthermore, by observing the different outcomes due to variations in the robot’s explanation content, we gain valuable insight that can help lead to refinement of explanation algorithms to further improve human-robot interaction. General Terms Algorithms

JBHI Journal 2015 Journal Article

Extracting and Selecting Distinctive EEG Features for Efficient Epileptic Seizure Prediction

• Ning Wang
• Michael R. Lyu

This paper presents compact yet comprehensive feature representations for the electroencephalogram (EEG) signal to achieve efficient epileptic seizure prediction performance. The initial EEG feature vectors are formed by acquiring the dominant amplitude and frequency components on an epoch-by-epoch basis from the EEG signals. These extracted parameters can reveal the intrinsic EEG signal changes as well as the underlying stage transitions. To improve the efficacy of feature extraction, an elimination-based feature selection method has been applied on the initial feature vectors. This diminishes redundant and noisy points, providing each patient with a lower dimensional and independent final feature form. In this context, our study is distinguished from that of others currently prevailing. Usually, these latter approaches adopted feature extraction processes, which employed time-consuming high-dimensional parameter sets. Machine learning approaches that are considered as state of the art have been employed to build patient-specific binary classifiers that can divide the extracted feature parameters into preictal and interictal groups. Through out-of-sample evaluation on the intracranial EEG recordings provided by the publicly available Freiburg dataset, promising prediction performance has been attained. Specifically, we have achieved 98. 8% sensitivity results on the 19 patients included in our experiment, where only one of 83 seizures across all patients was not predicted. To make this investigation more comprehensive, we have conducted extensive comparative studies with other recently published competing approaches, in which the advantages of our method are highlighted.

AAMAS Conference 2008 Conference Paper

Does the Contingency of Agents' Nonverbal Feedback Affect Users' Social Anxiety?

• Sin-Hwa Kang
• Jonathan Gratch
• Ning Wang
• James Watt

We explored the association between users’ social anxiety and the interactional fidelity of an agent (also referred to as a virtual human), specifically addressing whether the contingency of agents’ nonverbal feedback affects the relationship between users’ social anxiety and their feelings of rapport, performance, or judgment on interaction partners. This subject was examined across four experimental conditions where participants interacted with three different types of agents and a real human. The three types of agents included the Non-Contingent Agent, the Responsive Agent (opposite to the Non-Contingent Agent), and the Mediated Agent (controlled by a real human). The results indicated that people having greater social anxiety would feel less rapport and show worse performance while feeling more embarrassment if they experience the untimely feedback of the Non-Contingent Agent. The results also showed people having more anxiety would trust real humans less as their interaction partners. We discuss the implication of this relationship between social anxiety in a human subject and the interactional fidelity of an agent on the design of virtual characters for social skills training and therapy.

AAMAS Conference 2008 Conference Paper

Individual Differences in Expressive Response: A Challenge for ECA Design

• Ning Wang
• Stacy Marsella
• Tim Hawkins

To create realistic and expressive virtual humans, we need to develop better models of the processes and dynamics of human emotions and expressions. A first step in this effort is to develop means to systematically induce and capture realistic expressions in real humans. We conducted a series of studies on human emotions and facial expression using the Emotion Evoking Game (EVG) and a high-speed video camera. In this paper, we discuss a detailed analysis of facial expressions in response to a surprise situation. We provide details on the rich dynamics of facial expressions, along with data useful for animation of virtual human. The analysis of the data also revealed considerable individual differences in whether surprise was evoked and how it was expressed.