Papers by Nan He

18 papers
HiCLRE: A Hierarchical Contrastive Learning Framework for Distantly Supervised Relation Extraction (2022.findings-acl)

Copied to clipboard

Challenge: Existing approaches of distantly supervised relation extraction (DSRE) focus on sentence-level or bag-level de-noising, neglecting the explicit interaction with cross levels.
Approach: They propose a hierarchical contrastive learning framework for distantly supervised relation extraction to reduce noisy sentences.
Outcome: The proposed framework outperforms baselines in various mainstream DSRE datasets.
Query Rewriting in Retrieval-Augmented Large Language Models (2023.emnlp-main)

Copied to clipboard

Challenge: Existing studies focus on adapting either the retriever or the reader, but this approach is more focused on adaptation of the query itself.
Approach: They propose a new framework for retrieval-augmented Large Language Models . they propose rewrite-retrieve-read instead of retrieve-then-read .
Outcome: The proposed framework improves performance on downstream tasks, open-domain QA and multiple-choice QA.
FASPell: A Fast, Adaptable, Simple, Powerful Chinese Spell Checker Based On DAE-Decoder Paradigm (D19-55)

Copied to clipboard

Challenge: Existing spell checkers for Chinese are based on denoising autoencoder and decoder paradigms that require a small amount of data to be effective.
Approach: They propose a Chinese spell checker based on a new paradigm which consists of a denoising autoencoder and a decoder.
Outcome: The proposed spell checker is faster, more Adaptable to simplified and traditional Chinese texts and has a much simpler structure to be as much Powerful in error detection and correction.
JDDC 2.1: A Multimodal Chinese Dialogue Dataset with Joint Tasks of Query Rewriting, Response Generation, Discourse Parsing, and Summarization (2022.emnlp-main)

Copied to clipboard

Challenge: e-commerce users express their needs using text, images, or videos . but detailed information provided by images is limited, and customer service systems cannot understand the intent of users without the input text.
Approach: They construct a large-scale multimodal multi-turn dialogue dataset from a mainstream Chinese E-commerce platform . the dataset contains about 246K dialogue sessions, 3M utterances, and 507K images .
Outcome: The proposed dataset contains 246K dialogue sessions, 3M utterances, 507K images . it also includes product knowledge bases and image category annotations .
Federated LoRA Fine-Tuning with Pipelined Error-Mitigated Aggregation and Matrix-Wise Freezing (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for fine-tuning large language models often suffer from biased model aggregation and are hindered by significant communication and computation burden.
Approach: They propose a Federated low-rank adaptation system for large language models that leverages pipelined error-mitigated model aggregation and adaptive matrix-wise parameter freezing to mitigate aggregations.
Outcome: The proposed system improves time-to-target by 2.17-8.48 on real-world datasets.
Can Multiple Responses from an LLM Reveal the Sources of Its Uncertainty? (2025.findings-emnlp)

Copied to clipboard

Challenge: Large language models can produce unreliable or misleading outputs, posing challenges for real-world applications.
Approach: They employ an auxiliary LLM to analyze the patterns of disagreement among LLMs . they validate their framework on AmbigQA, OpenBookQA, and MMLU-Pro .
Outcome: The proposed model can be used to diagnose uncertainty sources in a model with an auxiliary model.
Rethinking the Role of Prompting Strategies in LLM Test-Time Scaling: A Perspective of Probability Theory (2025.acl-long)

Copied to clipboard

Challenge: Recent studies have shown that scaling test-time compute can also effectively improve reasoning.
Approach: They propose a probabilistic method to efficiently predict scaling performance and identify the best prompting strategy under large sampling times.
Outcome: The proposed method significantly improves the scaling performance of majority voting on large language models.
An MRC Framework for Semantic Role Labeling (2022.coling-1)

Copied to clipboard

Challenge: Existing work on semantic role labels ignores the semantic connection between the two tasks . et al. (2010) defined two types of semantic roles: core roles and non-core roles.
Approach: They propose to use machine reading comprehension to bridge the gap between these two tasks . they formalize predicate disambiguation as multiple-choice machine reading understanding .
Outcome: The proposed framework achieves state-of-the-art or comparable results to previous work . it uses the descriptions of candidate senses of a given predicate as options to select the correct sense .
KD-VLP: Improving End-to-End Vision-and-Language Pretraining with Object Knowledge Distillation (2022.findings-naacl)

Copied to clipboard

Challenge: Existing vision-and-language pretraining approaches rely on external object detectors to encode images in a multi-modal transformer framework.
Approach: They propose an object-aware end-to-end VLP framework which feeds image grid features from CNNs into the Transformer and learns the multi-modal representations jointly.
Outcome: The proposed framework achieves competitive or superior performances on vision-language tasks.
DUET: Joint Exploration of User–Item Profiles in Recommendation System (2026.findings-acl)

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.
A2ATS: Retrieval-Based KV Cache Reduction via Windowed Rotary Position Embedding and Query-Aware Vector Quantization (2025.findings-acl)

Copied to clipboard

Challenge: Long context large language models (LLMs) pose significant challenges for efficient serving due to the large memory footprint and high access overhead of KV cache.
Approach: They propose a retrieval-based method to reduce the memory footprint of LLMs . they propose Windowed Rotary Position Embedding and query-aware vector quantization .
Outcome: The proposed method can achieve lower performance degradation with lower overhead compared to existing methods . it can reduce the memory footprint and access overhead of long context large language models .
Metric-guided Distillation: Distilling Knowledge from the Metric to Ranker and Retriever for Generative Commonsense Reasoning (2022.emnlp-main)

Copied to clipboard

Challenge: Existing work on commonsense generation requires models to have relational reasoning and compositional generalization capabilities.
Approach: They propose a metric distillation rule to distill knowledge from a standard metric to a ranker and transfer it to re-ranking a retriever.
Outcome: The proposed method surpasses the previous SOTA.
SoftDedup: an Efficient Data Reweighting Method for Speeding Up Language Model Pre-training (2024.acl-long)

Copied to clipboard

Challenge: Current methods focus on detecting and removing duplicates, which risks the loss of valuable information and neglects the varying degrees of duplication.
Approach: They propose a method that maintains dataset integrity while selectively reducing the sampling weight of data with high commonness.
Outcome: The proposed method significantly improves training efficiency on deduplicated datasets and improves downstream accuracy by 1.77%.
ToolExpNet: Optimizing Multi-Tool Selection in LLMs with Similarity and Dependency-Aware Experience Networks (2025.findings-acl)

Copied to clipboard

Challenge: Current empirical methods that focus on isolated tools learning struggle with accurate multi-tool selection due to issues like confusing similar tools and neglecting dependencies.
Approach: They propose a tool-learning paradigm which integrates tools and trial-and-error experiences into a network characterized by semantic similarity and dependency relationships.
Outcome: The proposed model outperforms existing methods on multiple real-world API datasets and significantly outperformed baselines.
CAPSTONE: Curriculum Sampling for Dense Retrieval with Document Expansion (2023.emnlp-main)

Copied to clipboard

Challenge: Experimental results show that dense retrieval models are better at obtaining query-informed representations.
Approach: They propose a dual-encoder approach that computes latent representations of query and document independently, but inference replaces the real query with a generated one.
Outcome: The proposed approach outperforms previous dense retrieval models on in-domain and out-of-domain datasets.
CIA: Inferring the Communication Topology from LLM-based Multi-Agent Systems (2026.acl-long)

Copied to clipboard

Challenge: LLM-based multi-agent systems (MAS) have demonstrated remarkable capabilities in solving complex tasks.
Approach: They propose a communication inference attack that constructs new adversarial queries to induce intermediate agents’ reasoning outputs and models their semantic correlations through the global bias disentanglement and LLM-guided weak supervision.
Outcome: The proposed attack achieves an average AUC of 0.87 and a peak AUC up to 0.99, revealing the privacy risk in MAS.
MINTQA: A Multi-Hop Question Answering Benchmark for Evaluating LLMs on New and Long-tail Knowledge (2026.acl-long)

Copied to clipboard

Challenge: Existing studies have shown that large language models can handle knowledge with varying familiarity.
Approach: They propose a benchmark to evaluate multi-hop question answering on new and tail knowledge . they use RAG to integrate external knowledge into large language models .
Outcome: The proposed benchmark evaluates the multi-hop reasoning ability of large language models . it primarily evaluates their ability to handle knowledge with different levels of familiarity .
PROM: A Phrase-level Copying Mechanism with Pre-training for Abstractive Summarization (2024.lrec-main)

Copied to clipboard

Challenge: Existing summarization strategies are abstractive and extractive, but are hard to control.
Approach: They propose a PhRase-level cOpying Mechanism that enhances attention on n-grams and calculates an auxiliary loss for the copying prediction.
Outcome: Empirical studies show that PROM improves copying accuracy and faithfulness on benchmarks.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations