Papers by Mei Guo
Gated Differentiable Working Memory for Long-Context Language Modeling (2026.acl-long)
Copied to clipboard
Lingrui Mei, Shenghua Liu, Yiwei Wang, Yuyao Ge, Baolong Bi, Jiayu Yao, Jun Wan, Ziling Yin, Jiafeng Guo, Xueqi Cheng
| Challenge: | Long contexts break transformers, attention scores dilute, model cannot adapt to novel patterns at inference time. |
| Approach: | They propose a framework that gates the memory consolidation process by estimating Contextual Utility . they propose GDWM to maintain a form of working memory with constant contexts . |
| Outcome: | The proposed framework achieves comparable or superior performance on sparse-information tasks with 4 fewer gradient steps compared to uniform baselines. |
Seeing the wood for the trees: a contrastive regularization method for the low-resource Knowledge Base Question Answering (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods for Knowledge Base Question Answering rely on semantic parsing and information retrieval. |
| Approach: | They propose a contrastive regularization based method to extract correct answer entities from a context knowledge base and a corresponding question. |
| Outcome: | The proposed method achieves state-of-the-art performance on the WebQuestionsSP dataset and the effectiveness of proposed modules is also evaluated. |
SWAM: Adaptive Sliding Window and Memory-Augmented Attention Model for Rumor Detection (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for rumor detection on social media focus on static graphs, ignoring dynamic and incremental propagation . rumour detection on the social media platform is crucial to mitigating harmful effects of rumors. |
| Approach: | They propose a sliding window and memory-augmented attention model for rumor detection . they use a dynamic propagation graph and memory to capture the long-term dependency . |
| Outcome: | The proposed model is compared with the state-of-the-art models on two public datasets. |
FGDGNN: Fine-Grained Dynamic Graph Neural Network for Rumor Detection on Social Media (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for detecting rumors on social media focus on coarse-grained temporal information and ignore fine-grain temporal dynamics. |
| Approach: | They propose a fine-grained dynamic graph neural network model which incorporates fine-grain temporal information into a unified framework for rumor detection. |
| Outcome: | The proposed model improves on three public real-world datasets. |
DCR: Quantifying Data Contamination in LLMs Evaluation (2025.emnlp-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) memorize evaluation data during training, inflating performance metrics and undermining genuine generalization assessment. |
| Approach: | They propose a framework to detect and quantify benchmark data contamination (BDC) by synthesizing contamination scores via a fuzzy inference system. |
| Outcome: | The proposed framework detects and quantifies BDC risk across semantic, informational, data, and label levels. |
VEG: Verbal đťś–-greedy for Semantic Exploration in Multi-Turn RL Agents (2026.acl-industry)
Copied to clipboard
Yongchang Hao, Jie Hao, Yongsheng Mei, Ze Ye, Junyi Chai, Bin Guo, Benjamin Z. Yao, Chenlei Guo, Lili Mou
| Challenge: | Standard RL approaches suffer from reward sparsity and mode-seeking behavior . lack of diversity hinders exploration necessary for optimal learning . |
| Approach: | They propose a framework that leverages external feedback as a dynamic control variable to explicitly balance exploration and exploitation within the semantic space. |
| Outcome: | Experiments on Tau Bench and SearchQA show that the proposed framework outperforms standard RL baselines. |
Explainable Prediction of Text Complexity: The Missing Preliminaries for Text Simplification (2021.acl-long)
Copied to clipboard
| Challenge: | Text simplification reduces the language complexity of professional content for accessibility purposes. |
| Approach: | They propose that text simplification can be decomposed into a pipeline of tasks . they show that the pipeline can be used to predict whether a text needs to be simplified . |
| Outcome: | The proposed model improves the performance of out-of-sample simplification tests on a blackbox lexical model . the proposed model reduces the complexity of professional text by a large margin . |