REVIEW 3 cited by
Large Language Models for Relevance Judgment in Product Search
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
High relevance of retrieved and re-ranked items to the search query is the cornerstone of successful product search, yet measuring relevance of items to queries is one of the most challenging tasks in product information retrieval, and quality of product search is highly influenced by the precision and scale of available relevance-labelled data. In this paper, we present an array of techniques for leveraging Large Language Models (LLMs) for automating the relevance judgment of query-item pairs (QIPs) at scale. Using a unique dataset of multi-million QIPs, annotated by human evaluators, we test and optimize hyper parameters for finetuning billion-parameter LLMs with and without Low Rank Adaption (LoRA), as well as various modes of item attribute concatenation and prompting in LLM finetuning, and consider trade offs in item attribute inclusion for quality of relevance predictions. We demonstrate considerable improvement over baselines of prior generations of LLMs, as well as off-the-shelf models, towards relevance annotations on par with the human relevance evaluators. Our findings have immediate implications for the growing field of relevance judgment automation in product search.
Forward citations
Cited by 3 Pith papers
-
SAGE: Scalable AI Governance & Evaluation
SAGE co-evolves a relevance policy, expert-curated precedents, and a distilled LLM judge to grade search relevance at production scale, reporting 0.72–0.73 linear Cohen's kappa against humans and a 0.25% DAU lift at LinkedIn.
-
PaSa: An LLM Agent for Comprehensive Academic Paper Search
PaSa, a two-agent LLM system trained with session-level RL, reports substantially higher recall than existing academic search baselines on complex paper-finding queries.
-
CORE: A Unified Cascaded Ordinal Relevance Estimation Framework for E-commerce Search
Cascaded binary relevance decisions with step-level GRPO and PostCoT distillation improve offline accuracy and cut online bad-case rate by 15.94% versus flat multi-class baselines.
Discussion (0). Continue with ORCID to comment.