Dong Li
Author directoryOther people with similar names: Dong Li, Dong Li, Dong Li, Dong Li
Unverified author pages with similar names: Dong Li
2026
AMDKernelVault: Large-Scale Datasets and Agentic Training for AMD GPU Kernel Optimization
Ji Liu | Saptarshi Majumder | Yiqing Huang | Wenwen Ouyang | Umang Pandey | Zeping Li | Chushi Chen | Zihao An | Puyuan Yang | Zekai Li | Sina Rafati | Ziqiong Liu | Pratik Prabhanjan Brahma | Dong Li | Zicheng Liu | Sharon Zhou | Emad Barsoum
Findings of the Association for Computational Linguistics: EMNLP 2026
Ji Liu | Saptarshi Majumder | Yiqing Huang | Wenwen Ouyang | Umang Pandey | Zeping Li | Chushi Chen | Zihao An | Puyuan Yang | Zekai Li | Sina Rafati | Ziqiong Liu | Pratik Prabhanjan Brahma | Dong Li | Zicheng Liu | Sharon Zhou | Emad Barsoum
Findings of the Association for Computational Linguistics: EMNLP 2026
We introduce AMDKernelVault, an open corpus and training framework for optimizing HIP and Triton kernels on recent AMD CDNA GPUs. Existing LLM-based kernel agents are predominantly designed for CUDA and NVIDIA hardware and often rely on repeated calls to frontier models for generation, reflection, and optimization. To address this gap, we develop HIPKernelGen and TritonKernelGen, agent-driven pipelines that translate PyTorch references into GPU kernels, compile and validate candidates under ROCm, and profile their latency on AMD hardware. AMDKernelVault contains 62,153 execution-verified HIP kernel samples, 2,377 production-grounded ROCm Libraries QA entries, and 39,893 Triton kernels. To demonstrate the corpus’s utility, we specialize Qwen3-8B through supervised fine-tuning and execution-aware reinforcement learning. Under fixed evaluation budgets and identical agent settings, the resulting model achieves the highest correctness among the evaluated models on PyTorch-to-HIP (34.0% Pass@1), TritonBench-G (33.2% Corr@3), and ROCmBench (41.94% Corr@3), while running locally on AMD hardware. These advantages are specific to the reported correctness metrics and do not extend uniformly to compilation accuracy or execution speed. The corpus and documentation are publicly available at https://huggingface.co/datasets/amd/AIG-Datasets.
Theory-optimal Quantization Based on Flatness
Xiusheng Huang | Zhe Li | Xuanwu Yin | Lu Wang | Yequan Wang | Dong Li | Emad Barsoum | Kang Liu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Xiusheng Huang | Zhe Li | Xuanwu Yin | Lu Wang | Yequan Wang | Dong Li | Emad Barsoum | Kang Liu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Post-training quantization has emerged as a widely adopted technique for compressing and accelerating the inference of Large Language Models (LLMs). The primary challenges in LLMs quantization stem from activation outliers, which significantly degrade model performance especially at lower bit precision. While recent approaches attempt to mitigate outliers through linear transformations across feature dimensions, our analysis reveals that the transformed weights and activations still exhibit persistent outlier patterns with concentrated magnitude distributions. In this paper, we first model the mathematical relationship between quantization error and outliers, and then introduce a new metric Flatness to quantify the distribution of outliers. Based on this, we derive the theoretical optimal solution with respect to Flatness. Building on these insights, we propose Bidirectional Diagonal Quantization (BDQ), a novel post-training quantization framework that effectively disperses outlier patterns through optimized matrix transformations. BDQ strategically distributes outlier magnitudes across matrix dimensions via learned diagonal operations. Extensive experiments demonstrate that BDQ establishes a new quantization benchmark. It achieves less than 1% accuracy drop in W4A4 quantization on the LLaMA-3-8B model. In the more challenging W2A4KV16 experiment, compared to state-of-the-art approaches, BDQ reduces the performance gap by 39.1% on the DeepSeek-R1-Distill-LLaMA-70B model.
MoEC: A Memory-Routed Mixture-of-Experts Controller for Adaptive Minecraft Control
Hui Wu | Chao Xu | Jianghui Wang | Ziqiong Liu | Dong Li | Yiwei Dai | Emad Barsoum
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Hui Wu | Chao Xu | Jianghui Wang | Ziqiong Liu | Dong Li | Yiwei Dai | Emad Barsoum
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Embodied agents in open-ended environments such as Minecraft increasingly adopt planner–controller architectures, with large language models acting as high-level planners. While planning has advanced rapidly, control remains underexplored. Existing systems commonly rely on a monolithic policy to execute subgoals across varying contexts, forcing incompatible behaviors into a shared parameter space and causing interference that scaling only partially mitigates. To address this, we propose MoEC, a Memory-Routed Mixture-of-Experts Controller for Adaptive Minecraft Control. MoEC routes via a subgoal-indexed, non-parametric expert memory and regulates capacity through failure-triggered expert growth and redundancy-aware consolidation. This design enables continual adaptation without full retraining, while maintaining parameter efficiency and with bounded inference cost. We evaluate MoEC on diverse and compositional Minecraft tasks, demonstrating significant gains in adaptability, robustness, and execution consistency over strong baselines, yielding a scalable and efficient alternative for open-ended control.
2025
Amphista: Bi-directional Multi-head Decoding for Accelerating LLM Inference
Zeping Li | Xinlong Yang | Ziheng Gao | Ji Liu | Guanchen Li | Zhuang Liu | Dong Li | Jinzhang Peng | Lu Tian | Emad Barsoum
Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers)
Zeping Li | Xinlong Yang | Ziheng Gao | Ji Liu | Guanchen Li | Zhuang Liu | Dong Li | Jinzhang Peng | Lu Tian | Emad Barsoum
Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers)
Large Language Models (LLMs) inherently use autoregressive decoding, which lacks parallelism in inference and results in significantly slow inference speed. While methods such as Medusa constructs parallelized heads, they lack adequate information interaction across different prediction positions. To overcome this limitation, we introduce Amphista, an enhanced speculative decoding framework that builds upon Medusa. Specifically, Amphista models an Auto-embedding Block capable of parallel inference, incorporating bi-directional attention to enable interaction between different drafting heads. Additionally, Amphista integrates Staged Adaptation Layers, which ensure a seamless transition of semantic information from the target model’s autoregressive inference to the drafting heads’ non-autoregressive inference, effectively achieving paradigm shift and feature fusion. Experimental results on Vicuna models using MT-Bench and Spec-Bench demonstrate that Amphista achieves substantial acceleration while maintaining generation quality. On MT-Bench, Amphista delivers up to 2.75× speedup over vanilla autoregressive decoding and 1.40× over Medusa on Vicuna 33B in wall-clock time.
2024
DL-QAT: Weight-Decomposed Low-Rank Quantization-Aware Training for Large Language Models
Wenjing Ke | Zhe Li | Dong Li | Lu Tian | Emad Barsoum
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing: Industry Track
Wenjing Ke | Zhe Li | Dong Li | Lu Tian | Emad Barsoum
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing: Industry Track
Improving the efficiency of inference in Large Language Models (LLMs) is a critical area of research. Post-training Quantization (PTQ) is a popular technique, but it often faces challenges at low-bit levels, particularly in downstream tasks. Quantization-aware Training (QAT) can alleviate this problem, but it requires significantly more computational resources. To tackle this, we introduced Weight-Decomposed Low-Rank Quantization-Aware Training (DL-QAT), which merges the advantages of QAT while training only less than 1% of the total parameters. Specifically, we introduce a group-specific quantization magnitude to adjust the overall scale of each quantization group. Within each quantization group, we use LoRA matrices to update the weight size and direction in the quantization space. We validated the effectiveness of our method on the LLaMA and LLaMA2 model families. The results show significant improvements over our baseline method across different quantization granularities. For instance, for LLaMA-7B, our approach outperforms the previous state-of-the-art method by 4.2% in MMLU on 3-bit LLaMA-7B. Additionally, our quantization results on pre-trained models also surpass previous QAT methods, demonstrating the superior performance and efficiency of our approach.
Search
Fix author
Co-authors
- Emad Barsoum 5
- Zeping Li (李泽平) 2
- Zhe Li 2
- Ji Liu 2
- Ziqiong Liu 2
- Lu Tian 2
- Zihao An 1
- Pratik Prabhanjan Brahma 1
- Chushi Chen 1
- Yiwei Dai 1
- Ziheng Gao 1
- Xiusheng Huang 1
- Yiqing Huang 1
- Wenjing Ke 1
- Guanchen Li 1
- Zekai Li 1
- Kang Liu 1
- Zhuang Liu 1
- Zicheng Liu 1
- Saptarshi Majumder 1
- Wenwen Ouyang 1
- Umang Pandey 1
- Jinzhang Peng 1
- Sina Rafati 1
- Jianghui Wang 1
- Lu Wang 1
- Yequan Wang 1
- Hui Wu 1
- Chao Xu 1
- Puyuan Yang 1
- Xinlong Yang 1
- Xuanwu Yin 1
- Sharon Zhou 1