Papers by Haoyu Zhao
Encoding Spreadsheets for Large Language Models (2024.emnlp-main)
Copied to clipboard
Haoyu Dong, Jianbo Zhao, Yuzhang Tian, Junyu Xiong, Mengyu Zhou, Yun Lin, José Cambronero, Yeye He, Shi Han, Dongmei Zhang
| Challenge: | Spreadsheets are characterized by their extensive two-dimensional grids, flexible layouts, and varied formatting options, which pose significant challenges for large language models (LLMs). |
| Approach: | They propose a structural-anchor-based compression, inverse index translation, and data-format-aware aggregation module to compress spreadsheets effectively. |
| Outcome: | The proposed method outperforms the existing model in GPT4 and achieves a state-of-the-art 78.9% F1 score. |
TC–RAG: Turing–Complete RAG’s Case study on Medical LLM Systems (2025.acl-long)
Copied to clipboard
Xinke Jiang, Yue Fang, Rihong Qiu, Haoyu Zhang, Yongxin Xu, Hao Chen, Wentao Zhang, Ruizhe Zhang, Yuchen Fang, Xinyu Ma, Xu Chu, Junfeng Zhao, Yasha Wang
| Challenge: | Existing approaches to RAG neglect system state variables, resulting in poor performance and erroneous knowledge accumulation. |
| Approach: | They propose a framework that incorporates a Turing Complete System to manage state variables and manage retrieval halting. |
| Outcome: | The proposed framework improves on seven real-world healthcare datasets and shows that it is more accurate than existing methods. |
End-to-End Modeling via Information Tree for One-Shot Natural Language Spatial Video Grounding (2022.acl-long)
Copied to clipboard
Mengze Li, Tianbao Wang, Haoyu Zhang, Shengyu Zhang, Zhou Zhao, Jiaxu Miao, Wenqiao Zhang, Wenming Tan, Jin Wang, Peng Wang, Shiliang Pu, Fei Wu
| Challenge: | Existing methods for grounding video frames with dense annotations require enormous amount of human effort. |
| Approach: | They propose to ground natural language in video frames with only one frame labeled . they propose an end-to-end model that eliminates interference of irrelevant frames . |
| Outcome: | The proposed model can ground natural language in all video frames with only one frame labeled . the proposed model eliminates interference of irrelevant frames based on branch search and cropping techniques . |
Unleashing the Power of Language Models in Text-Attributed Graph (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies on graph learning on text-attributed graphs have been limited by memory cost and underutilization of relationships between nodes and words. |
| Approach: | They propose a Node Representation Update Pre-training Architecture based on Co-modeling text and graph to learn representations of papers and words simultaneously. |
| Outcome: | The proposed model outperforms baselines on the ogbn-arxiv benchmark dataset. |
BlendFilter: Advancing Retrieval-Augmented Large Language Models via Query Generation Blending and Knowledge Filtering (2024.emnlp-main)
Copied to clipboard
Haoyu Wang, Ruirui Li, Haoming Jiang, Jinjin Tian, Zhengyang Wang, Chen Luo, Xianfeng Tang, Monica Cheng, Tuo Zhao, Jing Gao
| Challenge: | Retrieval-augmented Large Language Models struggle with complex inputs and noisy knowledge retrieval hindering model effectiveness. |
| Approach: | They propose a query generation method that integrates query generation blending with knowledge filtering to enhance retrieval-augmented LLMs. |
| Outcome: | The proposed approach surpasses state-of-the-art benchmarks on open-domain question answering benchmarks. |
RoseRAG: Robust Retrieval-augmented Generation with Small-scale LLMs via Margin-aware Preference Optimization (2025.findings-acl)
Copied to clipboard
| Challenge: | Large language models (LLMs) have impressive performance but face high computational costs and latency, limiting their deployment in resource-constrained settings. |
| Approach: | They propose a robust RAG framework for large language models via Margin-aware Preference Optimization to enhance the accuracy and reliability of SLMs. |
| Outcome: | The proposed framework surpasses state-of-the-art benchmarks on three open-domain question answering tasks. |
HadSkip: Homotopic and Adaptive Layer Skipping of Pre-trained Language Models for Efficient Inference (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to exit pre-trained language models suffer from the limitation that they have to sequentially traverse through all layers prior to the selected exit layer, which degrades their performance. |
| Approach: | They propose a homotopic and adaptive layer skipping fine-tuning method that adaptively selects the layers to skip based on a predefined budget. |
| Outcome: | The proposed method outperforms all state-of-the-art baselines on the GLUE benchmark and shows that it is highly efficient. |
Representation Interventions Enable Lifelong Knowledge Memory Control in LLMs (2026.acl-long)
Copied to clipboard
Xuyuan Liu, Shengyu Chen, Xinshuai Dong, Yanchi Liu, Xujiang Zhao, Haoyu Wang, Yujun Yan, Haifeng Chen, Zhengzhang Chen
| Challenge: | Large language models (LLMs) produce outdated or inaccurate content. Updating their knowledge efficiently and accurately without costly retraining is a major challenge. |
| Approach: | They propose a robust and scalable method that treats knowledge control as interventions within the model’s representation space. |
| Outcome: | The proposed method achieves fine-grained control over complex, unstructured knowledge while maintaining general utility with frozen base weights. |
Efficient and Effective Prompt Tuning via Prompt Decomposition and Compressed Outer Product (2025.naacl-long)
Copied to clipboard
| Challenge: | Existing methods for fine-tuning pre-trained language models overlook intrinsic semantic associations between soft prompt tokens, leading to high discreteness and limited interactions. |
| Approach: | They propose a low-parameters Prompt Tuning method which leverages prompt decomposition and compressed outer product to facilitate multiple interactions among prompt tokens. |
| Outcome: | Experiments on six architectures and eight datasets show that the proposed method outperforms state-of-the-art methods in performance and efficiency. |
RoseLoRA: Row and Column-wise Sparse Low-rank Adaptation of Pre-trained Language Model for Knowledge Editing and Fine-tuning (2024.emnlp-main)
Copied to clipboard
| Challenge: | Pre-trained language models have strong generalizability, but fine-tuning involves updating all parameters, rendering full fine-uning resource-intensive. |
| Approach: | They propose a parameter-efficient fine-tuning method that updates all pre-trained parameters during inference. |
| Outcome: | The proposed method outperforms baseline methods on five benchmarks across 20 datasets. |
Knowledge Decoupling via Orthogonal Projection for Lifelong Editing of Large Language Models (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for enhancing large language models (LLMs) have achieved some success, but their knowledge understanding and memory capacity significantly degrades after extensive editing. |
| Approach: | They propose a method that stores the basis vectors of the representation space of past edits in a knowledge cache and projects the gradient of the current edit onto a space orthogonal to previous knowledge for updating. |
| Outcome: | The proposed method improves question-answering ability and hallucination mitigation by 14% and 61% for large language models after 3,000 edits. |
Profile Consistency Identification for Open-domain Dialogue Agents (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies on improving attribute consistency focus on incorporating attribute information in responses, but few efforts have identified the consistency relations between response and attribute profile. |
| Approach: | They propose a key-value structure information enriched BERT model to identify the profile consistency . they propose to incorporate attribute information into the generated responses . |
| Outcome: | The proposed model improves over strong baselines on downstream tasks. |
CoV: Chain-of-View Prompting for Spatial Reasoning (2026.findings-acl)
Copied to clipboard
Haoyu Zhao, Akide Liu, Zeyu Zhang, Weijie Wang, Feng Chen, Ruihan Zhu, Gholamreza Haffari, Bohan Zhuang
| Challenge: | Embodied question answering requires collecting context that is distributed across multiple viewpoints . most recent vision–language models (VLMs) are constrained to a fixed and finite set of input views . |
| Approach: | They propose a training-free, test-time reasoning framework that transforms a VLM into an active viewpoint reasoner through a coarse-to-fine exploration process. |
| Outcome: | The proposed framework improves LLM-Match performance by 11.98% on four mainstream VLMs. |
Do Transformers Parse while Predicting the Masked Word? (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies show that pre-trained language models encode linguistic structures like parse trees while being trained unsupervised. |
| Approach: | They propose to train pre-trained language models to encode linguistic structures like parse trees while unsupervised. |
| Outcome: | The proposed model performs optimally for masked language modeling loss on the English PCFG. |
OpenRubrics: Towards Scalable Synthetic Rubric Generation for Reward Modeling and LLM Alignment (2026.acl-long)
Copied to clipboard
| Challenge: | Existing reward models rely on scalar or pairwise judgments that fail to capture multifaceted nature of human preferences. |
| Approach: | They propose a rubric-based reward model that uses a large collection of prompt, rubric pairs to generate a scalar score or preference label for each response. |
| Outcome: | The proposed model surpasses strong size-matched baselines by 8.4% across multiple benchmarks. |
NL2Formula: Generating Spreadsheet Formulas from Natural Language Queries (2024.findings-eacl)
Copied to clipboard
Wei Zhao, Zhitao Hou, Siyuan Wu, Yan Gao, Haoyu Dong, Yao Wan, Hongyu Zhang, Yulei Sui, Haidong Zhang
| Challenge: | Creating spreadsheet formulas remains a tedious and error-prone task for many end-users . a novel task is proposed to generate spreadsheet formulae from a user's NL query . |
| Approach: | They propose a task to generate formulas that are grounded on a spreadsheet table given a Natural Language query as input. |
| Outcome: | The proposed task generates formulas that are grounded on a spreadsheet table, given a natural language query as input. |