Zhengbang Yang

dblp:343/8793 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
6since 2021 · last 2026
0009-0006-5228-7009ORCID · reported

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

Systems, architecture and hardware · 4 · 2 first-author · 4 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021
YearPublicationVenuePosition
2026 Thunder: Efficient Multi-node FHE Acceleration Framework via In-Transit Computation
Lutan Zhao, Qingyun Niu, Yinhang Zheng, Zhengbang Yang, Boyan Zhao, Rui Hou 0001
Euro-Par (1)5
2026 OmniZK: A Versatile Accelerator Architecture for Zero-Knowledge Proofs
Zhengbang Yang, Lutan Zhao, Rui Hou 0001
Euro-Par (1)1
2025 LegoZK: A Dynamically Reconfigurable Accelerator for Zero-Knowledge Proof
abstract
Zero-knowledge proof (ZKP) allows a prover to convince a verifier of the truth of a statement without revealing any secret information. This property is utilized in numerous privacy-preserving applications. However, the huge overhead of proof generation impedes the widespread adoption of ZKP. As a result, many ZKP accelerators have been developed to speed up proof generation. However, existing accelerators are designed at the granularity of core operators and exhibit low hardware resource utilization and limited adaptability. In this paper, we identify the commonality of all computation stages in proof generation at the level of basic finite field arithmetic operations. Based on this insight, we propose LegoZK, a dynamically reconfigurable hardware accelerator for ZKP. LegoZK employs finite field arithmetic units (FAUs) as its fundamental components and integrates these FAUs with a hierarchical on-chip network (NoC). By dynamically configuring the FAUs and the NoC, LegoZK can effectively accelerate the entire proof generation process, achieving higher overall performance. Additionally, for the most time-consuming MSM, this paper proposes a fast, fully pipelined bucket reduction algorithm based on lookup tables, which significantly reduces the latency of MSM. Experimental results demonstrate that LegoZK achieves on average speedup of $31.96 \times$ and $11.30 \times$ in proof generation compared to the state-of-the-art ZKP ASIC accelerator PipeZK and the GPU accelerator GZKP, respectively. And compared to PipeZK, LegoZK achieves $\mathbf{5 0. 1 \%}$ area reduction and $\mathbf{3 7. 7 \%}$ power consumption reduction.
Zhengbang Yang, Lutan Zhao, Peinan Li, Boyan Zhao, Dan Meng 0002, Rui Hou 0001
HPCA1
2025 SPORTU: A Comprehensive Sports Understanding Benchmark for Multimodal Large Language Models
abstract
Multimodal Large Language Models (MLLMs) are advancing the ability to reason about complex sports scenarios by integrating textual and visual information. To comprehensively evaluate their capabilities, we introduce SPORTU, a benchmark designed to assess MLLMs across multi-level sports reasoning tasks. SPORTU comprises two key components: SPORTU-text, featuring 900 multiple-choice questions with human-annotated explanations for rule comprehension and strategy understanding. This component focuses on testing models' ability to reason about sports solely through question-answering (QA), without requiring visual inputs; SPORTU-video, consisting of 1,701 slow-motion video clips across 7 different sports and 12,048 QA pairs, designed to assess multi-level reasoning, from simple sports recognition to complex tasks like foul detection and rule application. We evaluated four prevalent LLMs mainly utilizing few-shot learning paradigms supplemented by chain-of-thought (CoT) prompting on the SPORTU-text part. GPT-4o achieves the highest accuracy of 71\%, but still falls short of human-level performance, highlighting room for improvement in rule comprehension and reasoning. The evaluation for the SPORTU-video part includes 6 proprietary and 8 open-source MLLMs. Experiments show that models fall short on hard tasks that require deep reasoning and rule-based understanding. GPT-4o performs the best with only 57.8\% accuracy on the hard task, showing large room for improvement. We hope that SPORTU will serve as a critical step toward evaluating models' capabilities in sports understanding and reasoning. The dataset is available at [https://github.com/chili-lab/SPORTU](https://github.com/chili-lab/SPORTU).
Haotian Xia, Zhengbang Yang, Junbo Zou, Rhys Tracy, Yuqing Wang 0004, Christopher Lai, Yanjun He, Xun Shao, Zhuoqing Xie, Yuan-Fang Wang, Weining Shen
ICLR2
2024 SportQA: A Benchmark for Sports Understanding in Large Language Models
abstract
Haotian Xia, Zhengbang Yang, Yuqing Wang, Rhys Tracy, Yun Zhao, Dongdong Huang, Zezhi Chen, Yan Zhu, Yuan-fang Wang, Weining Shen. Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2024.
Haotian Xia, Zhengbang Yang, Yuqing Wang 0004, Rhys Tracy, Yun Zhao 0001, Dongdong Huang, Zezhi Chen, Yuan-Fang Wang, Weining Shen
NAACL-HLT2
2022 Improving Confidence of Uncertain Knowledge Graphs by Crowdsourcing with Limited Budget
abstract
Knowledge graphs (KGs), either constructed automatically from texts or collected manually from crowdsourcing workers, may contain uncertainty. The uncertainty may propagate into the knowledge graph embedding and downstream tasks, which is potentially harmful, especially for those confidencesensitive applications such as medical diagnostic suggestion. Crowdsourcing workers with domain knowledge can help improve the data quality of knowledge graphs, by knowledge checking. However, due to the large scale of knowledge graphs and the limitation of adequate crowdsourcing workers, it is unrealistic to check all triplets in a knowledge graph to improve the data quality. Therefore, in this paper, we propose a crowdsourcing framework that efficiently improves the confidence of knowledge graphs with limited budget. We instantiate the framework in the medical domain and conduct a series of experiments with realworld medical data. We deploy the framework for knowledge graph embedding UKGE and corresponding downstream tasks. The experimental results show that the proposed method efficiently improves the quality of the knowledge graphs, and hence improves the performance of probabilistic knowledge graph embedding in the downstream tasks.
Wenxi Huang, Chenyu Xu, Zhengbang Yang, Hongxin Zhou, Fengtian Qi, Chen Zhang 0013, Kaishun Wu
ICPADS4