Hao Zhang
Other people with similar names: Hao Zhang, Hao Zhang, Hao Zhang, Hao Zhang, Hao Zhang, Hao Zhang, Hao Zhang (Rochester)
Unverified author pages with similar names: Hao Zhang
2026
Tree-CoT-RT: An Explainable Multi-Path Tree-Guided Chain-of-Thought and Reinforcement Learning Framework for Aspect Sentiment Quad Prediction
Hao Zhang | Jiahao Wang | Zhenke Duan | Xin Yin | Haichuan Hu | Hualong Chen | Suyi | Congqing He | Yike Tan | Yu-N Cheah
Findings of the Association for Computational Linguistics: ACL 2026
Hao Zhang | Jiahao Wang | Zhenke Duan | Xin Yin | Haichuan Hu | Hualong Chen | Suyi | Congqing He | Yike Tan | Yu-N Cheah
Findings of the Association for Computational Linguistics: ACL 2026
Aspect Sentiment Quad Prediction (ASQP) is a fundamental yet challenging task in fine-grained sentiment analysis, particularly when aspects or opinions are implicit. Existing methods often lack explainability and generalization, making it difficult to justify inference decisions and to detect implicit sentiment across domains and varied expression patterns. To address these limitations, we propose Tree-CoT-RT, an explainable multi-path tree-guided chain-of-thought and reinforcement learning framework specifically designed for ASQP. The core idea is to use sentiment tree structures to design type-specific reasoning templates that guide LLMs in generating explainable chains, including both final sentiment quadruples and intermediate inference steps for transparent implicit reasoning. However, the generated reasoning chains often vary in quality and may contain logical inconsistencies. To mitigate this, we introduce a reinforcement learning strategy with a rule-based reward function to generate high-quality reasoning traces, which are then used to fine-tune the LLM and enable controlled sampling. Experiments on benchmark datasets demonstrate that Tree-CoT-RT substantially outperforms strong baselines, particularly in scenarios involving implicit sentiment analysis.
2025
SolEval: Benchmarking Large Language Models for Repository-level Solidity Smart Contract Generation
Zhiyuan Peng | Xin Yin | Rui Qian | Peiqin Lin | YongKang Liu | Hao Zhang | Chenhao Ying | Yuan Luo
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Zhiyuan Peng | Xin Yin | Rui Qian | Peiqin Lin | YongKang Liu | Hao Zhang | Chenhao Ying | Yuan Luo
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Large language models (LLMs) have transformed code generation.However, most existing approaches focus on mainstream languages such as Python and Java, neglecting the Solidity language, the predominant programming language for Ethereum smart contracts.Due to the lack of adequate benchmarks for Solidity, LLMs’ ability to generate secure, cost-effective smart contracts remains unexplored.To fill this gap, we construct SolEval, the first repository-level benchmark designed for Solidity smart contract generation, to evaluate the performance of LLMs on Solidity.SolEval consists of 1,507 samples from 28 different repositories, covering 6 popular domains, providing LLMs with a comprehensive evaluation benchmark.Unlike the existing Solidity benchmark, SolEval not only includes complex function calls but also reflects the real-world complexity of the Ethereum ecosystem by incorporating Gas@k and Vul@k.We evaluate 16 LLMs on SolEval, and our results show that the best-performing LLM achieves only 26.29% Pass@10, highlighting substantial room for improvement in Solidity code generation by LLMs.Additionally, we conduct supervised fine-tuning (SFT) on Qwen-7B using SolEval, resulting in a significant performance improvement, with Pass@5 increasing from 16.67% to 58.33%, demonstrating the effectiveness of fine-tuning LLMs on our benchmark.We release our data and code at https://github.com/pzy2000/SolEval.
2024
An Instruction Tuning-Based Contrastive Learning Framework for Aspect Sentiment Quad Prediction with Implicit Aspects and Opinions
Hao Zhang | Yu-N Cheah | Congqing He | Feifan Yi
Findings of the Association for Computational Linguistics: EMNLP 2024
Hao Zhang | Yu-N Cheah | Congqing He | Feifan Yi
Findings of the Association for Computational Linguistics: EMNLP 2024
Aspect sentiment quad prediction (ASQP) is crucial in aspect-based sentiment analysis (ABSA). It involves identifying a text’s aspect,sentiment, opinion, and category. Existing methods have insufficiently explored how to effectively leverage the knowledge of pre-trainedlanguage models (PLMs) to handle implicit aspects and opinions, particularly in combinations such as implicit aspect & explicit opinion, explicit aspect & implicit opinion, and implicit aspect & implicit opinion. We introduce ITSCL, a framework leveraging Instruction Tuning and Supervised Contrastive Learning to improve aspect sentiment quad predictions, especially for implicit aspects and opinions. Implementing this approach presents several challenges. First, designing effective instructions and prompts to optimize the model’s training is difficult. Second, creating sentiment combination vectors with contrastive learning to enhance the model’s discrimination requires further investigation. To address these challenges, ITSCL combines instruction tuning with aligned PLM templates, enabling better knowledge acquisition and identification of implicit sentiments. Additionally, the contrastive learning framework enhances performance by using four fully connected layers to combine sentiments, aspects, opinions, and combinations, maximizing similarity for same-label representationsand minimizing it for different labels. Experimental results show our method significantly outperforms previous methods on benchmark datasets.