Papers by Quzhe Huang
Relation-Aware Question Answering for Heterogeneous Knowledge Graphs (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing retrieval-based approaches to solve multihop Knowledge Base Question Answering (KBQA) fail to utilize information from head-tail entities and the semantic connection between relations to enhance the information capturing of relations in KGs. |
| Approach: | They propose to use a dual relation graph to find the answer entity in a knowledge graph . they use primal entity graph reasoning, dual relation grafitment and interaction . |
| Outcome: | The proposed approach achieves significant performance gain over the prior state-of-the-art on two public datasets, WebQSP and CWQ. |
Towards Context-Aware Code Comment Generation (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for code comments generate comments manually, but they suffer from poor scalability and high maintenance cost due to the expensive overhead of writing comment templates. |
| Approach: | They propose a method to automatically generate code comments at a function level by targeting object-oriented programming languages. |
| Outcome: | The proposed approach outperforms the state-of-the-art methods and is comparable with existing methods. |
Rethinking Task-Specific Knowledge Distillation: Contextualized Corpus as Better Textbook (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for knowledge distillation use a two-stage paradigm: general distillation with a task-agnostic general corpus and task-specific distillation using augmented task- specific corpus. |
| Approach: | They propose a contextualized corpus that contextualizes task corpus with large-scale general corpus through relevance-based text retrieval to improve student learning. |
| Outcome: | The proposed model improves on the GLUE benchmark and shows that it is better than generalized corpus and augmented task-specific corpus. |
Probing Multimodal Large Language Models for Global and Local Semantic Representations (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing studies have focused on the ability of MLLMs to generate single tokens one by one, while lacking studies about how their representation vectors can encode global multimodal information. |
| Approach: | They propose to use image-caption corpus to train Multimodal Large Language Models (MLLMs) . they find that the topmost layers encode more global semantic information . |
| Outcome: | The proposed models can encode more global semantic information, rather than the topmost layers, and perform better on visual-language entailment tasks. |
Unlocking the Potential of Model Merging for Low-Resource Languages (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Adapting large language models (LLMs) to new languages requires continual pre-training followed by supervised fine-tuning. |
| Approach: | They propose a model merging solution that integrates LLMs with distinct capabilities into a single model without additional training. |
| Outcome: | The proposed model merging outperforms CT-then-SFT in low-resource languages with scarce data. |
More than Classification: A Unified Framework for Event Temporal Relation Extraction (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods for event temporal relation extraction ignore meaning of relations and wipe out their intrinsic dependency. |
| Approach: | They propose a unified event temporal relation extraction framework that transforms temporal relations into logical expressions of time points and completes the ETRE by predicting the relations between certain time points. |
| Outcome: | The proposed framework outperforms the state-of-the-art model on TB-Dense and MATRES by 0.3% on both datasets. |
Automating Legal Interpretation with LLMs: Retrieval, Generation, and Evaluation (2025.acl-long)
Copied to clipboard
| Challenge: | a novel framework for automated legal interpretation is proposed to alleviate the burden on legal experts. |
| Approach: | They propose a framework for automated legal interpretation that uses large language models to extract concept-related information and interpret legal concepts. |
| Outcome: | The proposed framework eliminates the need for legal experts to interpret legal concepts . it uses large language models to extract concept-related information and interpret legal concept interpretations . |
Three Sentences Are All You Need: Local Path Enhanced Document Relation Extraction (2021.acl-short)
Copied to clipboard
| Challenge: | Document-level relation extraction (RE) is more challenging than sentence RE as it often requires reasoning over multiple sentences. |
| Approach: | They propose a method to heuristically select evidence sentences for document-level relation extraction. |
| Outcome: | The proposed method can be easily combined with BiLSTM to achieve good performance on benchmark datasets even better than fancy graph neural network based methods. |
MC2: Towards Transparent and Culturally-Aware NLP for Minority Languages in China (2024.acl-long)
Copied to clipboard
| Challenge: | MC2 is the largest open-source corpus of minority languages in china . MC2, however, includes four underrepresented languages: Tibetan, Uyghur, Kazakh, and Mongolian . |
| Approach: | They propose a multilingual corpus of minority languages in China that includes four underrepresented languages . they prioritize accuracy while enhancing diversity by using a quality-centric approach . |
| Outcome: | The proposed model prioritizes accuracy while enhancing diversity, the authors say . MC2 includes four underrepresented languages: Tibetan, Uyghur, Kazakh, and Mongolian . |
Harder Task Needs More Experts: Dynamic Routing in MoE Models (2024.acl-long)
Copied to clipboard
Quzhe Huang, Zhenwei An, Nan Zhuang, Mingxu Tao, Chen Zhang, Yang Jin, Kun Xu, Kun Xu, Liwei Chen, Songfang Huang, Yansong Feng
| Challenge: | Unlike existing MoE approaches that rely on fixed TopK Routing, our dynamic expert selection framework dynamically allocates experts based on the confidence level in expert selection for each input. |
| Approach: | They propose a dynamic expert selection framework that dynamically allocates experts based on the confidence level in expert selection for each input. |
| Outcome: | The proposed method achieves an average improvement of 0.7% with less than 90% activated parameters and outperforms dense models in QA and machine translation tasks. |
Length-Adaptive Distillation: Customizing Small Language Model for Dynamic Token Pruning (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to accelerate inference speed are model compression and dynamic computation (e.g., dynamic token pruning). |
| Approach: | They propose a two-stage knowledge distillation framework that produces a customized small language model for dynamic token pruning. |
| Outcome: | The proposed framework can make the small language model more customized for dynamic token pruning and achieve better speed-performance trade-off. |
Do Charge Prediction Models Learn Legal Theory? (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models for charge prediction are sensitive, selective, and presumption of innocence . a recent study has shown that deep learning models can predict the charges accurately, but their reliability and interpretability are still underexplored. |
| Approach: | They propose that trustworthy charge prediction models should take legal theories into consideration . they propose three principles for trustworthy models to follow in this task . |
| Outcome: | The proposed framework evaluates whether existing models learn legal theories . it shows that models meet selective and presumption of innocence principles . |
Why Machine Reading Comprehension Models Learn Shortcuts? (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing studies show that many MRC models learn shortcuts to outwit benchmarks, but the performance is unsatisfactory in real-world applications. |
| Approach: | They propose to use shortcut questions to analyze learning difficulty of MRC models . they propose to analyze the learning difficulty regarding shortcut and challenging questions . |
| Outcome: | The proposed methods show that a large proportion of shortcut questions in training data make models rely on shortcut tricks excessively. |
Exploring Distantly-Labeled Rationales in Neural Network Models (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods focus on distantly-labeled rationales, ignoring the potential important non-rationale words and not distinguishing the importance of different rationale words. |
| Approach: | They propose two novel auxiliary loss functions to make better use of distantly-labeled rationales, which encourage models to maintain their focus on important words beyond labeled rationals (PINs) and alleviate redundant training on non-helpful rationale (NoIRs). |
| Outcome: | The proposed methods outperform existing methods on two representative classification tasks while maintaining the ability to spread focus to other unlabeled important words. |
From Simple to Complex: A Progressive Framework for Document-level Informative Argument Extraction (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for document-level event argument extraction use memory to store the results of already predicted events. |
| Approach: | They propose a simple-to-complex progressive framework for document-level event argument extraction . they first calculate the difficulty of each event and then conduct the extraction following a simpler order . |
| Outcome: | The proposed model outperforms previous methods by 1.4% in the document-level EAE task. |
JUREX-4E: Juridical Expert-Annotated Four-Element Knowledge Base for Legal Reasoning (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies have introduced legal theories into LLM workflows to improve their understanding of legal texts and reasoning accuracy. |
| Approach: | They evaluate an expert-annotated four-element knowledge base covering 155 criminal charges. |
| Outcome: | The proposed model can be used to analyze criminal charges and retrieve them in legal cases. |
Does Recommend-Revise Produce Reliable Annotations? An Analysis on Missing Instances in DocRED (2022.acl-long)
Copied to clipboard
| Challenge: | Document-level relation extraction is a challenging task as it requires reasoning across multiple sentences. |
| Approach: | They propose to use a recommend-revise scheme to reduce the workload of annotators by providing them with candidate relation instances from distant supervision to supplement and remove relational facts. |
| Outcome: | The proposed dataset is the first large-scale and human-annotated dataset for relation extraction. |