Lewei He
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lewei He has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Jiahui Pan
South China Normal University, Guangzhou, China
4 shared publications Jiahui Pan
Normal University South China
2 shared publications- Jingxing Xu
School of Software, South China Normal University, Foshan, China
2 shared publications - John Dingliana
Trinity College Dublin
2 shared publications - Lu Han
School of Engineering, Guangzhou College of Technology and Business, Guangzhou, China
2 shared publications - Mingqiang Wei
Nanjing University of Aeronautics and Astronautics, Nanjing, China
2 shared publications
Latest Publications
- 21 July 2026
- Published by Springer Nature
- p. 109-120
HMT: Hierarchical Mamba-Transformer for Efficient Long-Sequence Text Classification
- 21 July 2026
- Published by Springer Nature
- p. 109-120
HMT: Hierarchical Mamba-Transformer for Efficient Long-Sequence Text Classification
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2060-2070
Difficulty-Aware Agentic Orchestration for Query-Specific Multi-Agent Workflows
Large Language Model (LLM)-based agentic systems have shown strong capabilities across various tasks. However, existing multi-agent frameworks often rely on static or task-level workflows, which either over-process simple queries or underperform on complex ones, while also neglecting the efficiency-performance trade-offs across heterogeneous LLMs. To address these limitations, we propose Difficulty-Aware Agentic Orchestration (DAAO), which can dynamically generate query-specific multi-agent workflows guided by predicted query difficulty. DAAO comprises three interdependent modules: a variational autoencoder (VAE) for difficulty estimation, a modular operator allocator, and a cost- and performance-aware LLM router. A self-adjusting policy updates difficulty estimates based on workflow success, enabling simpler workflows for easy queries and more complex strategies for harder ones. Experiments on six benchmarks demonstrate that DAAO surpasses prior multi-agent systems in both accuracy and inference efficiency, validating its effectiveness for adaptive, difficulty-aware reasoning. Our code is open-sourced at https://github.com/AutoAgents-ai/DAAO
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2060-2070
Open AccessDifficulty-Aware Agentic Orchestration for Query-Specific Multi-Agent Workflows
Large Language Model (LLM)-based agentic systems have shown strong capabilities across various tasks. However, existing multi-agent frameworks often rely on static or task-level workflows, which either over-process simple queries or underperform on complex ones, while also neglecting the efficiency-performance trade-offs across heterogeneous LLMs. To address these limitations, we propose Difficulty-Aware Agentic Orchestration (DAAO), which can dynamically generate query-specific multi-agent workflows guided by predicted query difficulty. DAAO comprises three interdependent modules: a variational autoencoder (VAE) for difficulty estimation, a modular operator allocator, and a cost- and performance-aware LLM router. A self-adjusting policy updates difficulty estimates based on workflow success, enabling simpler workflows for easy queries and more complex strategies for harder ones. Experiments on six benchmarks demonstrate that DAAO surpasses prior multi-agent systems in both accuracy and inference efficiency, validating its effectiveness for adaptive, difficulty-aware reasoning. Our code is open-sourced at https://github.com/AutoAgents-ai/DAAO
- Open Access
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 16363-16394
VisualEDU: A Benchmark for Assessing Coding and Visual Comprehension through Educational Problem-Solving Video Generation
Hao Chen, Tianyu Shi, Pengran Huang, Zeyuan Li, Jiahui Pan, Qianglong Chen, Lewei He. Findings of the Association for Computational Linguistics: EMNLP 2025. 2025.
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 16363-16394
Open AccessVisualEDU: A Benchmark for Assessing Coding and Visual Comprehension through Educational Problem-Solving Video Generation
Hao Chen, Tianyu Shi, Pengran Huang, Zeyuan Li, Jiahui Pan, Qianglong Chen, Lewei He. Findings of the Association for Computational Linguistics: EMNLP 2025. 2025.
- Open Access
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 31047-31086
PlanningArena: A Modular Benchmark for Multidimensional Evaluation of Planning and Tool Learning
Zihan Zheng, Tianle Cui, Chuwen Xie, Jiahui Pan, Qianglong Chen, Lewei He. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 31047-31086
Open AccessPlanningArena: A Modular Benchmark for Multidimensional Evaluation of Planning and Tool Learning
Zihan Zheng, Tianle Cui, Chuwen Xie, Jiahui Pan, Qianglong Chen, Lewei He. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.
- Open Access
Role-RL: Online Long-Context Processing with Role Reinforcement Learning for Distinct LLMs in Their Optimal Roles
Large language models (LLMs) with long-context processing are still challenging because of their implementation complexity, training efficiency and data sparsity. To address this issue, a new paradigm named Online Long-context Processing (OLP) is proposed when we process a document of unlimited length, which typically occurs in the information reception and organization of diverse streaming media such as automated news reporting, live e-commerce, and viral short videos. Moreover, a dilemma was often encountered when we tried to select the most suitable LLM from a large number of LLMs amidst explosive growth aiming for outstanding performance, affordable prices, and short response delays. In view of this, we also develop Role Reinforcement Learning (Role-RL) to automatically deploy different LLMs in their respective roles within the OLP pipeline according to their actual performance. Extensive experiments are conducted on our OLP-MINI dataset and it is found that OLP with Role-RL framework achieves OLP benchmark with an average recall rate of 93.2% and the LLM cost saved by 79.4%. The code and dataset are publicly available at: https://anonymous.4open.science/r/Role-RL.
Open AccessRole-RL: Online Long-Context Processing with Role Reinforcement Learning for Distinct LLMs in Their Optimal Roles
Large language models (LLMs) with long-context processing are still challenging because of their implementation complexity, training efficiency and data sparsity. To address this issue, a new paradigm named Online Long-context Processing (OLP) is proposed when we process a document of unlimited length, which typically occurs in the information reception and organization of diverse streaming media such as automated news reporting, live e-commerce, and viral short videos. Moreover, a dilemma was often encountered when we tried to select the most suitable LLM from a large number of LLMs amidst explosive growth aiming for outstanding performance, affordable prices, and short response delays. In view of this, we also develop Role Reinforcement Learning (Role-RL) to automatically deploy different LLMs in their respective roles within the OLP pipeline according to their actual performance. Extensive experiments are conducted on our OLP-MINI dataset and it is found that OLP with Role-RL framework achieves OLP benchmark with an average recall rate of 93.2% and the LLM cost saved by 79.4%. The code and dataset are publicly available at: https://anonymous.4open.science/r/Role-RL.
- Open Access
- 28 May 2024
- Published by Springer Nature in The Visual Computer
- Vol. 41 (2) , 1409-1411
Publisher Correction: Twinenet: coupling features for synthesizing volume rendered images via convolutional encoder–decoders and multilayer perceptrons
- 28 May 2024
- Published by Springer Nature in The Visual Computer
- Vol. 41 (2) , 1409-1411
Open AccessPublisher Correction: Twinenet: coupling features for synthesizing volume rendered images via convolutional encoder–decoders and multilayer perceptrons
- 12 April 2024
- Published by Springer Nature in The Visual Computer
- Vol. 40 (10) , 7201-7220
Twinenet: coupling features for synthesizing volume rendered images via convolutional encoder–decoders and multilayer perceptrons
- 12 April 2024
- Published by Springer Nature in The Visual Computer
- Vol. 40 (10) , 7201-7220
Twinenet: coupling features for synthesizing volume rendered images via convolutional encoder–decoders and multilayer perceptrons
- Open Access
- 26 March 2024
- Published by Institution of Engineering and Technology (IET) in IET Image Processing
- Vol. 18 (8) , 2064-2077
A feature‐enhanced hybrid attention network for traffic sign recognition in real scenes
Currently, traffic sign recognition techniques have been brought into the assistive driving of automobiles. However, small traffic sign recognition in real scenes is still a challenging task due to the class imbalance issue and the size limit of the traffic signs. To address the above issues, a feature‐enhanced hybrid attention network is proposed based on YOLOv5s for a small, fast, and accurate traffic sign detector. First, a series of online data augmentation strategies are designed in the preprocessing module for the model training. Second, the hybrid channel and spatial attention module CSAM are integrated into the backbone for a better feature extraction ability. Third, the channel attention module CAM is used in the detection head for a more efficient feature fusion ability. To validate the approach, extensive experiments are conducted based on the Tsinghua‐Tencent 100K dataset. It is found that the novel method achieves state‐of‐the‐art performance with only negligible increases in the model parameter and computational overhead. Specifically, the , parameters, and FLOPs are 85.8%, 7.13 M, and 16.1 G, respectively.
- 26 March 2024
- Published by Institution of Engineering and Technology (IET) in IET Image Processing
- Vol. 18 (8) , 2064-2077
Open AccessA feature‐enhanced hybrid attention network for traffic sign recognition in real scenes
Currently, traffic sign recognition techniques have been brought into the assistive driving of automobiles. However, small traffic sign recognition in real scenes is still a challenging task due to the class imbalance issue and the size limit of the traffic signs. To address the above issues, a feature‐enhanced hybrid attention network is proposed based on YOLOv5s for a small, fast, and accurate traffic sign detector. First, a series of online data augmentation strategies are designed in the preprocessing module for the model training. Second, the hybrid channel and spatial attention module CSAM are integrated into the backbone for a better feature extraction ability. Third, the channel attention module CAM is used in the detection head for a more efficient feature fusion ability. To validate the approach, extensive experiments are conducted based on the Tsinghua‐Tencent 100K dataset. It is found that the novel method achieves state‐of‐the‐art performance with only negligible increases in the model parameter and computational overhead. Specifically, the , parameters, and FLOPs are 85.8%, 7.13 M, and 16.1 G, respectively.
- 23 December 2022
- Published by Springer Nature in Neural Processing Letters
- Vol. 55 (5) , 5833-5854
Improving Span-Based Aspect Sentiment Triplet Extraction with Abundant Syntax Knowledge
- 23 December 2022
- Published by Springer Nature in Neural Processing Letters
- Vol. 55 (5) , 5833-5854
Improving Span-Based Aspect Sentiment Triplet Extraction with Abundant Syntax Knowledge
- Open Access
- 8 July 2021
- Published by Nanyang Technological University
Study of printing parameters and optimization of nozzle designs for cement paste 3D printing (CP3DP)
- 8 July 2021
- Published by Nanyang Technological University
Open AccessStudy of printing parameters and optimization of nozzle designs for cement paste 3D printing (CP3DP)