Arrow Research search

Author name cluster

Ping Gong

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.

4 papers
1 author row

Possible papers

4

AAAI Conference 2026 Conference Paper

SMIDT: High-Performance Inference Framework for MoE Models with Dynamic Top-K Routing

  • Zewen Jin
  • Shen Fu
  • Chengjie Tang
  • Youhui Bai
  • Shengnan Wang
  • Jiaan Zhu
  • Chizheng Fang
  • Ping Gong

To accelerate Mixture-of-Experts (MoE) inference, the hybrid parallelism paradigm is first applying pipeline parallelism (PP) to vertically divide the model into stages, with each stage further divided horizontally using tensor or expert parallelism. On the algorithm side, dynamic Top-K routing reduces computation by activating fewer experts per token on average. In this paper, we explore the application of dynamic Top-K routing to PP-enabled MoE inference, aiming to fully unleash their combined potential. We identify key performance bottlenecks arising from Top-K value variation across layers, which conflicts with PP's typically uniform stage partitioning, as well as opportunities to optimize memory usage through their integration. To address these challenges, we present SMIDT, an efficient MoE inference framework tailored for dynamic Top-K routing. SMIDT features: (1) an adaptive, module-level uneven partitioning strategy to balance computation across PP stages, (2) a memory-aware expert replication scheme (DPMoE) that reduces communication overhead, and (3) a lightweight search algorithm combining binary search and dynamic programming to generate efficient parallelism plans. We implement SMIDT on SGLang, a state-of-the-art LLM inference framework, evaluate it on 32 A40 GPUs and 16 A100 GPUs, and compare with manually tuned parallelism strategies. Experimental results show that, when co-locating prefill and decoding phases, SMIDT achieves 1.20–3.13x throughput improvements for prefill-only tasks and 1.05–1.89x for prefill-decoding tasks. When disaggregating prefill and decoding tasks, SMIDT improves average and P99 time-to-first-token (TTFT) by 1.10–1.17x and 1.21–1.26x, respectively.

EAAI Journal 2023 Journal Article

ITran: A novel transformer-based approach for industrial anomaly detection and localization

  • Xiangyu Cai
  • Ruliang Xiao
  • Zhixia Zeng
  • Ping Gong
  • Youcong Ni

Anomaly detection is currently an essential quality monitoring process in industrial production. It is often affected by factors such as under or over reconstruction of images and unclear criteria for feature distribution evaluation, thus making it challenging to improve detection performance. To solve the above problems, this paper proposes a novel transformer-based approach, Inductive Transformer (ITran) for industrial anomaly detection and localization, which utilizes a multi-layer pyramid structure and multi-level jump connections to extract multi-scale features of the data, putting the anomaly detection into the feature space and achieving more accurate industrial anomaly detection and localization results. It incorporates inductive bias and convolution operations into the Transformer which helps to break the myth of Transformer being “data hungry”. Compared with the common Transformers, ITran significantly reduces the computational cost and memory usage and makes it work well on small datasets. In addition, we basically eliminate the effect of positional embedding on the proposed Transformer model. Sufficient experiments have been conducted to validate global anomaly detection on three datasets MNIST, Fashion-MNST and Cifar-10, as well as local anomaly detection on the industrial datasets MVTec AD, Concrete Crack Image and BTAD. The proposed ITran achieves outstanding results on all the above datasets.

YNIMG Journal 2020 Journal Article

Changes in spinal cord hemodynamics reflect modulation of spinal network with different parameters of epidural stimulation

  • Shanshan Tang
  • Carlos A. Cuellar
  • Pengfei Song
  • Riazul Islam
  • Chengwu Huang
  • Hai Wen
  • Bruce E. Knudsen
  • Ping Gong

In this study functional ultrasound (fUS) imaging has been implemented to explore the local hemodynamics response induced by electrical epidural stimulation and to study real-time in vivo functional changes of the spinal cord, taking advantage of the superior spatiotemporal resolution provided by fUS. By quantifying the hemodynamics and electromyographic response features, we tested the hypothesis that the temporal hemodynamics response of the spinal cord to electrical epidural stimulation could reflect modulation of the spinal circuitry and accordingly respond to the changes in parameters of electrical stimulation. The results of this study for the first time demonstrate that the hemodynamics response to electrical stimulation could reflect a neural-vascular coupling of the spinal cord. Response in the dorsal areas to epidural stimulation was significantly higher and faster compared to the response in ventral spinal cord. Positive relation between the hemodynamics and the EMG responses was observed at the lower frequencies of epidural stimulation (20 and 40 Hz), which according to our previous findings can facilitate spinal circuitry after spinal cord injury, compared to higher frequencies (200 and 500 Hz). These findings suggest that different mechanisms could be involved in spinal cord hemodynamics changes during different parameters of electrical stimulation and for the first time provide the evidence that neural-vascular coupling of the spinal cord circuitry could be related to specific organization of spinal cord vasculature and hemodynamics.

I&C Journal 2020 Journal Article

Event-based functional decomposition

  • Jian-Min Jiang
  • Huibiao Zhu
  • Qin Li
  • Yongxin Zhao
  • Shi Zhang
  • Ping Gong
  • Zhong Hong

Functional decomposition is the process of resolving a functional relationship into its constituent parts in such a way that the original function can be recomposed from those parts by functional composition. Perfect decomposition requires the obtained constituent parts to be non-interacting components and easier to conceive, understand, program, and maintain. However, how to decompose a complex system and ensure the correctness of such a decomposition approach usually relies on some informal principles. In this paper, we present a new and automatic decomposition approach for functionalities. We first show the correctness of the functional decomposition in terms of weakly termination in theory and then discuss the automation method of the functional decomposition. The approach can automatically decompose a system into independent subsystems which may be independently developed and deployed. Finally, we develop an algorithm. A case study demonstrates these results.

v2026.09.13