Multimodal Item Scoring for Natural Language Recommendation via Gaussian Process Regression with LLM Relevance Judgments
Yifan Liu, Qianfeng Wen, Jiazhou Liang, Mark Zhao, Justin Cui, Anton Korikov, Armin Toroghi, Junyoung Kim, Scott Sanner
TL;DR
NLRec often relies on Dense Retrieval, which assumes a unimodal relevance peak near the NL query, but user satisfaction can arise from multiple relevant passages distributed across the embedding space. The authors present GPR-LLM, a Gaussian Process Regression framework that uses a small set of LLM relevance judgments to learn a multimodal relevance surface over passage embeddings, with an RBF kernel to capture multiple modes. A targeted $\epsilon$-greedy sampling strategy selects labeled passages, enabling GP-based passage scoring that generalizes to all passages and aggregates to item rankings. Across four NLRec benchmarks and two LLM backbones, GPR-LLM with the RBF kernel consistently surpasses DR, Cross-Encoder, and Pointwise LLM relevance scoring under the same labeling budget, achieving up to 65% improvements and demonstrating robustness to kernel choice and sampling strategy.
Abstract
Natural Language Recommendation (NLRec) generates item suggestions based on the relevance between user-issued NL requests and NL item description passages. Existing NLRec approaches often use Dense Retrieval (DR) to compute item relevance scores from aggregation of inner products between user request embeddings and relevant passage embeddings. However, DR views the request as the sole relevance label, thus leading to a unimodal scoring function centered on the query embedding that is often a weak proxy for query relevance. To better capture the potential multimodal distribution of the relevance scoring function that may arise from complex NLRec data, we propose GPR-LLM that uses Gaussian Process Regression (GPR) with LLM relevance judgments for a subset of candidate passages. Experiments on four NLRec datasets and two LLM backbones demonstrate that GPR-LLM with an RBF kernel, capable of modeling multimodal relevance scoring functions, consistently outperforms simpler unimodal kernels (dot product, cosine similarity), as well as baseline methods including DR, cross-encoder, and pointwise LLM-based relevance scoring by up to 65%. Overall, GPR-LLM provides an efficient and effective approach to NLRec within a minimal LLM labeling budget.
