Papers by Juntao Wu
Retrieval and Reasoning on KGs: Integrate Knowledge Graphs into Large Language Models for Complex Question Answering (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have performed impressively in various NLP tasks, but their inherent hallucination phenomena severely challenge their credibility in complex reasoning. |
| Approach: | They propose to integrate explainable Knowledge Graphs (KGs) with LLMs to alleviate hallucinations . they construct subgraphs to enhance the retrieval capabilities of KGs via CoT reasoning. |
| Outcome: | Extensive experiments on two KGQA datasets show that the proposed model achieves convincing performance compared to strong baselines. |
Improving Temporal Generalization of Pre-trained Language Models with Lexical Semantic Change (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to improve neural language models perform poorly on emerging data. |
| Approach: | They propose a lexical-level masking strategy to post-train a neural language model using static data from past years. |
| Outcome: | The proposed method outperforms existing methods on two pre-trained language models, two classification tasks, and four benchmark datasets. |
Dynamic and Efficient Inference for Text Generation via BERT Family (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods to improve performance of pre-trained language models are limited due to large-scale parameters and the universal autoregressive decoding paradigm. |
| Approach: | They propose a novel fine-tuning method which can make a single pre-trained model support Dynamic and Efficient infERence and achieve an adaptive trade-off between model performance and latency. |
| Outcome: | The proposed method achieves higher BLEU scores than the strong autoregressive Transformer model on translation tasks with 3 12 times speedup and faster inference speed compared with the BART model on four GLGE benchmark tasks. |
Efficient Reasoning for LLMs through Speculative Chain-of-Thought (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for efficient reasoning focus on reducing the number of model parameters or shortening the chain-of-thought length. |
| Approach: | They propose a speculative chain-of-thought (SCoT) method to reduce reasoning latency by accelerating average reasoning speed through large and small model collaboration. |
| Outcome: | The proposed method reduces reasoning latency by 48%66% and 21%49% on GSM8K, MATH, GaoKao, CollegeMath and Olympiad datasets. |
Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints (2026.findings-acl)
Copied to clipboard
| Challenge: | a new framework for evaluation of exhaustive search capabilities is needed . high-entropy enumeration tasks make such ground truth impossible for humans to create . VERITAS is a framework built on the principle of computationally irreducible constraints . |
| Approach: | They propose a framework that uses non-optimizable constraints to create verifiable searches . VERITAS can generate infinite number of test cases with perfect ground truth and precise difficulty control . |
| Outcome: | a new evaluation framework for large language models is based on non-optimizable constraints . the framework can generate infinite number of test cases with perfect ground truth and precise difficulty control . |
QSpec: Speculative Decoding with Complementary Quantization Schemes (2025.emnlp-main)
Copied to clipboard
| Challenge: | Quantization is widely adopted to accelerate inference and reduce memory consumption in large language models. |
| Approach: | They propose a quantization paradigm that decouples efficiency from quality by integrating two complementary schemes via speculative decoding. |
| Outcome: | The proposed approach achieves 1.64x speedup without quality degradation and outperforms state-of-the-art speculative decoding methods by 1.55x in batched settings. |
JANUS: Joint Autoregressive and Non-autoregressive Training with Auxiliary Loss for Sequence Generation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to train autoregressive and non-autoregressive models only consider relevance of model parameters, ignoring correlations between the two manners. |
| Approach: | They propose a joint autoregressive and non-autoregressive training method using aUxiliary losS to enhance the model performance in both AR and NAR manners simultaneously. |
| Outcome: | The proposed method improves the model performance in both AR and NAR manners and reduces the inference latency. |
Decoder-Only LLMs can be Masked Auto-Encoders (2025.acl-short)
Copied to clipboard
Dan Qiao, Yuan Gao, Zheming Yang, Di Yang, Ziheng Wu, Pengcheng Lu, Minghui Qiu, Juntao Li, Min Zhang
| Challenge: | Modern NLP workflows require different models for generation and embedding tasks. |
| Approach: | They propose a method that transforms an LLM into a Uni-Directional Masked Auto-Encoder. |
| Outcome: | The proposed method achieves state-of-the-art under unsupervised conditions with merely 100 training steps. |
A Survey of Generative Information Extraction (2025.coling-main)
Copied to clipboard
| Challenge: | Information Extraction (IE) is a popular and fundamental task in natural language processing. |
| Approach: | They first review generative information extraction methods based on pre-trained language models and large language models focusing on their adaptation and generalization capabilities. |
| Outcome: | The proposed methods are based on pre-trained language models and large language models, and emphasize the importance of model collaboration. |