Fan Yang

Fan Yang


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 June 2023
Verified
Conference Paper
Open access
CGCong Guo
Cong Guo
JTJiaming Tang
Jiaming Tang
WHWeiming Hu
Weiming Hu
JLJingwen Leng
Jingwen Leng
CZChen Zhang
Chen Zhang
YZYuhao Zhu
Yuhao Zhu
Transformer-based large language models (LLMs) have achieved great success with the growing model size. LLMs' size grows by 240× every two years, which outpaces the hardware progress and makes model inference increasingly costly. Model quantization is a promising approach to mitigate the widening gap between LLM size and hardware capacity. However, the existence of outliers, values with significant magnitudes, in LLMs makes existing quantization methods less effective. Prior outlier-aware quantization schemes adopt sparsity encoding techniques to separate outliers from normal values where the process requires global coordination (e.g., a global sparsity coordination list). This incurs complex encoding/decoding hardware logics and an extra orchestration controller for the computation between outlier and normal values. As such, it is not hardware-efficient and hence only achieves sub-optimal quantization benefits. We propose OliVe, an algorithm/architecture co-designed solution that adopts an outlier-victim pair (OVP) quantization and handles outlier values locally with low hardware overheads and high performance gains. The key insight of OliVe is that outliers are important while the normal values next to them are not. Thus those normal values (called victims) can be sacrificed to accommodate outliers. This enables a memory-aligned OVP encoding scheme, which can be efficiently integrated to the existing hardware accelerators like systolic array and tensor core. As a result, OliVe-based accelerator surpasses the existing outlier-aware accelerator, GOBO, by 4.5× speedup and 4.0× energy reduction, respectively, with a superior model accuracy.

23 October 2023
Verified
Conference Paper
Open access
YXYuming Xu
Yuming Xu
HLHengyu Liang
Hengyu Liang
JLJin Li
Jin Li
SXShuotao Xu
Shuotao Xu
QCQi Chen
Qi Chen
MYMao Yang
Mao Yang

24 August 2024
Verified
Conference Paper
Open access
MXMingzhe Xing
Mingzhe Xing
RZRongkai Zhang
Rongkai Zhang
HXHui Xue
Hui Xue
QCQi Chen
Qi Chen
FYFan Yang
Fan Yang
ZXZhen Xiao
Zhen Xiao
Large language models (LLMs) have empowered intelligent agents to execute intricate tasks within domain-specific software such as browsers and games. However, when applied to general-purpose software systems like operating systems, LLM agents face three primary challenges. Firstly, the action space is vast and dynamic, posing difficulties for LLM agents to maintain an up-to-date understanding and deliver accurate responses. Secondly, real-world tasks often require inter-application cooperation, demanding farsighted planning from LLM agents. Thirdly, agents need to identify optimal solutions aligning with user constraints, such as security concerns and preferences. These challenges motivate AndroidArena, an environment and benchmark designed to evaluate LLM agents on a modern operating system. To address high-cost of manpower, we design a scalable and semi-automated method to construct the benchmark. In the task evaluation, AndroidArena incorporates accurate and adaptive metrics to address the issue of non-unique solutions. Our findings reveal that even state-of-the-art LLM agents struggle in cross-APP scenarios and adhering to specific constraints. Additionally, we identify a lack of four key capabilities, i.e. understanding, reasoning, exploration, and reflection, as primary reasons for the failure of LLM agents. Furthermore, we provide empirical analysis on the failure of reflection, and improve the success rate by 27% with our proposed exploration strategy. This work is the first to present valuable insights in understanding fine-grained weakness of LLM agents, and offers a path forward for future research in this area. Environment, benchmark, prompt, and evaluation code for AndroidArena are released at https://github.com/AndroidArenaAgent/AndroidArena.

28 March 2024 in Systems Science & Control Engineering
Verified
Journal Article
Open access
DDDongyan Dai
Dongyan Dai
JLJiahui Li
Jiahui Li
YSYanhua Song
Yanhua Song
FYFan Yang
Fan Yang
1. Nowadays, wireless communication technology has been widely applied in industrial control, remote monitoring and other fields. Nevertheless, because of the complexity of the external environment...

9 October 2025 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
CYChenyuan Yang
Chenyuan Yang
XLXuheng Li
Xuheng Li
RMRakib Hossain Misu
Rakib Hossain Misu
JYJianan Yao
Jianan Yao
WCWeidong Cui
Weidong Cui
SLShan Lu
Shan Lu
Generative AI has shown its value for many software engineering tasks. Still in its infancy, large language model (LLM)-based proof generation lags behind LLM-based code generation. In this paper, we present AutoVerus. AutoVerus uses LLMs to automatically generate correctness proof for Rust code. AutoVerus is designed to match the unique features of Verus, a verification tool that can prove the correctness of Rust code using proofs and specifications also written in Rust. AutoVerus consists of a network of agents that are crafted and orchestrated to mimic human experts' three phases of proof construction: preliminary proof generation, proof refinement guided by generic tips, and proof debugging guided by verification errors. To thoroughly evaluate AutoVerus and help foster future research in this direction, we have built a benchmark suite of 150 non-trivial proof tasks, based on existing code-generation benchmarks and verification benchmarks. Our evaluation shows that AutoVerus can automatically generate correct proof for more than 90% of them, with more than half of them tackled in less than 30 seconds or 3 LLM calls.

23 October 2023
Verified
Conference Paper
Open access
NZNingxin Zheng
Ningxin Zheng
HJHuiqiang Jiang
Huiqiang Jiang
QZQuanlu Zhang
Quanlu Zhang
ZHZhenhua Han
Zhenhua Han
LMLingxiao Ma
Lingxiao Ma
LZLidong Zhou
Lidong Zhou