Li Shang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Li Shang has a total of 108 co-authors. Here are the top co-authors by number of shared publications:
- Ning Gu
Fudan University, Shanghai, China
23 shared publications - Tun Lu
Fudan University, Shanghai, China
23 shared publications - Dongsheng Li
PDL Lab, College of Computer Science and Technology, National University of Defense Technology, Changsha, Hunan, China
19 shared publications - Hansu Gu
Amazon, Seattle, Washington, USA
17 shared publications - Fan Yang
School of Microelectronics, Fudan University
15 shared publications - Peng Zhang
Fudan University, Shanghai, China
14 shared publications
Latest Publications
- Open Access
- 24 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
SATLLM: A Sparsity-aware Accelerator for Ternary-Weight Large Language Models
Large language models (LLMs) exhibit strong performance across applications, but their inference is computationally intensive, posing significant challenges for edge deployment. Quantization is among the most effective and widely used optimizations. In particular, ternary-weight quantization further lowers compute cost by replacing many multiplications with lightweight additions, thereby reducing complexity and energy. However, existing GPU/ASIC solutions often exhibit low utilization for ternary-weight LLMs and fail to exploit their inherent sparsity, leading to inefficient execution. To address this, we propose SATLLM, a lightweight accelerator optimized for ternary weights and sparsity. At the algorithm level, we propose a co-optimization method based on unstructured pruning and ternary-weight clustering to effectively enhance the sparsity. To further exploit this sparsity, we design a hardware-friendly sparsity-aware merging scheme and develop a customized BitLinear engine to support efficient sparse computation. In addition, we optimize the dataflow between the BitLinear engine and the GEMM unit, effectively alleviating performance bottlenecks caused by workload imbalance. Together, these optimizations significantly improve the throughput and energy efficiency of ternary-weight LLM inference. The experiments show that our proposed accelerator achieves an energy efficiency of 9.42 TOPS/W, with improvements of up to 42.41 ×, 16.99 ×, 4.42 ×, 2.49 ×, and 1.90 × compared to NVIDIA V100, A100, ANT, MECLA, and RMFA, respectively.
- 24 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
Open AccessSATLLM: A Sparsity-aware Accelerator for Ternary-Weight Large Language Models
Large language models (LLMs) exhibit strong performance across applications, but their inference is computationally intensive, posing significant challenges for edge deployment. Quantization is among the most effective and widely used optimizations. In particular, ternary-weight quantization further lowers compute cost by replacing many multiplications with lightweight additions, thereby reducing complexity and energy. However, existing GPU/ASIC solutions often exhibit low utilization for ternary-weight LLMs and fail to exploit their inherent sparsity, leading to inefficient execution. To address this, we propose SATLLM, a lightweight accelerator optimized for ternary weights and sparsity. At the algorithm level, we propose a co-optimization method based on unstructured pruning and ternary-weight clustering to effectively enhance the sparsity. To further exploit this sparsity, we design a hardware-friendly sparsity-aware merging scheme and develop a customized BitLinear engine to support efficient sparse computation. In addition, we optimize the dataflow between the BitLinear engine and the GEMM unit, effectively alleviating performance bottlenecks caused by workload imbalance. Together, these optimizations significantly improve the throughput and energy efficiency of ternary-weight LLM inference. The experiments show that our proposed accelerator achieves an energy efficiency of 9.42 TOPS/W, with improvements of up to 42.41 ×, 16.99 ×, 4.42 ×, 2.49 ×, and 1.90 × compared to NVIDIA V100, A100, ANT, MECLA, and RMFA, respectively.
- Open Access
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 163-173
LLM Agent-based Shilling Attack on Recommender Systems
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 163-173
Open AccessLLM Agent-based Shilling Attack on Recommender Systems
- Open Access
SD-MoE: Spectral Decomposition for Effective Expert Specialization
Mixture-of-Experts (MoE) architectures scale Large Language Models via expert specialization induced by conditional computation. In practice, however, expert specialization often fails: some experts become functionally similar, while others functioning as de facto shared experts, limiting the effective capacity and model performance. In this work, we analysis from a spectral perspective on parameter and gradient spaces, uncover that (1) experts share highly overlapping dominant spectral components in their parameters, (2) dominant gradient subspaces are strongly aligned across experts, driven by ubiquitous low-rank structure in human corpus, and (3) gating mechanisms preferentially route inputs along these dominant directions, further limiting specialization. To address this, we propose Spectral-Decoupled MoE (SD-MoE), which decomposes both parameter and gradient in the spectral space. SD-MoE improves performance across downstream tasks, enables effective expert specialization, incurring minimal additional computation, and can be seamlessly integrated into a wide range of existing MoE architectures, including Qwen and DeepSeek.
Open AccessSD-MoE: Spectral Decomposition for Effective Expert Specialization
Mixture-of-Experts (MoE) architectures scale Large Language Models via expert specialization induced by conditional computation. In practice, however, expert specialization often fails: some experts become functionally similar, while others functioning as de facto shared experts, limiting the effective capacity and model performance. In this work, we analysis from a spectral perspective on parameter and gradient spaces, uncover that (1) experts share highly overlapping dominant spectral components in their parameters, (2) dominant gradient subspaces are strongly aligned across experts, driven by ubiquitous low-rank structure in human corpus, and (3) gating mechanisms preferentially route inputs along these dominant directions, further limiting specialization. To address this, we propose Spectral-Decoupled MoE (SD-MoE), which decomposes both parameter and gradient in the spectral space. SD-MoE improves performance across downstream tasks, enables effective expert specialization, incurring minimal additional computation, and can be seamlessly integrated into a wide range of existing MoE architectures, including Qwen and DeepSeek.
- Open Access
Multi-Head Attention as a Source of Catastrophic Forgetting in MoE Transformers
Mixture-of-Experts (MoE) architectures are often considered a natural fit for continual learning because sparse routing should localize updates and reduce interference, yet MoE Transformers still forget substantially even with sparse, well-balanced expert utilization. We attribute this gap to a pre-routing bottleneck: multi-head attention concatenates head-specific signals into a single post-attention router input, forcing routing to act on co-occurring feature compositions rather than separable head channels. We show that this router input simultaneously encodes multiple separately decodable semantic and structural factors with uneven head support, and that different feature compositions induce weakly aligned parameter-gradient directions; as a result, routing maps many distinct compositions to the same route. We quantify this collision effect via a route-wise effective composition number $N_{eff}$ and find that higher $N_{eff}$ is associated with larger old-task loss increases after continual training. Motivated by these findings, we propose MH-MoE, which performs head-wise routing over sub-representations to increase routing granularity and reduce composition collisions. On TRACE with Qwen3-0.6B/8B, MH-MoE effectively mitigates forgetting, reducing BWT on Qwen3-0.6B from 11.2% (LoRAMoE) to 4.5%.Open AccessMulti-Head Attention as a Source of Catastrophic Forgetting in MoE Transformers
Mixture-of-Experts (MoE) architectures are often considered a natural fit for continual learning because sparse routing should localize updates and reduce interference, yet MoE Transformers still forget substantially even with sparse, well-balanced expert utilization. We attribute this gap to a pre-routing bottleneck: multi-head attention concatenates head-specific signals into a single post-attention router input, forcing routing to act on co-occurring feature compositions rather than separable head channels. We show that this router input simultaneously encodes multiple separately decodable semantic and structural factors with uneven head support, and that different feature compositions induce weakly aligned parameter-gradient directions; as a result, routing maps many distinct compositions to the same route. We quantify this collision effect via a route-wise effective composition number $N_{eff}$ and find that higher $N_{eff}$ is associated with larger old-task loss increases after continual training. Motivated by these findings, we propose MH-MoE, which performs head-wise routing over sub-representations to increase routing granularity and reduce composition collisions. On TRACE with Qwen3-0.6B/8B, MH-MoE effectively mitigates forgetting, reducing BWT on Qwen3-0.6B from 11.2% (LoRAMoE) to 4.5%. - Open Access
- 17 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 31 (2) , 1-26
ChatArch: A Knowledge-driven Graph-of-thought LLM Framework for Processor Architecture Optimization
Processors serve as the cornerstone of modern computing systems. Although processor design encompasses multiple VLSI levels, the architectural design plays a critical role in determining performance, power consumption, and area efficiency. To address the growing pressure to shorten chip time-to-market, there is an increasing demand for rapid iteration methods in processor architecture development. To achieve efficient and effortless architecture design optimization, we develop ChatArch, a knowledge-driven graph-of-thought multi-LLM-agent framework for processor architecture optimization. Based on processor architecture expertise, we decompose the processor architecture design space and construct an LLM agent graph-of-thought framework to characterize and iteratively optimize these subspaces. Also, by systematically consolidating domain-specific knowledge and empirical design principles validated by experts, we establish a comprehensive RISC-V processor design knowledge repository. Moreover, a knowledge-driven multi-agent framework is developed to enable efficient microarchitecture optimization. Finally, the optimized microarchitecture modules aggregate to form system-level designs. This methodology achieves automated iterative optimization of microarchitectures targeting PPA objectives while generating corresponding behavioral models. The experiments demonstrate that our method effectively designs behavioral processor models, with LLM-generated architectures achieving a validation success rate of over 97.39%, surpassing the performance of other LLMs, including GPT-4o. ChatArch consistently meets requirements, delivering up to 9.97% times better PPA and 32–68x efficiency gains compared with traditional black-box optimization methods.
- 17 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 31 (2) , 1-26
Open AccessChatArch: A Knowledge-driven Graph-of-thought LLM Framework for Processor Architecture Optimization
Processors serve as the cornerstone of modern computing systems. Although processor design encompasses multiple VLSI levels, the architectural design plays a critical role in determining performance, power consumption, and area efficiency. To address the growing pressure to shorten chip time-to-market, there is an increasing demand for rapid iteration methods in processor architecture development. To achieve efficient and effortless architecture design optimization, we develop ChatArch, a knowledge-driven graph-of-thought multi-LLM-agent framework for processor architecture optimization. Based on processor architecture expertise, we decompose the processor architecture design space and construct an LLM agent graph-of-thought framework to characterize and iteratively optimize these subspaces. Also, by systematically consolidating domain-specific knowledge and empirical design principles validated by experts, we establish a comprehensive RISC-V processor design knowledge repository. Moreover, a knowledge-driven multi-agent framework is developed to enable efficient microarchitecture optimization. Finally, the optimized microarchitecture modules aggregate to form system-level designs. This methodology achieves automated iterative optimization of microarchitectures targeting PPA objectives while generating corresponding behavioral models. The experiments demonstrate that our method effectively designs behavioral processor models, with LLM-generated architectures achieving a validation success rate of over 97.39%, surpassing the performance of other LLMs, including GPT-4o. ChatArch consistently meets requirements, delivering up to 9.97% times better PPA and 32–68x efficiency gains compared with traditional black-box optimization methods.
- Open Access
- 15 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (1) , 1-42
RECOSIM: A Universal, Accurate, and Scalable Simulation Framework for Online Community Recommendations
As recommender systems become increasingly important components in online communities, studying their impact on these communities becomes ever more crucial. Facing the high costs and ethical risks of real-world social experiments, researchers construct recommendation simulators to study the interactions between recommender systems and users. However, existing simulators face challenges in providing universal, accurate, and scalable interaction modeling for various types of online communities involving millions of contents and users with diverse action types. To address these challenges, we propose RECOSIM, a simulation framework capable of offering efficient recommendation interaction simulations across a wide range of scenarios. RECOSIM decomposes the user agent into five fundamental modules: Encode Model, Decode Model, Activity Model, Scoring Model, and Generation Model, allowing for accurate and extensible modeling of user behavior and interaction dynamics. The recommender system agent adheres to established industry architectures, implementing three stages and four fundamental strategies, thereby improving generalizability across various platforms and the computational efficiency of simulation. Utilizing two real-world datasets (Weibo and Zhihu), we validate the accuracy and stability of each component and the overall framework of RECOSIM, demonstrating the reliability of RECOSIM as a simulation environment. Subsequently, we delve into analyzing the impact of the four fundamental recommendation strategies on online communities, providing design inspirations for enhancing user engagement and community growth.
- 15 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (1) , 1-42
Open AccessRECOSIM: A Universal, Accurate, and Scalable Simulation Framework for Online Community Recommendations
As recommender systems become increasingly important components in online communities, studying their impact on these communities becomes ever more crucial. Facing the high costs and ethical risks of real-world social experiments, researchers construct recommendation simulators to study the interactions between recommender systems and users. However, existing simulators face challenges in providing universal, accurate, and scalable interaction modeling for various types of online communities involving millions of contents and users with diverse action types. To address these challenges, we propose RECOSIM, a simulation framework capable of offering efficient recommendation interaction simulations across a wide range of scenarios. RECOSIM decomposes the user agent into five fundamental modules: Encode Model, Decode Model, Activity Model, Scoring Model, and Generation Model, allowing for accurate and extensible modeling of user behavior and interaction dynamics. The recommender system agent adheres to established industry architectures, implementing three stages and four fundamental strategies, thereby improving generalizability across various platforms and the computational efficiency of simulation. Utilizing two real-world datasets (Weibo and Zhihu), we validate the accuracy and stability of each component and the overall framework of RECOSIM, demonstrating the reliability of RECOSIM as a simulation environment. Subsequently, we delve into analyzing the impact of the four fundamental recommendation strategies on online communities, providing design inspirations for enhancing user engagement and community growth.
- Open Access
- 2 December 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies
- Vol. 9 (4) , 1-33
ActiveEye: Enabling Continuous and Responsive Video Understanding for Smart Eyewear Systems
Integrating vision-language models (VLMs) with wearable devices offers great potential for continuous and responsive video understanding, a key capability for applications such as smart eyewear-based conversational assistants. However, achieving this on resource-constrained devices is challenging due to the high energy demands of continuous spatial-temporal sampling and transmission. We propose ActiveEye , a VLM designed for energy-efficient and responsive video understanding. ActiveEye separates visual and motion semantic representations and incorporates an active perception-based feedback path to adaptively adjust spatial-temporal sampling and transmission rates. Implemented as a wearable-mobile-cloud system, ActiveEye is evaluated for energy efficiency, real-time semantic change detection, and video understanding in both laboratory and field studies. Using the EgoSchema dataset, ActiveEye reduces the front-end energy consumption by 49.14%, supporting 8.37 hours of continuous operation on a 2.1 Wh battery. It achieves the highest F1 score (0.80) and the lowest average time difference (1.30 s) compared with heuristic-based event detection algorithms, validating its timely semantic detection. Furthermore, ActiveEye achieves a visual question answering (VQA) accuracy of 61.6%, which is comparable to state-of-the-art VLM agents, despite their reliance on larger language decoders and more computationally intensive frame selection strategies. Two rounds of in-field user evaluations further confirm its effectiveness in real-world settings, demonstrating its practical viability as a continuous and responsive video understanding system, conversational assistant, and wearable companion.
- 2 December 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies
- Vol. 9 (4) , 1-33
Open AccessActiveEye: Enabling Continuous and Responsive Video Understanding for Smart Eyewear Systems
Integrating vision-language models (VLMs) with wearable devices offers great potential for continuous and responsive video understanding, a key capability for applications such as smart eyewear-based conversational assistants. However, achieving this on resource-constrained devices is challenging due to the high energy demands of continuous spatial-temporal sampling and transmission. We propose ActiveEye , a VLM designed for energy-efficient and responsive video understanding. ActiveEye separates visual and motion semantic representations and incorporates an active perception-based feedback path to adaptively adjust spatial-temporal sampling and transmission rates. Implemented as a wearable-mobile-cloud system, ActiveEye is evaluated for energy efficiency, real-time semantic change detection, and video understanding in both laboratory and field studies. Using the EgoSchema dataset, ActiveEye reduces the front-end energy consumption by 49.14%, supporting 8.37 hours of continuous operation on a 2.1 Wh battery. It achieves the highest F1 score (0.80) and the lowest average time difference (1.30 s) compared with heuristic-based event detection algorithms, validating its timely semantic detection. Furthermore, ActiveEye achieves a visual question answering (VQA) accuracy of 61.6%, which is comparable to state-of-the-art VLM agents, despite their reliance on larger language decoders and more computationally intensive frame selection strategies. Two rounds of in-field user evaluations further confirm its effectiveness in real-world settings, demonstrating its practical viability as a continuous and responsive video understanding system, conversational assistant, and wearable companion.
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2566-2571
AgentCF++: Memory-enhanced LLM-based Agents for Popularity-aware Cross-domain Recommendations
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2566-2571
Open AccessAgentCF++: Memory-enhanced LLM-based Agents for Popularity-aware Cross-domain Recommendations
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2560-2565
Improving LLM-powered Recommendations with Personalized Information
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2560-2565
Open AccessImproving LLM-powered Recommendations with Personalized Information
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2555-2559
Unbiased Collaborative Filtering with Fair Sampling
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2555-2559
Open AccessUnbiased Collaborative Filtering with Fair Sampling