Papers by Qi Hao
Copied to clipboard
| Challenge: | Existing domain-specific knowledge of domain-related tasks is lacking in pre-trained language models. |
| Approach: | They propose a domain-adaptation method which can dynamically select domain-specific tokens and guide the discriminator to emphasize them, without introducing new training parameters. |
| Outcome: | The proposed method can capture domain-specific knowledge of domain-related tasks without introducing new training parameters. |
Copied to clipboard
| Challenge: | Existing methods for code retrieval struggle to balance scalability and annotation quality. |
| Approach: | They propose a method that integrates functions called within the repository and information on third-party APIs to enhance the annotation context. |
| Outcome: | The proposed method improves the annotation context by incorporating functions called within the repository and information on third-party API functionalities. |
Copied to clipboard
| Challenge: | Existing methods for temporal knowledge Graphs neglect internal structural interactions between subgraphs and ignore potential smooth features that do not lead to semantic changes. |
| Approach: | They propose to use a disentangled multi-span evolutionary network to capture local neighbor features while perceiving historical neighbor semantic information. |
| Outcome: | Extensive experiments show that the proposed model outperforms the state-of-the-art in TKG reasoning by 22.7%. |
Copied to clipboard
| Challenge: | Existing methods for patent classification ignore key technical content claims and citation relationships . existing methods treat labels as independent targets, failing to exploit semantic and structural information within the label taxonomy. |
| Approach: | They propose a Claim Structure based Patent Classification model with Label Awareness . structural graph learning is used to mine the internal logic of patent claims . |
| Outcome: | The proposed method is more effective than state-of-the-art classification models. |
Copied to clipboard
| Challenge: | Instruction tuning has enabled large language models to achieve remarkable performance, yet its success heavily depends on the availability of high-quality instruction-response pairs. |
| Approach: | They propose a mutual alignment framework which enforces coherence between instructions and responses through mutual constraints. |
| Outcome: | The proposed framework generalizes well across model architectures and sizes, achieving state-of-the-art performance on LLaMA, Mistral, and Qwen models across diverse benchmarks. |
Copied to clipboard
| Challenge: | Structured pruning is a practical approach to deploying large language models (LLMs) but it fails to capitalize on modest task-specific calibration signals, causing limited downstream gains. |
| Approach: | They propose a method that removes attention heads and MLP channels using loss-based important scores . they use perplexity for language modeling and a margin-based objective for decision-style tasks . |
| Outcome: | The proposed method lowers perplexity and improves accuracy at higher sparsity . it also stabilizes accuracy and mitigates perxity collapse without fine-tuning . |
Copied to clipboard
| Challenge: | Existing studies on building language agents have not addressed this social learning gap. |
| Approach: | They propose an interactive learning method that improves the social intelligence of language agents by using behavior cloning and self-reinforcement based training on filtered social interaction data. |
| Outcome: | The proposed method allows a 7B LLM to reach the social goal completion ability of an expert model (GPT-4-based agent) without the loss of more generic abilities, such as the ability to answer knowledge-based questions. |
Copied to clipboard
| Challenge: | Existing work focuses on enabling LLMs to leverage legal rules to tackle complex legal reasoning tasks, but ignores their ability to understand legal rules. |
| Approach: | They propose a legal paragraph prediction task that aims to predict the legal paragraph given criminal facts and a framework CLEAR to enhance their legal reasoning ability. |
| Outcome: | The proposed model improves the ability of LLMs to analyze legal cases with the guidance of legal rule insights. |
Copied to clipboard
| Challenge: | Existing multi agent frameworks for large language models are brittle on code generation tasks. |
| Approach: | They propose a framework that brings pair programming to autonomous LLM collaboration. |
| Outcome: | Using PairCoder, large language models achieve better results on code generation tasks and reduce token usage by 40% to 70% on eight representative backbones. |
Copied to clipboard
| Challenge: | Prior work focused on collecting preference pairs, requiring substantial annotation efforts. |
| Approach: | They propose a pipeline to extract reliable human feedback from in-the-wild interactions . they propose to use WildChat as an interaction source to train the model . |
| Outcome: | The proposed model achieves comparable or even superior performance compared to conventional models with improved calibration and cross-sample consistency. |
Copied to clipboard
| Challenge: | Text-Centric Visual Question Answering (TEC-VQA) is a text-centric visual task understanding tool. |
| Approach: | They introduce a benchmark that features human expert annotations across 9 languages . they prioritize the text in question-answer pairs while disregarding visual text in images . |
| Outcome: | The proposed benchmarks prioritize the text in question-answer pairs while disregarding visual text in images. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown significant promise in embodied decision-making tasks within virtual open-world environments, but lack domain-specific knowledge. |
| Approach: | They propose a cost-effective agent framework that integrates cross-modal domain knowledge and finetunes a dedicated object detection model for visual analysis. |
| Outcome: | The proposed framework reduces the requirement for domain-specific training data from millions of samples to a few hundred. |
Copied to clipboard
| Challenge: | Prior work has explored the selection of examples for in-context learning, neglecting the internal relationships between examples and exist an inconsistency between training and inference. |
| Approach: | They propose a sequential-aware method that leverages the LLM’s feedback on varying context, aiding in capturing inter-relationships and sequential information among examples. |
| Outcome: | Experiments on 23 NLP tasks show that Se2 surpasses baselines and achieves 42% relative improvement over random selection. |
Copied to clipboard
| Challenge: | Existing methods for embedding knowledge graphs implicitly memorize relation rules to infer missing links, but they are difficult to memorize due to the inherent deficiencies of such implicit memorization strategy. |
| Approach: | They propose a vertical learning paradigm that allows to explicitly copy target information from related factual triples for more accurate prediction. |
| Outcome: | The proposed model improves generalization ability and makes distant link prediction significantly easier. |
Copied to clipboard
| Challenge: | Document retrieval techniques are used to compute semantic similarity between a query and documents, but the scalar similarity fails to reflect enough information, hindering the interpretation of retrieval results. |
| Approach: | They propose a method which improves the global document-query similarity through contrastive learning and integrates well-designed fusion and decoding modules. |
| Outcome: | The proposed method improves the global document-query similarity through contrastive learning and integrates well-designed fusion and decoding modules. |
Copied to clipboard
| Challenge: | Reinforcement learning (RL) is widely used for post-training large language models (LLMs) in code editing, but in real-world code editing scenarios, reward distributions are often skewed with unpredictable noise, leading to distorted advantage computation and increased rollout outliers. |
| Approach: | They propose a group-relative method that finds an interval with the highest SNR and uses the median of that interval as an adaptive Q to replace the group mean in advantage calculation. |
| Outcome: | The proposed method improves on nine instruction-tuned LLMs while remaining plug-and-play and efficient. |
Copied to clipboard
| Challenge: | Existing methods for integrating spatial layouts with text have limitations . existing methods produce overly long text sequences or lack autoregressive traits of LLMs . |
| Approach: | They introduce Interleaving Layout and Text in a Large Language Model (LayTextLLM) they use OCR-derived text and spatial layouts to integrate with LLMs for document understanding . |
| Outcome: | The proposed model shows an increase in performance in KIE and VQA tasks. |
Copied to clipboard
| Challenge: | Prior work focused on data preprocessing, focusing on filtering and cleaning data . a study aimed to improve fine-grained scheduling of data order in epochs . |
| Approach: | They propose a fine-grained scheduling method of data order in epochs to fill this gap . they define data difficulty based on relevance between data and model . |
| Outcome: | The proposed method improves on pre-training and small-scale fine-tuning experiments 2.4% over baselines. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have been successful in understanding language and processing text, but their cost prohibits their practical applications. |
| Approach: | They propose a multi-agent collaboration method that breaks down lengthy documents into smaller, more manageable chunks and organizes the member agents to read their assigned chunks. |
| Outcome: | The proposed method achieves 16.42% and 1.63% accuracy gains over existing models on single-hop and multi-hop QA settings. |
Copied to clipboard
| Challenge: | Existing benchmarks for document understanding in the wild are based on scanned or digital documents . however, these benchmarks fail to capture the challenges posed by documents in the real world . |
| Approach: | They propose a new benchmark that incorporates a diverse set of manually captured document images reflecting real-world conditions. |
| Outcome: | The proposed model is based on a set of manually captured document images reflecting real-world conditions and is compared with digital or scanned documents. |
Copied to clipboard
| Challenge: | Existing non-factuality detection methods require response generation, which incurs significant computational overhead. |
| Approach: | They propose a lightweight model called Factuality Lens which effectively probes hidden representations of fact-seeking questions for the NFP task. |
| Outcome: | The proposed model is able to probe hidden representations of fact-seeking questions and reduce development costs. |
Copied to clipboard
| Challenge: | Commercial-scale language models (LMs) have taken APR to unprecedented levels, but they are limited by parameters and humans interact with them through explicit prompts. |
| Approach: | They propose a method that utilizes process supervision to improve program repair by allowing users to input feedback from compilers and test cases. |
| Outcome: | The proposed method outperforms large outcome-based generation methods and is inspired by strategies used in programming competitions. |
Copied to clipboard
| Challenge: | Existing methods of Table Understanding (TU) focus on the textual content within the tabular data, disregarding the topological information of the table. |
| Approach: | They propose a framework that uses tabs to understand tabular data without ignoring the topological information of the table. |
| Outcome: | The proposed framework outperforms baselines in few-shot table understanding tasks. |
Copied to clipboard
| Challenge: | Best practices for RL in instruction following remain underexplored. |
| Approach: | They propose a verification method that combines rule-based code verification with LLM-based verification from a large reasoning model. |
| Outcome: | The proposed method achieves state-of-the-art performance among models of comparable size and generalizes well to unseen constraints. |
Copied to clipboard
| Challenge: | Sememes are defined as the minimum semantic units of human languages . but most languages do not have sememe-based linguistic knowledge bases . a new framework is proposed to predict sememes for words in other languages based on semems . |
| Approach: | They propose a framework to model correlations between sememes and multi-lingual words in low-dimensional semantic space for sememe prediction. |
| Outcome: | The proposed model improves on baseline methods on real-world datasets. |
Copied to clipboard
| Challenge: | Existing studies have explored the evolutionary analysis of ancient scripts, with particular attention to the transformation of character forms from oracle bone inscriptions to regular script. |
| Approach: | They propose a benchmark framework that leverages MLLMs to analyze the evolution of ancient Chinese scripts. |
| Outcome: | The proposed framework improves performance on core tasks and character recognition and evolutionary reasoning tasks while limiting performance on other tasks. |
Copied to clipboard
| Challenge: | Existing RAG systems often underutilize the retrieved documents, authors say . they fail to extract and integrate key clues needed to support faithful and interpretable reasoning . |
| Approach: | a new framework extracts key clues from retrieved content and generates multiple reasoning paths . the framework optimizes the model by selecting the most appropriate reasoning path . |
| Outcome: | Experiments show that ClueAnchor outperforms baseline RAG frameworks in completeness and robustness. |
Copied to clipboard
| Challenge: | Large language model (LLM) routing assigns each query to the best suitable model from an ensemble. |
| Approach: | They introduce a large-scale benchmark and unified framework for LLM routing . they find that many routing methods exhibit similar performance under unified evaluation . |
| Outcome: | The proposed benchmark provides comprehensive metrics for both performance-oriented and performance-cost trade-off routing. |
Copied to clipboard
| Challenge: | Prior research has focused on optimizing general-purpose large language models to downstream tasks . however, these approaches inherently introduce data dependency, which hinders generalization and reusability. |
| Approach: | They propose an algorithm that localizes the most task-sensitive attention heads and prunes by restricting attention training updates to these heads, thereby reducing alignment costs. |
| Outcome: | The proposed algorithm achieves 2% performance improvement over baselines on three tasks while localizing the most task-sensitive attention heads. |
Copied to clipboard
| Challenge: | Existing multi-objective preference alignment methods for large language models face limitations such as auxiliary reward/reference models and computational complexity. |
| Approach: | They propose a framework that achieves dynamic balance across preference dimensions by using dimension-aware generation metrics as implicit rewards. |
| Outcome: | Empirical results show that AMoPO outperforms state-of-the-art methods by 28.5% . |
Copied to clipboard
| Challenge: | Existing document translation pipelines face a tension between linguistic processing and layout preservation. |
| Approach: | They propose a framework for layout-preserving PDF translation that decouples visual layout metadata from semantic content. |
| Outcome: | The proposed framework improves layout fidelity, visual aesthetics, and terminology consistency over representative baselines while maintaining competitive translation precision. |
Copied to clipboard
| Challenge: | Existing work on multi-agent collaborative tasks in Minecraft is limited due to inefficiency and limited fault tolerance. |
| Approach: | They propose a framework that incorporates causality to manage dependencies among subtasks. |
| Outcome: | The proposed framework achieves state-of-the-art performance in multi-agent cooperative tasks of Minecraft. |
Copied to clipboard
| Challenge: | Existing LLMs are opaque and difficult to interpret, resulting in limited interpretability. |
| Approach: | They propose an interaction-aware profile generator that jointly produces user and item profiles conditioned on both user history and item evidence. |
| Outcome: | The proposed model outperforms baselines on three real-world datasets. |
Copied to clipboard
| Challenge: | Large language models (LLMs) struggle to follow complex instructions of IE tasks due to not being aligned with humans. |
| Approach: | They propose an aligned large language moDEL that effectively solves various IE tasks including closed IE, open IE and on-demand IE. |
| Outcome: | The proposed model achieves state-of-the-art (SoTA) performance among open-source models. |
Copied to clipboard
| Challenge: | Recent work addresses this problem by training span-level hallucination detectors using reinforcement learning and chain-of-thought reasoning. |
| Approach: | They propose a framework that explicitly enforces active evidence seeking during CoT reasoning by requiring quotation of relevant source segments at each verification step. |
| Outcome: | The proposed framework improves hallucination span detection performance with limited reasoning overhead and improved robustness in out-of-domain settings. |
Copied to clipboard
| Challenge: | Existing approaches to verify agent behaviors in complex environments rely on rule-based verifiers or LLM-as-a-Judge models. |
| Approach: | They propose a benchmark to evaluate Agent-as-a-Judge across three domains . the benchmark covers search, data systems, and graphical user interfaces - with 155 tasks and 516 trajectories . |
| Outcome: | The proposed benchmark outperforms existing benchmarks in search, data systems, and GUI domains while revealing open challenges in agent-based verification. |
Copied to clipboard
| Challenge: | Existing approaches to training large language models suffer from unstable value estimation, whereas outcome supervision struggles with credit assignment due to sparse, trajectory-level rewards. |
| Approach: | They propose a framework that integrates process supervision into group relative policy optimization. |
| Outcome: | The proposed framework outperforms standard GRPO on knowledge-intensive benchmarks by 5.0% and 6.3% on Qwen3-1.7B. |
Copied to clipboard
| Challenge: | Existing methods for creating rationales for criminal cases do not pay enough attention to the important legal concepts. |
| Approach: | They propose a legal concept-guided court view generation framework that generates rationales based on predicted legal concepts . they first divide the court view into sub-views, then employ a solver and verifier to generate and select rationale. |
| Outcome: | The proposed model generates coherent and coherent court views on a real-world criminal case dataset. |
Copied to clipboard
| Challenge: | High-quality data in training proactive dialogue agents is scarce, despite fine-tuning and reinforcement learning . a recent study has shown that the effectiveness of supervised fine-touring is limited by the lack of high-quality, domain-specific training data. |
| Approach: | They propose a framework for training recruitment proactive dialogue agents using a high-fidelity user simulator and a multi-dimensional evaluation framework based on Chain-of-Intention. |
| Outcome: | The proposed framework outperforms existing simulator-based data selection strategies in a real-world recruitment scenario. |
Copied to clipboard
| Challenge: | Existing methods for meeting summary have limited the ability to deal with long-term dependency. |
| Approach: | They propose a hierarchical transformer encoder-decoder network with multi-task pre-training to capture key sentences at word level and generate them at word-level. |
| Outcome: | The proposed model is superior to the previous methods in meeting summary datasets AMI and ICSI. |
Copied to clipboard
| Challenge: | Existing benchmarks focus on a single type of quantity or a specific format, lacking a comprehensive evaluation of scale recognition capabilities. |
| Approach: | They propose a visual scale recognition benchmark built using images from COCO, Open Images, and Flickr to evaluate scale recognition capabilities of multimodal large language models. |
| Outcome: | The proposed model achieves 42.60% accuracy, lower than the 97.40% of humans. |
Copied to clipboard
| Challenge: | Code LLMs lack reproducible data pipelines and training protocols for reproducible advancements in code intelligence. |
| Approach: | They propose a top-tier code LLM that releases model weights and inference code . reproducible data pipelines, rigorous experimental ablation results and training protocols are included . |
| Outcome: | The proposed model achieves comparable performance to leading models and serves as an "open cookbook" reproducible training data, rigorous experimental ablation results, and detailed training protocols are also included in the model. |
Copied to clipboard
| Challenge: | Parameter-Efficient Fine-tuning (PEFT) methods are limited on knowledge-intensive tasks due to the limited number of trainable parameters. |
| Approach: | They propose a mechanism that fine-tunes Large Language Models with larger adapters . they store and update the parameters of larger adapter adapters on the CPU . |
| Outcome: | The proposed method achieves comparable results to those obtained with larger memory capacities over the limited bandwidth of PCI Express (PCIe). |
Copied to clipboard
| Challenge: | Autoregressive models are the de facto choice for sequence generation tasks, but standard approaches treat digits as independent tokens and apply cross-entropy loss, overlooking the coherent structure of numerical sequences. |
| Approach: | They propose a novel approach to entropy loss by extending the Earth Mover’s Distance to preserve ordinal relationships between numerical values and sequence-level to penalize the overall discrepancy between predicted and actual sequences. |
| Outcome: | Extensive experiments show that NTIL improves numerical prediction and integrates effectively with LLMs/MLLMs. |
Copied to clipboard
| Challenge: | Event factuality detection is under-explored due to the lack of high-quality large-scale data . efd is a subfield of event understanding, which aims to determine the factuity of textual events. |
| Approach: | They propose a large-scale EFD dataset with factuality annotations of 112,276 events . they find that adopting event arguments and relations helps in event factuity detection . |
| Outcome: | The proposed dataset includes factuality annotations of 112,276 events . it is the largest EFD dataset and is challenging for fine-tuned models and large language models . |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have impressive capabilities but need for task-specific prompt engineering can hinder their generalization. |
| Approach: | They propose a lightweight and versatile retriever that automatically retrieves prompts for a given zero-shot task input. |
| Outcome: | The proposed model is universally applicable across tasks and models . it mitigates hallucination problem in chatGPT, and it improves even the strongest LLMs. |
Copied to clipboard
| Challenge: | Recent research focuses on integrating reasoning capabilities into the realm of retrieval-augmented generation (RAG) via outcome-supervised reinforcement learning (RL). |
| Approach: | They propose a process-level reward module to mitigate the unawareness of intermediate reasoning steps in outcome-level supervision without additional annotation. |
| Outcome: | The proposed framework can boost LLMs’ reasoning ability by integrating external knowledge sources through retrieval-augmented generation (RAG) The proposed model can mitigate the unawareness of intermediate reasoning steps in outcome-level supervision without additional annotation. |
Copied to clipboard
| Challenge: | Recent studies reveal query out-of-distribution issues degrading ANN performance . a distribution regularizer is introduced into the encoder training objective to encourage alignment between query and base embeddings. |
| Approach: | They introduce a distribution regularizer into the encoder training objective to encourage alignment between query and base embeddings. |
| Outcome: | The proposed method consistently improves retrieval performance across multiple datasets. |
Copied to clipboard
| Challenge: | Existing reward models focus on human preferences, neglecting verifiable correctness signals. |
| Approach: | They propose a reward system that combines human preference rewards with verifiable correctness signals to provide reliable rewards. |
| Outcome: | The proposed reward agent significantly outperforms vanilla reward models on benchmarks and inference-time best-of-n searches on real-world tasks. |
Copied to clipboard
| Challenge: | Retrieval-augmented generation (RAG) is a promising approach to address limitations of fixed knowledge in large language models. |
| Approach: | They propose a benchmark and a metric to assess LLMs' ability to generate long-form responses that exploit retrieved information. |
| Outcome: | The proposed benchmarks lack a comprehensive evaluation method to assess LLMs' ability to generate long-form responses that effectively exploits retrieved information. |
Copied to clipboard
| Challenge: | Current document image parsing solutions rely on specialized models or generate content autoregressively. |
| Approach: | They propose a multimodal document image parsing model that integrates specialized models with autogeneous content generation. |
| Outcome: | The proposed model achieves state-of-the-art performance across diverse page-level and element-level settings while ensuring superior efficiency. |