Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yuegui Huang

dblp:399/8930 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0001-0135-894XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Deep learning architectures and training · 68% Language models and text generation · 32%
Computer networks
1 paper
Edge and fog computing · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
GPUs and heterogeneous computing · 50% Parallel and multicore computing · 50%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › mixture of experts
mixture-of-experts inference
1.922026
Fate: Fasss sEsdge Inference of Mixture-of-Experts Models via Cross-Layer Gate · WWW 2026
Klotski: Efficient Mixture-of-Expert Inference via Expert-Aware Multi-Batch Pipeline · ASPLOS (2) 2025
Edge and fog computing
edge inference
1.012026
Fate: Fasss sEsdge Inference of Mixture-of-Experts Models via Cross-Layer Gate · WWW 2026
Edge and fog computing › edge offloading
model offloading
1.012026
Fate: Fasss sEsdge Inference of Mixture-of-Experts Models via Cross-Layer Gate · WWW 2026
Natural language and speech › Language models and text generation
large language model inference
0.912025
Klotski: Efficient Mixture-of-Expert Inference via Expert-Aware Multi-Batch Pipeline · ASPLOS (2) 2025
Parallel and multicore computing
pipeline parallelism
0.312025
Klotski: Efficient Mixture-of-Expert Inference via Expert-Aware Multi-Batch Pipeline · ASPLOS (2) 2025

Methods — techniques the papers use, named apart from their topics

quantization · 2.0expert caching · 2.0
YearPublicationVenuePosition
2026 Fate: Fasss sEsdge Inference of Mixture-of-Experts Models via Cross-Layer Gate
abstract
With the rapid growth and rising complexity of web content, edge-deployed LLMs have become essential for enhancing users' online experiences. However, sparsely-activated Mixture-of-Experts (MoE) models, which are well-suited for edge scenarios, face significant memory bottleneck challenges. Offload-based methods have been proposed to mitigate the problem, but they face difficulties with expert prediction. To promote the application of MoE models in edge scenarios, we propose Fate, an offloading system designed for MoE models to enable efficient inference in resource-constrained environments. The key insight behind Fate is that gate inputs from adjacent layers can be effectively used for expert prefetching, achieving high prediction accuracy. Furthermore, Fate employs a shallow-favoring expert caching strategy that increases the expert hit rate to 99%. Additionally, Fate integrates tailored quantization strategies for cache optimization and I/O efficiency. Experimental results show that, compared to baselines, Fate achieves up to 1.34×-5.07× prefill speedup and 1.26×-4.41× decoding speedup, while maintaining inference quality.
Zhiyuan Fang, Xingfan Yu, Yuegui Huang, Zicong Hong, Yufeng Lyu, Wuhui Chen, Yue Yu 0001, Fan Yu 0004
WWW3
2025 Klotski: Efficient Mixture-of-Expert Inference via Expert-Aware Multi-Batch Pipeline
abstract
Mixture of Experts (MoE), with its distinctive sparse structure, enables the scaling of language models up to trillions of parameters without significantly increasing computational costs. However, the substantial parameter size presents a challenge for inference, as the expansion in GPU memory cannot keep pace with the growth in parameters. Although offloading techniques utilise memory from the CPU and disk and parallelise the I/O and computation for efficiency, the computation for each expert in MoE models is often less than the I/O, resulting in numerous bubbles in the pipeline.
Zhiyuan Fang, Yuegui Huang, Zicong Hong, Yufeng Lyu, Wuhui Chen, Yue Yu 0001, Fan Yu 0004, Zibin Zheng
ASPLOS (2)2