Papers by Yilong Lai

7 papers
AdaRewriter: Unleashing the Power of Prompting-based Conversational Query Reformulation via Test-Time Adaptation (2025.emnlp-main)

Copied to clipboard

Challenge: Prompting-based conversational query reformulation has emerged as a powerful approach for conversational search, refining ambiguous user queries into standalone search queries.
Approach: They propose a framework for query reformulation using an outcome-supervised reward model via test-time adaptation.
Outcome: Experiments on five conversational search datasets show that AdaRewriter significantly outperforms the existing methods across most settings.
SCOPE: Optimizing Key-Value Cache Compression in Long-context Generation (2025.acl-long)

Copied to clipboard

Challenge: Excessive compression during the prefill phase impairs comprehension of reasoning tasks . SCOPE is a framework that performs KV cache optimization during the decoding and prefill phases .
Approach: They propose a framework that performs optimization during the prefill and decoding phases . they propose enabling a sliding strategy to select essential heavy hitters for the decoding phase .
Outcome: Experiments show that SCOPE can optimize key-value cache for long-context generation tasks . the framework can preserve essential information while minimizing memory usage and transfer .
VReST: Enhancing Reasoning in Large Vision-Language Models through Tree Search and Self-Reward Mechanism (2025.acl-long)

Copied to clipboard

Challenge: Large Vision-Language Models (LVLMs) have shown exceptional performance in multimodal tasks, but their effectiveness in complex visual reasoning is constrained.
Approach: They propose a training-free approach that enhances Reasoning in Large Vision-Language Models . they propose integrating Monte Carlo Tree Search and Self-Reward mechanisms into the reasoning tree .
Outcome: The proposed approach surpasses current prompting methods and secures state-of-the-art performance across three multimodal reasoning benchmarks.
SEED: Accelerating Reasoning Tree Construction via Scheduled Speculative Decoding (2025.coling-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) have remarkable emergent abilities across various tasks, yet their performance on complex reasoning and planning tasks remains suboptimal.
Approach: They propose a tree-search-based reasoning framework that encourages the exploration of intermediate steps and a round-scheduled strategy to manage draft model dispatching.
Outcome: The proposed framework improves runtime speed and GPU memory management concurrently and handles multiple iterations for thought generation and state evaluation.
LASS: A Novel and Economical Data Augmentation Framework Based on Language Models for Debiasing Opinion Summarization (2025.coling-main)

Copied to clipboard

Challenge: Existing methods to generate negative summaries are expensive and lack the capacity to generate large data sets.
Approach: They propose a data augmentation framework based on LArge and Small language models for debiaSing opinion summarization that generates a small number of synthesized negative reviews by rewriting the positive text via a large language model.
Outcome: The proposed framework can generate large numbers of negative reviews by rewriting the positive text using a large language model and training a disentangle reconstruction model based on the generated data.
AdaCQR: Enhancing Query Reformulation for Conversational Search via Sparse and Dense Retrieval Alignment (2025.coling-main)

Copied to clipboard

Challenge: Existing methods to address conversational search challenges are limited by one specific retrieval system.
Approach: They propose a framework to enhance generalizability of information-seeking queries by aligning reformulation models with term-based and semantic retrieval systems.
Outcome: The proposed framework outperforms existing methods in a more efficient framework.
Opinions Are Not Always Positive: Debiasing Opinion Summarization with Model-Specific and Model-Agnostic Methods (2024.lrec-main)

Copied to clipboard

Challenge: Existing opinion summarization frameworks are reluctant to generate negative summaries given input of negative opinions.
Approach: They propose to disentangle input into sentiment-relevant and sentiment-irrelevant components through adversarial loss.
Outcome: The proposed approaches reduce sentiment bias in the existing opinion summarization dataset . the proposed approaches generate better summaries with a more balanced emotional polarity distribution .

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