Papers by Qing Gu
Token Prepending: A Training-Free Approach for Eliciting Better Sentence Embeddings from LLMs (2025.acl-long)
Copied to clipboard
| Challenge: | Recent studies have focused on prompt engineering to extract sentence embeddings from large language models (LLMs) but these models are mostly decoder-only and the earlier tokens in the sentence cannot attend to the latter, resulting in biased encoding of sentence information and cascading effects on the final decoded token. |
| Approach: | They propose a plug-and-play and training-free technique that prepends each layer’s decoded sentence embedding to the beginning of the sentence in the next layer’ s input. |
| Outcome: | The proposed technique can significantly improve the performance of existing prompt-based sentence embedding methods across different LLMs while incurring negligible additional inference cost. |
Aggregating Multiple Heuristic Signals as Supervision for Unsupervised Automated Essay Scoring (2023.acl-long)
Copied to clipboard
| Challenge: | Automated Essay Scoring (AES) aims to evaluate the quality score of input essays without human intervention. |
| Approach: | They propose an unsupervised approach to evaluate the quality of input essays . they use multiple heuristic quality signals as pseudo-groundtruths to train a neural AES model . |
| Outcome: | The proposed approach achieves state-of-the-art performance on eight prompts of ASPA dataset compared with previous unsupervised methods . |
Focusing Condition: Inference-Time Self-Contrastive Steering Elicits Better Conditional Text Embeddings in LLMs (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for extracting conditional text embeddings from large language models (LLMs) relying on prompts often fails to produce high-quality conditional embeddables, resulting in degradation of quality. |
| Approach: | They propose a plug-and-play method that constructs unconditional general text embeddings and uses them to refine conditional text embeds. |
| Outcome: | The proposed method improves performance of prompt-based methods on clustering, Semantic Textual Similarity, and triplet alignment datasets. |
Direct Speech-to-Speech Translation With Discrete Units (2022.acl-long)
Copied to clipboard
Ann Lee, Peng-Jen Chen, Changhan Wang, Jiatao Gu, Sravya Popuri, Xutai Ma, Adam Polyak, Yossi Adi, Qing He, Yun Tang, Juan Pino, Wei-Ning Hsu
| Challenge: | Existing direct speech-to-speech translation models rely on text generation as an intermediate step. |
| Approach: | They propose a direct speech-to-speech translation model that translates speech from one language to another without relying on intermediate text generation. |
| Outcome: | The proposed model produces 6.7 BLEUs in the Fisher Spanish-English dataset when trained without any text transcripts and with text supervision. |
Enriching Word Embeddings with Domain Knowledge for Readability Assessment (C18-1)
Copied to clipboard
| Challenge: | Existing word embedding models focus on syntactic or semantic relations of words, while ignoring reading difficulty. |
| Approach: | They propose a method which learns the word embedding for readability assessment . they extract the knowledge on word-level difficulty from three perspectives to construct a knowledge graph . |
| Outcome: | The proposed method is effective and potential, the authors show . they use the knowledge-enriched word embedding model on English and Chinese datasets . |
StructFact: Reasoning Factual Knowledge from Structured Data with Large Language Models (2025.findings-acl)
Copied to clipboard
| Challenge: | Large language models (LLMs) have made significant strides in natural language processing by leveraging their ability to comprehend and reason with factual knowledge. |
| Approach: | They propose a benchmark to evaluate the ability of large language models to reason with structured data for knowledge-intensive tasks. |
| Outcome: | Extensive tests on 10 common LLMs show that they struggle with heterogeneity of structured data during reasoning. |
Contrastive Prompting Enhances Sentence Embeddings in LLMs through Inference-Time Steering (2025.acl-long)
Copied to clipboard
| Challenge: | Existing studies focus on prompt engineering to encode the full semantics of a sentence into the embedding of the last token. |
| Approach: | They propose a technique that introduces an extra auxiliary prompt to elicit better sentence embedding . they propose to use the hidden state of the token as the sentence embedded in LLMs . |
| Outcome: | The proposed technique can improve performance of existing prompt-based methods on STS tasks and downstream classification tasks. |
A Symmetric Local Search Network for Emotion-Cause Pair Extraction (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods for Emotion-cause pair extraction are not effective because of their lack of annotation. |
| Approach: | They propose a new task which aims at extracting the potential clause pairs of emotions and corresponding causes in a document. |
| Outcome: | The proposed method outperforms existing state-of-the-art methods on the ECPE corpus. |
LongRecipe: Recipe for Efficient Long Context Generalization in Large Language Models (2025.acl-long)
Copied to clipboard
Zhiyuan Hu, Yuliang Liu, Jinman Zhao, Suyuchen Wang, WangYan WangYan, Wei Shen, Qing Gu, Anh Tuan Luu, See-Kiong Ng, Zhiwei Jiang, Bryan Hooi
| Challenge: | Large language models face significant challenges in handling long-context tasks because of their limited effective context window size during pretraining, which restricts their ability to generalize over extended sequences. |
| Approach: | They propose a training strategy for extending the context window of LLMs including impactful token analysis, position index transformation, and training optimization strategies. |
| Outcome: | Experiments on three types of LLMs show that LongRecipe can utilize long sequences while requiring only 30% of the target context window size. |
Improving Domain Generalization for Prompt-Aware Essay Scoring via Disentangled Representation Learning (2023.acl-long)
Copied to clipboard
| Challenge: | Existing AES models are either prompt-specific or prompt-adaptive and cannot generalize well on “unseen” prompts. |
| Approach: | They propose a prompt-aware neural AES model to extract comprehensive representation for essay scoring, including both prompt-invariant and prompt-specific features. |
| Outcome: | The proposed model extracts comprehensive representation for essay scoring, including both prompt-invariant and prompt-specific features. |
AEA: Adaptive Expert Allocation Improves Sentence Embeddings from Mixture-of-Experts LLM (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods to improve embeddings from Mixture-of-Experts models allocate a fixed number of experts uniformly across all layers and tokens, ignoring inter-layer and inter-token heterogeneity. |
| Approach: | They propose an Adaptive Expert Allocation framework that performs layer-wise and token-wise expert allocation to enhance embedding quality. |
| Outcome: | The proposed method improves embedding quality across multiple MoE models. |
Extending Context Window of Large Language Models from a Distributional Perspective (2024.emnlp-main)
Copied to clipboard
Yingsheng Wu, Yuxuan Gu, Xiaocheng Feng, Weihong Zhong, Dongliang Xu, Qing Yang, Hongtao Liu, Bing Qin
| Challenge: | Existing scaling methods for extending context window rely on empirical approaches and lack understanding of the internal distribution within RoPE resulting in suboptimal performance. |
| Approach: | They propose to optimize the context window extending task from the view of rotary angle distribution by minimizing disturbance between rotary angles to maintain consistency with the pre-training phase. |
| Outcome: | The proposed approach reduces by up to 72% of the distributional disturbance when extending LLaMA2’s context window to 8k, and reduces it by up 32% when extending to 16k. |
Multi-Prompting Decoder Helps Better Language Understanding (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to adapt Pre-trained Language Models to downstream tasks are limited by their inference APIs. |
| Approach: | They propose a multi-prompting decoding framework that query PLMs with multiple prompts . they propose to query Plms with optimal transport for hidden states and calibrated decoding for class scores . |
| Outcome: | The proposed framework achieves state-of-the-art results on multiple natural language understanding datasets under the few-shot setting. |