activity
20242026
most citedBingo: Radix-based Bias Factorization for Random Walk on Dynamic Graphs

2 citations · 2 across the 3 of their papers we have counts for

collaborators

8 papers

cs.CL2026

DART: Diffusion-Inspired Speculative Decoding for Fast LLM Inference

Fuliang Liu, Xue Li, Ketai Zhao +7

Speculative decoding is an effective and lossless approach for accelerating LLM inference. However, existing widely adopted model-based draft designs, such as EAGLE3, improve accur…

cs.DC2025

STAR: Decode-Phase Rescheduling for LLM Inference

Zhibin Wang, Zetao Hong, Xue Li +8

Large Language Model (LLM) inference has emerged as a fundamental paradigm, however, variations in output length cause severe workload imbalance in the decode phase, particularly f…

cs.DC2025

Accelerating Mixture-of-Experts Inference by Hiding Offloading Latency with Speculative Decoding

Zhibin Wang, Zhonghui Zhang, Yuhang Zhou +8

Recent advancements in Mixture of Experts (MoE) models have significantly increased their parameter scale as well as model performance. Extensive offloading techniques have been pr…

cs.DC2025

Chameleon: Adaptive Fault Tolerance for Distributed Training via Real-time Policy Selection

Yuhang Zhou, Zhibin Wang, Peng Jiang +12

Training large language models faces frequent interruptions due to various faults, demanding robust fault-tolerance. Existing backup-free methods, such as redundant computation, dy…

cs.LG2025

Chordless Structure: A Pathway to Simple and Expressive GNNs

Hongxu Pan, Shuxian Hu, Mo Zhou +5

Researchers have proposed various methods of incorporating more structured information into the design of Graph Neural Networks (GNNs) to enhance their expressiveness. However, the…

cs.DC20252 cited

Bingo: Radix-based Bias Factorization for Random Walk on Dynamic Graphs

Pinhuan Wang, Chengying Huan, Zhibin Wang +3

Random walks are a primary means for extracting information from large-scale graphs. While most real-world graphs are inherently dynamic, state-of-the-art random walk engines faile…