paper-with-me

홈 › Papers

Multi-Conditional Ranking with Large Language Models

2024-03-30 · Pouya Pezeshkpour, Estevam Hruschka

Utilizing large language models (LLMs) to rank a set of items has become a common approach in recommendation and retrieval systems. Typically, these systems focus on ordering a substantial number of documents in a monotonic order based on a given query. However, real-world scenarios often present a different challenge: ranking a comparatively smaller set of items, but according to a variety of diverse and occasionally conflicting conditions. In this paper, we define and explore the task of multi-conditional ranking by introducing MCRank, a benchmark tailored for assessing multi-conditional ranking across various item types and conditions. Our analysis of LLMs using MCRank indicates a significant decrease in performance as the number and complexity of items and conditions grow. To overcome this limitation, we propose a novel decomposed reasoning method, consisting of EXtracting and Sorting the conditions, and then Iteratively Ranking the items (EXSIR). Our extensive experiments show that this decomposed reasoning method enhances LLMs' performance significantly, achieving up to a 14.4% improvement over existing LLMs. We also provide a detailed analysis of LLMs performance across various condition categories, and examine the effectiveness of decomposition step. Furthermore, we compare our method with existing approaches such as Chain-of-Thought and existing ranking models, demonstrating the superiority of our approach and complexity of MCR task. We released our dataset and code.

📄 PDF Abstract BibTeX arXiv:2404.00211

Code (1)

megagonlabs/mcr 공식 구현

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically
Focus 설명 없음

Similar Papers 제목 키워드 기반

Few-shot Reranking for Multi-hop QA via Language Model Prompting

2022-05-25 · Muhammad Khalifa, Lajanugen Logeswaran, Moontae Lee, Honglak Lee 외

We study few-shot reranking for multi-hop QA with open-domain questions. To alleviate the need for a large number of labeled question-document pairs for retriever training, we propose PromptRank, which relies on large la…

Language ModelingOpen-Domain Question AnsweringPassage Re-RankingReranking+2

Detection of Verbal Multi-Word Expressions via Conditional Random Fields with Syntactic Dependency Features and Semantic Re-Ranking

2017-04-01 · WS 2017 4 · Alfredo Maldonado, Lifeng Han, Erwan Moreau, Ashjan Alsulaimani 외

A description of a system for identifying Verbal Multi-Word Expressions (VMWEs) in running text is presented. The system mainly exploits universal syntactic dependency features through a Conditional Random Fields (CRF) s…

Re-Ranking

Large Language Models are Zero-Shot Rankers for Recommender Systems

2023-05-15 · Yupeng Hou, Junjie Zhang, Zihan Lin, Hongyu Lu 외

Recently, large language models (LLMs) (e.g., GPT-4) have demonstrated impressive general-purpose task-solving abilities, including the potential to approach recommendation tasks. Along this line of research, this work a…

Recommendation Systems

Towards Ranking-based Semantics for Abstract Argumentation using Conditional Logic Semantics

2020-08-05 · Kenneth Skiba, Matthias Thimm

We propose a novel ranking-based semantics for Dung-style argumentation frameworks with the help of conditional logics. Using an intuitive translation for an argumentation framework to generate conditionals, we can apply…

Abstract ArgumentationTranslation

Text Ranking and Classification using Data Compression

2021-09-23 · NeurIPS Workshop ICBINB 2021 12 · Nitya Kasturi, Igor L. Markov

A well-known but rarely used approach to text categorization uses conditional entropy estimates computed using data compression tools. Text affinity scores derived from compressed sizes can be used for classification and…

ClassificationData CompressionText Categorization