← Search

Xuanhui Wang

9 accepted papers

2025

Inference Scaling for Long-Context Retrieval Augmented Generation

ICLR 2025oral

The scaling of inference computation has unlocked the potential of long-context large language models (LLMs) across diverse settings. For knowledge-intensive tasks, the increased compute is often allocated to incorporate more external knowledge. However, without effectively utilizing such knowledge…

Cited by 25SourcePDFScholar
2025

LiPO: Listwise Preference Optimization through Learning-to-Rank

NAACL 2025long

Aligning language models (LMs) with curated human feedback is critical to control their behaviors in real-world applications. Several recent policy optimization methods, such as DPO and SLiC, serve as promising alternatives to the traditional Reinforcement Learning from Human Feedback (RLHF) approac…

Cited by 44SourcePDFScholar
2024

Beyond Yes and No: Improving Zero-Shot LLM Rankers via Scoring Fine-Grained Relevance Labels

NAACL 2024short

Zero-shot text rankers powered by recent LLMs achieve remarkable ranking performance by simply prompting. Existing prompts for pointwise LLM rankers mostly ask the model to choose from binary relevance labels like “Yes” and “No”. However, the lack of intermediate relevance label options may cause th…

Cited by 78SourcePDFScholar
2024

Consolidating Ranking and Relevance Predictions of Large Language Models through Post-Processing

EMNLP 2024main

The powerful generative abilities of large language models (LLMs) show potential in generating relevance labels for search applications. Previous work has found that directly asking about relevancy, such as "*How relevant is document A to query Q?*”, results in suboptimal ranking. Instead, the pairw…

Cited by 6SourcePDFScholar
2024

Large Language Models are Effective Text Rankers with Pairwise Ranking Prompting

NAACL 2024findings

Ranking documents using Large Language Models (LLMs) by directly feeding the query and candidate documents into the prompt is an interesting and practical problem. However, researchers have found it difficult to outperform fine-tuned baseline rankers on benchmark datasets.We analyze pointwise and li…

Cited by 255SourcePDFScholar
2023

Learning List-Level Domain-Invariant Representations for Ranking

NeurIPS 2023spotlight

Domain adaptation aims to transfer the knowledge learned on (data-rich) source domains to (low-resource) target domains, and a popular method is invariant representation learning, which matches and aligns the data distributions on the feature space. Although this method is studied extensively and ap…

Cited by 9SourcePDFScholar
2023

PaRaDe: Passage Ranking using Demonstrations with LLMs

EMNLP 2023short findings

Recent studies show that large language models (LLMs) can be instructed to effectively perform zero-shot passage re-ranking, in which the results of a first stage retrieval method, such as BM25, are rated and reordered to improve relevance. In this work, we improve LLM-based re-ranking by algorithmi…

Cited by 0SourceScholar
2023

RD-Suite: A Benchmark for Ranking Distillation

NeurIPS 2023poster

The distillation of ranking models has become an important topic in both academia and industry. In recent years, several advanced methods have been proposed to tackle this problem, often leveraging ranking information from teacher rankers that is absent in traditional classification settings. To dat…

Cited by 7SourcePDFScholar
2021

Are Neural Rankers still Outperformed by Gradient Boosted Decision Trees?

ICLR 2021spotlight

Despite the success of neural models on many major machine learning problems, their effectiveness on traditional Learning-to-Rank (LTR) problems is still not widely acknowledged. We first validate this concern by showing that most recent neural LTR models are, by a large margin, inferior to the best…

Cited by 131SourcePDFScholar