Author name cluster

Jing He

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.

16 papers

2 author rows

AAAI Conference 2026 Conference Paper

FACTGUARD: Event-Centric and Commonsense-Guided Fake News Detection

Jing He
Han Zhang
Yuanhui Xiao
Wei Guo
Shaowen Yao
Renyang Liu

Fake news detection methods based on writing style have achieved remarkable progress. However, as adversaries increasingly imitate the style of authentic news, the effectiveness of such approaches is gradually diminishing. Recent research has explored incorporating large language models (LLMs) to enhance fake news detection. Yet, despite their transformative potential, LLMs remain an untapped goldmine for fake news detection, with their real-world adoption hampered by shallow functionality exploration, ambiguous usability, and prohibitive inference costs. In this paper, we propose a novel fake news detection framework, dubbed FACTGUARD, that leverages LLMs to extract event-centric content, thereby reducing the impact of writing style on detection performance. Furthermore, our approach introduces a dynamic usability mechanism that identifies contradictions and ambiguous cases in factual reasoning, adaptively incorporating LLM advice to improve decision reliability. To ensure efficiency and practical deployment, we employ knowledge distillation to derive FACTGUARD-D, enabling the framework to operate effectively in cold-start and resource-constrained scenarios. Comprehensive experiments on two benchmark datasets demonstrate that our approach consistently outperforms existing methods in both robustness and accuracy, effectively addressing the challenges of style sensitivity and LLM usability in fake news detection.

PDF Details DOI

ICLR Conference 2025 Conference Paper

DisEnvisioner: Disentangled and Enriched Visual Prompt for Customized Image Generation

Jing He
Haodong Li
Yongzhe Hu
Guibao Shen
Yingjie Cai
Weichao Qiu
Ying-Cong Chen

In the realm of image generation, creating customized images from visual prompt with additional textual instruction emerges as a promising endeavor. However, existing methods, both tuning-based and tuning-free, struggle with interpreting the subject-essential attributes from the visual prompt. This leads to subject-irrelevant attributes infiltrating the generation process, ultimately compromising the personalization quality in both editability and ID preservation. In this paper, we present $\textbf{DisEnvisioner}$, a novel approach for effectively extracting and enriching the subject-essential features while filtering out -irrelevant information, enabling exceptional customization performance, in a $\textbf{tuning-free}$ manner and using only $\textbf{a single image}$. Specifically, the feature of the subject and other irrelevant components are effectively separated into distinctive visual tokens, enabling a much more accurate customization. Aiming to further improving the ID consistency, we enrich the disentangled features, sculpting them into a more granular representation. Experiments demonstrate the superiority of our approach over existing methods in instruction response (editability), ID consistency, inference speed, and the overall image quality, highlighting the effectiveness and efficiency of DisEnvisioner.

Details

NeurIPS Conference 2025 Conference Paper

Jasmine: Harnessing Diffusion Prior for Self-supervised Depth Estimation

Jiyuan Wang
Chunyu Lin
cheng guan
Lang Nie
Jing He
Haodong Li
Kang Liao
Yao Zhao

In this paper, we propose \textbf{Jasmine}, the first Stable Diffusion (SD)-based self-supervised framework for monocular depth estimation, which effectively harnesses SD’s visual priors to enhance the sharpness and generalization of unsupervised prediction. Previous SD-based methods are all supervised since adapting diffusion models for dense prediction requires high-precision supervision. In contrast, self-supervised reprojection suffers from inherent challenges (\textit{e. g. }, occlusions, texture-less regions, illumination variance), and the predictions exhibit blurs and artifacts that severely compromise SD's latent priors. To resolve this, we construct a novel surrogate task of mix-batch image reconstruction. Without any additional supervision, it preserves the detail priors of SD models by reconstructing the images themselves while preventing depth estimation from degradation. Furthermore, to address the inherent misalignment between SD's scale and shift invariant estimation and self-supervised scale-invariant depth estimation, we build the Scale-Shift GRU. It not only bridges this distribution gap but also isolates the fine-grained texture of SD output against the interference of reprojection loss. Extensive experiments demonstrate that Jasmine achieves SoTA performance on the KITTI benchmark and exhibits superior zero-shot generalization across multiple datasets.

PDF Details

ICLR Conference 2025 Conference Paper

Lotus: Diffusion-based Visual Foundation Model for High-quality Dense Prediction

Jing He
Haodong Li
Wei Yin 0006
Yixun Liang
Leheng Li
Kaiqiang Zhou
Hongbo Zhang
Bingbing Liu

Leveraging the visual priors of pre-trained text-to-image diffusion models offers a promising solution to enhance zero-shot generalization in dense prediction tasks. However, existing methods often uncritically use the original diffusion formulation, which may not be optimal due to the fundamental differences between dense prediction and image generation. In this paper, we provide a systemic analysis of the diffusion formulation for the dense prediction, focusing on both quality and efficiency. And we find that the original parameterization type for image generation, which learns to predict noise, is harmful for dense prediction; the multi-step noising/denoising diffusion process is also unnecessary and challenging to optimize. Based on these insights, we introduce $\textbf{Lotus}$, a diffusion-based visual foundation model with a simple yet effective adaptation protocol for dense prediction. Specifically, Lotus is trained to directly predict annotations instead of noise, thereby avoiding harmful variance. We also reformulate the diffusion process into a single-step procedure, simplifying optimization and significantly boosting inference speed. Additionally, we introduce a novel tuning strategy called detail preserver, which achieves more accurate and fine-grained predictions. Without scaling up the training data or model capacity, Lotus achieves SoTA performance in zero-shot depth and normal estimation across various datasets. It also enhances efficiency, being significantly faster than most existing diffusion-based methods. Lotus' superior quality and efficiency also enable a wide range of practical applications, such as joint estimation, single/multi-view 3D reconstruction, etc.

Details

EAAI Journal 2025 Journal Article

Pseudo-label attention-based multiple instance learning for whole slide image classification

Jing He
Ping Wang
Jingwen Cai
Dan Tang
Shaowen Yao
Renyang Liu

Automating disease classification in whole slide images (WSIs) is crucial for improving clinical diagnostic efficiency. However, existing multiple instance learning (MIL) approaches for this task often struggle with challenges such as insufficient focus on positive regions and data imbalance between positive and negative regions. These issues can lead to suboptimal performance in practical applications. To address these problems, in this paper, we propose a novel embedding-based MIL technique called pseudo-label attention-based multiple instance learning (PAMIL). PAMIL aggregates each instance’s features regarding their contributions to improving downstream classification performance. The key insight of PAMIL involves training the model in a supervised manner by introducing pseudo-labels to emphasize positive regions. Additionally, we propose a fine-tuning strategy to effectively refine the dataset, eliminating the interference of false-positive data and alleviating data imbalance. The effectiveness of PAMIL was demonstrated through comparisons with six state-of-the-art MIL techniques across two large-scale, real-world datasets. Empirical results show that the proposed method outperforms other methods, achieving up to a 2. 15% improvement in accuracy and a 1. 61% increase in area under the curve (AUC) on the Cancer Genome Atlas Non-Small Cell Lung Cancer (TCGA-NSCLC) dataset, highlighting the superiority of our method in practical applications, such as helping clinicians diagnose quickly.

Details DOI

IJCAI Conference 2024 Conference Paper

Cross-View Contrastive Fusion for Enhanced Molecular Property Prediction

Yan Zheng
Song Wu
Junyu Lin
Yazhou Ren
Jing He
Xiaorong Pu
Lifang He

Machine learning based molecular property prediction has been a hot topic in the field of computer aided drug discovery (CADD). However, current MPP methods face two prominent challenges: 1) single-view MPP methods do not sufficiently exploit the complementary information of molecular data across multiple views, generally producing suboptimal performance, and 2) most existing multi-view MPP methods ignore the disparities in data quality among different views, inadvertently introducing the risk of models being overshadowed by inferior views. To address the above challenges, we introduce a novel cross-view contrastive fusion for enhanced molecular property prediction method (MolFuse). First, we extract intricate molecular semantics and structures from both sequence and graph views to leverage the complementarity of multi-view data. Then, MolFuse employs two distinct graphs, the atomic graph and chemical bond graph, to enhance the representation of the molecular graph, allow us to integrate both the fundamental backbone attributes and the nuanced shape characteristics. Notably, we incorporate a dual learning mechanism to refine the initial feature representations, and global features are obtained by maximizing the coherence among diverse view-specific molecular representations for the downstream task. The overall learning processes are combined into a unified optimization problem for iterative training. Experiments on multiple benchmark datasets demonstrate the superiority of our MolFuse.

PDF Details DOI

EAAI Journal 2024 Journal Article

Formation tracking control with disturbance rejection in leader-follower multi-agent systems under dynamic event-triggered mechanism

Jing He
Jian Liao

This paper investigates the problem of time-varying formation tracking (TVFT) in a linear multi-agent systems (MASs) with external disturbance in a type of directed network topology, and proposes a formation control strategy in a leader-follower control framework with disturbance rejection under a dynamic event-triggering mechanism (DETM). Firstly, in order to improve the overall performance of the system, an extended state observer is used to estimate the status of the follower and the presence of external disturbance in real time. Secondly, a DETM is designed to avoid continuous communication between adjacent intelligent agents. And the formation tracking error between adjacent multi-agents is used to formulate a distributed TVFT control strategy. Furthermore, a compensation function is designed to actively offset the impact of time-varying disturbances on system. A Lyapunov function is then established for stability analysis, verifying the absence of Zeno behavior with this DETM. Finally, a comparative numerical simulation was conducted using an unmanned aerial vehicle (UAV) cluster case to verify that the proposed method can save communication resources to a greater extent and has good control performance.

Details DOI

AAAI Conference 2024 Conference Paper

Towards Efficient Diffusion-Based Image Editing with Instant Attention Masks

Siyu Zou
Jiji Tang
Yiyi Zhou
Jing He
Chaoyi Zhao
Rongsheng Zhang
Zhipeng Hu
Xiaoshuai Sun

Diffusion-based Image Editing (DIE) is an emerging research hot-spot, which often applies a semantic mask to control the target area for diffusion-based editing. However, most existing solutions obtain these masks via manual operations or off-line processing, greatly reducing their efficiency. In this paper, we propose a novel and efficient image editing method for Text-to-Image (T2I) diffusion models, termed Instant Diffusion Editing (InstDiffEdit). In particular, InstDiffEdit aims to employ the cross-modal attention ability of existing diffusion models to achieve instant mask guidance during the diffusion steps. To reduce the noise of attention maps and realize the full automatics, we equip InstDiffEdit with a training-free refinement scheme to adaptively aggregate the attention distributions for the automatic yet accurate mask generation. Meanwhile, to supplement the existing evaluations of DIE, we propose a new benchmark called Editing-Mask to examine the mask accuracy and local editing ability of existing methods. To validate InstDiffEdit, we also conduct extensive experiments on ImageNet and Imagen, and compare it with a bunch of the SOTA methods. The experimental results show that InstDiffEdit not only outperforms the SOTA methods in both image quality and editing results, but also has a much faster inference speed, i.e., +5 to +6 times. Our code available at https://anonymous.4open.science/r/InstDiffEdit-C306

PDF Details DOI

EAAI Journal 2022 Journal Article

Learning-based airborne sensor task assignment in unknown dynamic environments

Jing He
Yuedong Wang
Yan Liang
Jinwen Hu
Shi Yan

In sensor management, the existing researches rely on traditional system modeling and strive to maximize the information superiority. In fact, on the one hand, complex environmental disturbance, incomplete information or uncooperative behavior in air combat missions often bring out unknown system evolution; on the other hand, to take full advantage of sensor effectiveness is of course essential, but more importantly, the detection security is the primary guarantee. This paper proposes the airborne sensor task assignment problem in unknown dynamic environments. Different from traditional methods that minimize the estimation error covariance or information entropy based on system dynamic model, our scheme needs to maximize agent survival while maintaining the necessary sensor detection without such model support. In assignment implementation, it is not straightforward to apply existing reinforcement learning methods, but design the state space and rewards ingeniously to meet the actual combat requirements. First, instead of selecting the locations of agents and targets as fundamental and infinite state variables, we consider the situation variables, such as target threat ranking together with cumulative radiation and information acquisition indication of sensors, which are all discrete state variables to reduce computational burden. Second, the reward structure is also designed based on the complex constraints of the mission, which is to encourage lower assignment risk and relatively full utilization of sensing, while penalizing too dangerous continuance assignment and inadequate assignment revenue. Simulations show that our proposed scheme achieves the desirable mission completion rate and the acceptable target tracking accuracy.

Details DOI

IS Journal 2021 Journal Article

An Efficient Solution to Detect Common Topologies in Money Launderings Based on Coupling and Connection

Jing He
Jiao Tian
Yuanyuan Wu
Xinyi Cia
Kai Zhang
Mengjiao Guo
Hui Zheng
Junfeng Wu

In recent years, money laundering has become much easier to be achieved but more challenging to be detected than before, which has enormous adversary effects on finance, military, and other related fields. In the real-time scenario, every money laundering case has a unique structure in terms of transactions. It is not sufficient to detect suspicious behavior by just following the probability theory, where usually the thresholds are given by experts. Since the crime of money laundering is more prevalent and sophisticated nowadays, it will increase the complexity of the detection if the accounts with the personal information are combined with the form of the transaction topology. Hence, the graph topology analysis could be used for antimoney laundering tools. This article proposes eight common topologies based on coupling and connection from simple to much more complicated structures to solve various kinds of problems concerning money laundering in the real world. Moreover, we also propose an efficient solution based on graph and subgraph isomorphism and distance measurement to detect money laundering behavior. In this way, the detection of money laundering behavior will be more efficient and effective for various situations while referencing the proposed eight topological structures.

Details DOI

IJCAI Conference 2020 Conference Paper

SEBF: A Single-Chain based Extension Model of Blockchain for Fintech

Yimu Ji
Weiheng Gu
Fei Chen
Xiaoying Xiao
Jing Sun
Shangdong Liu
Jing He
Yunyao Li

The traditional blockchain has the shortcoming that a single-chain can only deal with one or a few specific data types. The research question of how to make blockchain be able to deal with various data types has not been well studied. In this paper, we propose a single-chain based extension model of blockchain for fintech (SEBF). In the financial environment, we design a four-layer architecture for this model. By employing the external trusted or-acle group and a financial regulator agency, a variety types of data can be effectively stored in the blockchain, such that the data type extension based on a single-chain is realized. The experimental results indicate that the proposed model can improve the efficiency of simplified payment verifi-cation.

PDF Details DOI

IJCAI Conference 2017 Conference Paper

Category-aware Next Point-of-Interest Recommendation via Listwise Bayesian Personalized Ranking

Jing He
Xin Li
Lejian Liao

Next Point-of-interest (POI) recommendation has become an important task for location-based social networks (LBSNs). However, previous efforts suffer from the high computational complexity and the transition pattern between POIs has not been well studied. In this paper, we propose a two-fold approach for next POI recommendation. First, the preferred next category is predicted by using a third-rank tensor optimized by a Listwise Bayesian Personalized Ranking (LBPR) approach. Specifically we introduce two functions, namely Plackett-Luce model and cross entropy, to generate the likelihood of ranking list for posterior computation. Then POI candidates filtered by the predicated category are ranked based on the spatial influence and category ranking influence. Extensive experiments on two real-world datasets demonstrate the significant improvements of our methods over several state-of-the-art methods.

PDF Details

AAAI Conference 2016 Conference Paper

Inferring a Personalized Next Point-of-Interest Recommendation Model with Latent Behavior Patterns

Jing He
Xin Li
Lejian Liao
Dandan Song
William Cheung

In this paper, we address the problem of personalized next Point-of-interest (POI) recommendation which has become an important and very challenging task in location-based social networks (LBSNs), but not well studied yet. With the conjecture that, under different contextual scenario, human exhibits distinct mobility patterns, we attempt here to jointly model the next POI recommendation under the inﬂuence of user’s latent behavior pattern. We propose to adopt a third-rank tensor to model the successive check-in behaviors. By incorporating softmax function to fuse the personalized Markov chain with latent pattern, we furnish a Bayesian Personalized Ranking (BPR) approach and derive the optimization criterion accordingly. Expectation Maximization (EM) is then used to estimate the model parameters. Extensive experiments on two large-scale LB- SNs datasets demonstrate the signiﬁcant improvements of our model over several state-of-the-art methods.

PDF Details

IJCAI Conference 2016 Conference Paper

PARecommender: A Pattern-Based System for Route Recommendation

Feiyi Tang
Jia Zhu
Yang Cao
Sanli Ma
Yulong Chen
Jing He
Changqin Huang
Gansen Zhao

Widely adoption of GPS-enabled devices generates massive trajectory data every minute. The trajectory data can generate meaningful traffic patterns. In this demo, we present a system called PARecommender, which predicts traffic conditions and provides route recommendation based on generated traffic patterns. We first introduce the technical details of PARecommender, and then show several real cases that how PARecommender works.

PDF Details

AAAI Conference 2015 Conference Paper

Collaborative Topic Ranking: Leveraging Item Meta-Data for Sparsity Reduction

Weilong Yao
Jing He
Hua Wang
Yanchun Zhang
Jie Cao

Pair-wise ranking methods have been widely used in recommender systems to deal with implicit feedback. They attempt to discriminate between a handful of observed items and the large set of unobserved items. In these approaches, however, user preferences and item characteristics cannot be estimated reliably due to overfitting given highly sparse data. To alleviate this problem, in this paper, we propose a novel hierarchical Bayesian framework which incorporates “bag-ofwords” type meta-data on items into pair-wise ranking models for one-class collaborative filtering. The main idea of our method lies in extending the pair-wise ranking with a probabilistic topic modeling. Instead of regularizing item factors through a zero-mean Gaussian prior, our method introduces item-specific topic proportions as priors for item factors. As a by-product, interpretable latent factors for users and items may help explain recommendations in some applications. We conduct an experimental study on a real and publicly available dataset, and the results show that our algorithm is effective in providing accurate recommendation and interpreting user factors and item factors.

PDF Details

AAAI Conference 2012 Conference Paper

Generating Chinese Classical Poems with Statistical Machine Translation Models

Jing He
Ming Zhou
Long Jiang

This paper describes a statistical approach to generation of Chinese classical poetry and proposes a novel method to automatically evaluate poems. The system accepts a set of keywords representing the writing intents from a writer and generates sentences one by one to form a completed poem. A statistical machine translation (SMT) system is applied to generate new sentences, given the sentences generated previously. For each line of sentence a specific model specially trained for that line is used, as opposed to using a single model for all sentences. To enhance the coherence of sentences on every line, a coherence model using mutual information is applied to select candidates with better consistency with previous sentences. In addition, we demonstrate the effectiveness of the BLEU metric for evaluation with a novel method of generating diverse references.

PDF Details