Papers by Mengting Hu
Modalities Should Be Appropriately Leveraged: Uncertainty Guidance for Multimodal Chinese Spelling Correction (2024.lrec-main)
Copied to clipboard
| Challenge: | Chinese spelling correction (CSC) aims to detect and correct spelling errors in Chinese texts. |
| Approach: | They propose a framework that incorporates uncertainty into feature learning and correction stages . they propose to combine the uncertainty of multimodal features with model learning . |
| Outcome: | The proposed framework improves on three public datasets. |
E-NER: Evidential Deep Learning for Trustworthy Named Entity Recognition (2023.findings-acl)
Copied to clipboard
Zhen Zhang, Mengting Hu, Shiwan Zhao, Minlie Huang, Haotian Wang, Lemao Liu, Zhirui Zhang, Zhe Liu, Bingzhe Wu
| Challenge: | Named entity recognition (NER) systems focus on improving model performance, ignoring the need to quantify model uncertainty. |
| Approach: | They propose to introduce two uncertainty-guided loss terms to the conventional EDL and a series of uncertainty-guiding training strategies to solve these challenges. |
| Outcome: | The proposed method achieves better OOV/OOD detection performance and generalization ability on OOV entities compared to state-of-the-art methods. |
CAN: Constrained Attention Networks for Multi-Aspect Sentiment Analysis (D19-1)
Copied to clipboard
| Challenge: | Existing methods for aspect-specific sentiment classification are noisy and downgraded performance. |
| Approach: | They propose a constrained attention network to regularize attention for multi-aspect sentiment analysis by orthogonal regularization on multiple aspects and sparse regularization for each single aspect. |
| Outcome: | The proposed approach outperforms state-of-the-art methods on two public datasets and extends to multi-task settings. |
Towards Robust Few-Shot Relation Classification: Incorporating Relation Description with Agreement (2025.findings-emnlp)
Copied to clipboard
Mengting Hu, Jianfeng Wu, Ming Jiang, Yalan Xie, Zhunheng Wang, Rui Ying, Xiaoyi Liu, Ruixuan Xu, Hang Gao, Renhong Cheng
| Challenge: | Existing approaches to recognize relational relationships with a few support samples are limited for unlimited queries. |
| Approach: | They propose a simple but effective framework that uses relation descriptions as external knowledge to enhance the model’s comprehension of the relation semantics. |
| Outcome: | The proposed framework outperforms strong baselines while being robust against various NOTA rates. |
Uncertainty-Aware Unlikelihood Learning Improves Generative Aspect Sentiment Quad Prediction (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing studies focus on what to generate but ignore what not to generate . a template-agnostic method boosts original learning and reduces mistakes simultaneously . |
| Approach: | They propose a template-agnostic method to control the token-level generation . they introduce Monte Carlo dropout to understand the built-in uncertainty of pre-trained language models . |
| Outcome: | The proposed method boosts original learning and reduces mistakes simultaneously on four public datasets. |
Classical Sequence Match Is a Competitive Few-Shot One-Class Learner (2022.coling-1)
Copied to clipboard
| Challenge: | Existing models that use transformers are unable to learn new knowledge in the few-shot scenarios. |
| Approach: | They propose a few-shot one-class problem which takes a known sample as a reference to detect whether an unknown instance belongs to the same class. |
| Outcome: | The proposed method significantly outperforms transformer models under meta-learning and fine-tuning. |
Simple but Effective Compound Geometric Operations for Temporal Knowledge Graph Completion (2024.acl-long)
Copied to clipboard
Rui Ying, Mengting Hu, Jianfeng Wu, Yalan Xie, Xiaoyi Liu, Zhunheng Wang, Ming Jiang, Hang Gao, Linlin Zhang, Renhong Cheng
| Challenge: | Current methods embed factual knowledge into continuous vector space and apply geometric operations to learn potential patterns in temporal knowledge graphs. |
| Approach: | They propose a temporal knowledge graph completion method that uses two geometric operations to learn missing facts in temporal graphs. |
| Outcome: | The proposed method significantly outperforms existing temporal knowledge graph embedding models. |
KBM: Delineating Knowledge Boundary for Adaptive Retrieval in Large Language Models (2025.findings-emnlp)
Copied to clipboard
Zhen Zhang, Xinyu Wang, Yong Jiang, Zile Qiao, Zhuo Chen, Guangyu Li, Feiteng Mu, Mengting Hu, Pengjun Xie, Fei Huang
| Challenge: | Retrieval-augmented generation (RAG) is employed to tackle these challenges . a Knowledge Boundary Model (KBM) is used to express the known/unknown of a given question . |
| Approach: | They propose a Knowledge Boundary Model to express the known/unknown of a given question . they find that not all questions need to trigger RAG to improve performance . |
| Outcome: | The proposed model reduces time and computational costs by retrieving parts of unknown knowledge . the proposed model can express the known/unknown of a given question and determine whether a RAG needs to be triggered . |
TRUST: Towards Robust Social Bot Detection via Uncertainty-Guided Pseudo-Labeling and Graph Structure Purification (2026.findings-acl)
Copied to clipboard
Ruixuan Xu, Mengting Hu, Zhunheng Wang, Ming Jiang, Rui Ying, Zhen Zhang, Hang Gao, Shuaipeng Liu, Renhong Cheng
| Challenge: | Existing graph-based detection models are vulnerable to deceptive message propagation, where bots deliberately interact with legitimate users. |
| Approach: | They propose a framework to mitigate deceptive message propagation by node-level uncertainty estimation and graph structure purification. |
| Outcome: | The proposed framework improves on three benchmark datasets and six GNN backbones on real-world social bots. |
SudokuFill: A Multi-Agent Progressive Filling Framework for Document-Level Scientific Information Extraction (2026.findings-acl)
Copied to clipboard
Yang Li, Yajiao Wang, Yu Zhang, Yuanzhe Zhang, Maodi Hu, Mengting Zhang, Xi Sun, Hua Yue, Zhixiong Zhang
| Challenge: | Scientific information extraction (SciIE) is a key bottleneck for turning unstructured papers into computable knowledge bases. |
| Approach: | They propose a scientific information extraction framework that solves a Sudoku problem as a progressive filling problem. |
| Outcome: | The proposed framework outperforms the GPT-4o model on a document-level adjuvant dataset. |
Efficient Mind-Map Generation via Sequence-to-Graph and Reinforced Graph Refinement (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to generate mind-maps from text are difficult to capture the overall semantics of a document. |
| Approach: | They propose an efficient mind-map generation network that converts a document into a graph via sequence-to-graph. |
| Outcome: | The proposed network reduces inference time by thousands of times compared with existing methods and reveals key semantic structures better than plain text. |
Density-Aware Prototypical Network for Few-Shot Relation Classification (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies treat NOTA as an extra class and treat it the same as known relations. |
| Approach: | They propose a density-aware prototypical network to treat various instances distinctly . they separate known instances and isolate NOTA instances, respectively . their code will be made public after the paper is accepted . |
| Outcome: | The proposed method outperforms strong baselines with robustness towards different NOTA rates. |
Multi-Label Few-Shot Learning for Aspect Category Detection (2021.acl-long)
Copied to clipboard
| Challenge: | Existing few-shot learning methods focus on single-label predictions, which can not work well for ACD since a sentence may contain multiple aspect categories. |
| Approach: | They propose a few-shot learning method that uses the prototypical network to learn aspects from a set of aspects. |
| Outcome: | The proposed method significantly outperforms baseline methods on three datasets. |
Controlled Text Generation for Large Language Model with Dynamic Attribute Graphs (2024.findings-acl)
Copied to clipboard
| Challenge: | Controlled Text Generation (CTG) aims to produce texts that exhibit specific desired attributes. |
| Approach: | They propose a pluggable CTG framework for Large Language Models to control text . they use attribute scorers to evaluate attributes of sentences and construct dynamic attribute graphs . |
| Outcome: | The proposed framework achieves a peak improvement of 19.29% over baseline methods in two tasks. |
Towards Robust Evidence-Aware Fake News Detection via Improving Semantic Perception (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods lack sufficient semantic perception and are easily blinded by textual expressions. |
| Approach: | They propose a model-agnostic training framework to improve the semantic perception of evidence-aware fake news detection by combining two kinds of data augmentations with synthetic data. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on the extended test set while achieving competitive performance on the original one. |
UBench: Benchmarking Uncertainty in Large Language Models with Multiple Choice Questions (2025.findings-acl)
Copied to clipboard
Xunzhi Wang, Zhuowei Zhang, Gaonan Chen, Qiongyu Li, Bitong Luo, Zhixin Han, Haotian Wang, Zhiyu Li, Hang Gao, Mengting Hu
| Challenge: | Existing methods for benchmarking the uncertainty of large language models face challenges . existing methods require internal model access, additional training, or high computational costs . |
| Approach: | They propose a new benchmark for evaluating the uncertainty of large language models based on confidence intervals . UBench encompasses 11,978 multiple choice questions spanning knowledge, language, understanding, and reasoning capabilities. |
| Outcome: | The proposed method outperforms existing methods for benchmarking the uncertainty of large language models. |
Domain-Invariant Feature Distillation for Cross-Domain Sentiment Classification (D19-1)
Copied to clipboard
| Challenge: | Existing approaches to cross-domain sentiment classification focus on domain-invariant representations, but few focus on the domain-specific information. |
| Approach: | They propose to distill domain-invariant sentiment features with an orthogonal domain-dependent task . the orthogonalist task is built on the aspects varying widely in different domains . |
| Outcome: | The proposed method improves domain-invariant features and transfer performance on three public datasets. |
RECAL: Sample-Relation Guided Confidence Calibration over Tabular Data (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Various machine learning methods for tabular data lack accurate confidence estimation, which is needed for high-risk sensitive applications such as credit modeling and financial fraud detection. |
| Approach: | They propose a general post-training confidence calibration framework to calibrate the confidence of current machine learning models by employing graph neural networks to model the relationships between different samples. |
| Outcome: | The proposed framework improves the confidence estimation on tabular datasets by using graph neural networks to model the relationships between different samples. |
Improving Aspect Sentiment Quad Prediction via Template-Order Data Augmentation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent work on aspect sentiment quad prediction (ASQP) uses a template to extract aspect quadruplets from review sentences. |
| Approach: | They propose to use a pre-trained language model to select proper orders from a template order perspective to improve aspect sentiment quad prediction. |
| Outcome: | The proposed method outperforms state-of-the-art methods significantly in low-resource settings. |
Is Compound Aspect-Based Sentiment Analysis Addressed by LLMs? (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Aspect-based sentiment analysis (ABSA) aims to predict aspect-based elements from text . large language models (LLMs) have impressive abilities in handling human instructions . |
| Approach: | They propose a framework to evaluate LLMs' ability to handle complex ABSA tasks . they use constrained prompts to automatically organize the returned predictions . |
| Outcome: | The proposed framework outperforms supervised methods in some cases, but it is still lacking in other areas. |
Inside Out: Evolving User-Centric Core Memory Trees for Long-Term Personalized Dialogue Systems (2026.acl-long)
Copied to clipboard
| Challenge: | Existing personalized dialogue systems struggle to reconcile unbounded interactions with finite context constraints. |
| Approach: | They propose a framework that utilizes a globally maintained PersonaTree as the carrier of long-term user profiling. |
| Outcome: | The proposed framework outperforms existing systems in suppressing contextual noise and persona inconsistency. |
BvSP: Broad-view Soft Prompting for Few-Shot Aspect Sentiment Quad Prediction (2024.acl-long)
Copied to clipboard
| Challenge: | Aspect sentiment quad prediction aims to predict aspects due to distinct data distribution. |
| Approach: | They propose a method that aggregates multiple templates with a broader view . they first construct a few-shot ASQP dataset that contains richer categories . |
| Outcome: | The proposed method outperforms the state-of-the-art methods under four few-shot settings and other public datasets. |
ECoK: Emotional Commonsense Knowledge Graph for Mining Emotional Gold (2024.findings-acl)
Copied to clipboard
Zhunheng Wang, Xiaoyi Liu, Mengting Hu, Rui Ying, Ming Jiang, Jianfeng Wu, Yalan Xie, Hang Gao, Renhong Cheng
| Challenge: | Existing knowledge graphs focus on the representation and reasoning of general factual knowledge, while there are significant deficiencies in the understanding and reasoning for emotional knowledge. |
| Approach: | They propose a commonsense knowledge graph that can be used to represent emotional knowledge by combining theories from psychology, cognitive science, and linguistics. |
| Outcome: | The proposed model surpasses GPT-4-Turbo in the emotion-related tasks. |