Arrow Research search

Author name cluster

Jing Fan

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.

10 papers
2 author rows

Possible papers

10

AAAI Conference 2026 Conference Paper

DS-ATGO: Dual-Stage Synergistic Learning via Forward Adaptive Threshold and Backward Gradient Optimization for Spiking Neural Networks

  • Jiaqiang Jiang
  • Wenfeng Xu
  • Jing Fan
  • Rui Yan

Brain-inspired spiking neural networks (SNNs) are recognized as a promising avenue for achieving efficient, low-energy neuromorphic computing. Direct training of SNNs typically relies on surrogate gradient (SG) learning to estimate derivatives of non-differentiable spiking activity. However, during training, the distribution of neuronal membrane potentials varies across timesteps and progressively deviates toward both sides of the firing threshold. When the firing threshold and SG remain fixed, this may lead to imbalanced spike firing and diminished gradient signals, preventing SNNs from performing well. To address these issues, we propose a novel dual-stage synergistic learning algorithm that achieves forward adaptive thresholding and backward dynamic SG. In forward propagation, we adaptively adjust thresholds based on the distribution of membrane potential dynamics (MPD) at each timestep, which enriches neuronal diversity and effectively balances firing rates across timesteps and layers. In backward propagation, drawing from the underlying association between MPD, threshold, and SG, we dynamically optimize SG to enhance gradient estimation through spatio-temporal alignment, effectively mitigating gradient information loss. Experimental results demonstrate that our method achieves significant performance improvements. Moreover, it allows neurons to fire stable proportions of spikes at each timestep and increases the proportion of neurons that obtain gradients in deeper layers.

IJCAI Conference 2025 Conference Paper

Adaptive Gradient Learning for Spiking Neural Networks by Exploiting Membrane Potential Dynamics

  • Jiaqiang Jiang
  • Lei Wang
  • Runhao Jiang
  • Jing Fan
  • Rui Yan

Recent advancements have focused on directly training high-performance spiking neural networks (SNNs) by estimating the approximate gradients of spiking activity through a continuous function with constant sharpness, known as surrogate gradient (SG) learning. However, as spikes propagate within neurons and among layers, the distribution of membrane potential dynamics (MPD) will deviate from the gradient-available interval of fixed SG, hindering SNNs from searching the optimal solution space. To maintain the stability of gradient flows, SG needs to align with evolving MPD. Here, we propose a novel adaptive gradient learning for SNNs by exploiting MPD, namely MPD-AGL. It fully accounts for the underlying factors contributing to membrane potential shifts and establishes a dynamic association between SG and MPD at different timesteps to relax gradient estimation, which provides a new degree of freedom for SG learning. Experimental results demonstrate that our method achieves excellent performance at low latency. Moreover, it increases the proportion of neurons that fall into the gradient-available interval compared to fixed SG, effectively mitigating the gradient vanishing problem. Code is available at https: //github. com/jqjiang1999/MPD-AGL.

TIST Journal 2023 Journal Article

Multi-aspect Understanding with Cooperative Graph Attention Networks for Medical Dialogue Information Extraction

  • Rui Lin
  • Jing Fan
  • Haifeng Wu

Medical dialogue information extraction is an important but challenging task for Electronic Medical Records. Existing medical information extraction methods ignore the crucial information of sentence and multi-level dependency in dialogue, which limits their effectiveness for capturing essential medical information. To address these issues, we present a novel Multi-aspect Understanding with Cooperative Graph Attention Networks for Medical Dialogue Information Extraction to capture multi-aspect sentence information and multi-level dependency information from the dialogue. First, we propose the multi-aspect sentence encoder to capture various features from different perspectives. Second, we propose double graph attention networks to model the dependency features from intra-window and inter-window, respectively. Extensive experiments on a benchmark dataset have well-validated the effectiveness of the proposed method.

MFCS Conference 2022 Conference Paper

Approximation Algorithms for Covering Vertices by Long Paths

  • Mingyang Gong
  • Jing Fan
  • Guohui Lin
  • Eiji Miyano

Given a graph, the general problem to cover the maximum number of vertices by a collection of vertex-disjoint long paths seemingly escapes from the literature. A path containing at least k vertices is considered long. When k ≤ 3, the problem is polynomial time solvable; when k is the total number of vertices, the problem reduces to the Hamiltonian path problem, which is NP-complete. For a fixed k ≥ 4, the problem is NP-hard and the best known approximation algorithm for the weighted set packing problem implies a k-approximation algorithm. To the best of our knowledge, there is no approximation algorithm directly designed for the general problem; when k = 4, the problem admits a 4-approximation algorithm which was presented recently. We propose the first (0. 4394 k + O(1))-approximation algorithm for the general problem and an improved 2-approximation algorithm when k = 4. Both algorithms are based on local improvement, and their performance analyses are done via amortization.

ICLR Conference 2022 Conference Paper

Improving the Accuracy of Learning Example Weights for Imbalance Classification

  • Yuqi Liu 0002
  • Bin Cao 0004
  • Jing Fan

To solve the imbalance classification, methods of weighting examples have been proposed. Recent work has studied to assign adaptive weights to training examples through learning mechanisms, that is, the weights, similar to classification models, are regarded as parameters that need to be learned. However, the algorithms in recent work use local information to approximately optimize the weights, which may lead to inaccurate learning of the weights. In this work, we first propose a novel mechanism of learning with a constraint, which can accurately train the weights and model. Then, we propose a combined method of our learning mechanism and the work by Hu et al., which can promote each other to perform better. Our proposed method can be applied to any type of deep network model. Experiments show that compared with the state-of-the-art algorithms, our method has significant improvement in varieties of settings, including text and image classification over different imbalance ratios, binary and multi-class classification.

TIST Journal 2021 Journal Article

TLDS: A Transfer-Learning-Based Delivery Station Location Selection Pipeline

  • Chenyu Hou
  • Bin Cao
  • Sijie Ruan
  • Jing Fan

Delivery stations play important roles in logistics systems. Well-designed delivery station planning can improve delivery efficiency significantly. However, existing delivery station locations are decided by experts, which requires much preliminary research and data collection work. It is not only time consuming but also expensive for logistics companies. Therefore, in this article, we propose a data-driven pipeline that can transfer expert knowledge among cities and automatically allocate delivery stations. Based on existing well-designed station location planning in the source city, we first train a model to learn the expert knowledge about delivery range selection for each station. Then we transfer the learned knowledge to a new city and design three strategies to select delivery stations for the new city. Due to the differences in characteristics among different cities, we adopt a transfer learning method to eliminate the domain difference so that the model can be adapted to a new city well. Finally, we conduct extensive experiments based on real-world datasets and find the proposed method can solve the problem well.

EAAI Journal 2019 Journal Article

Workflow difference detection based on basis paths

  • Bin Cao
  • Feng Hong
  • Jiaxing Wang
  • Jing Fan
  • Mingqi Lv

Detecting workflow difference is meaningful for many applications, e. g. , in-vehicle system testing. However, current workflow difference detection methods stress on structural differences while ignoring the behavioral aspects of the workflow models. Due to the large number of possible behaviors for a workflow model, it is challenging to detect the behavioral difference. To address this problem, this paper introduces the idea of basis path testing from the software testing field, and presents an efficient method for detecting the workflow difference in terms of their behaviors. First, we compute the cyclomatic complexity according to the number of nodes and arcs in the workflow model. Then, based on the cyclomatic complexity we design an algorithm that can retrieve the basis paths from a tree structure converted from the workflow model. At last, the Kuhn–Munkres (KM) algorithm is used to map the independent paths from two workflow models and generate the optimal mapping that the overall distance is the minimum. The experimental evaluation shows that our proposed method has been proved feasible in terms of both efficiency and effectiveness.

TCS Journal 2015 Journal Article

Integrated scheduling of production and delivery on a single machine with availability constraint

  • Jing Fan
  • Xiwen Lu
  • Peihai Liu

We study the problem of integrated scheduling of production and delivery on a single machine. Because of the availability constraint of the machine, jobs in processing may be interrupted. When the machine becomes available again, the job interrupted can resume or restart processing. The completed jobs are delivered in batches to one customer by vehicles without capacity constraint. The goal is to minimize the sum of total delivery time and total delivery cost. If the interrupted job is resumable, we provide an optimal algorithm with polynomial time. If the interrupted job is non-resumable, we propose an algorithm with the worst-case performance ratio 3/2. Moreover, we show that the problem has a polynomial time approximation scheme (PTAS).

YNIMG Journal 2012 Journal Article

A quantitative analytic pipeline for evaluating neuronal activities by high‐throughput synaptic vesicle imaging

  • Jing Fan
  • Xiaofeng Xia
  • Ying Li
  • Jennifer G. Dy
  • Stephen T.C. Wong

Synaptic vesicle dynamics play an important role in the study of neuronal and synaptic activities of neurodegradation diseases ranging from the epidemic Alzheimer's disease to the rare Rett syndrome. A high-throughput assay with a large population of neurons would be useful and efficient to characterize neuronal activity based on the dynamics of synaptic vesicles for the study of mechanisms or to discover drug candidates for neurodegenerative and neurodevelopmental disorders. However, the massive amounts of image data generated via high‐throughput screening require enormous manual processing time and effort, restricting the practical use of such an assay. This paper presents an automated analytic system to process and interpret the huge data set generated by such assays. Our system enables the automated detection, segmentation, quantification, and measurement of neuron activities based on the synaptic vesicle assay. To overcome challenges such as noisy background, inhomogeneity, and tiny object size, we first employ MSVST (Multi-Scale Variance Stabilizing Transform) to obtain a denoised and enhanced map of the original image data. Then, we propose an adaptive thresholding strategy to solve the inhomogeneity issue, based on the local information, and to accurately segment synaptic vesicles. We design algorithms to address the issue of tiny objects of interest overlapping. Several post processing criteria are defined to filter false positives. A total of 152 features are extracted for each detected vesicle. A score is defined for each synaptic vesicle image to quantify the neuron activity. We also compare the unsupervised strategy with the supervised method. Our experiments on hippocampal neuron assays showed that the proposed system can automatically detect vesicles and quantify their dynamics for evaluating neuron activities. The availability of such an automated system will open opportunities for investigation of synaptic neuropathology and identification of candidate therapeutics for neurodegeneration.

v2026.09.13