Collaboratively Learning Preferences from Ordinal Data
In applications such as recommendation systems and revenue management, it is important to predict preferences on items that have not been seen by a user or predict outcomes of comparisons among those that have never been compared. A popular discrete choice model of multinomial logit model captures the structure of the hidden preferences with a low-rank matrix. In order to predict the preferences, we want to learn the underlying model from noisy observations of the low-rank matrix, collected as revealed preferences in various forms of ordinal data. A natural approach to learn such a model is to solve a convex relaxation of nuclear norm minimization. We present the convex relaxation approach in two contexts of interest: collaborative ranking and bundled choice modeling. In both cases, we show that the convex relaxation is minimax optimal. We prove an upper bound on the resulting error with finite samples, and provide a matching information-theoretic lower bound.
Code (0)
등록된 구현이 없습니다.
Tasks
Collaborative RankingManagementRecommendation SystemsSimilar Papers 제목 키워드 기반
Beyond Binary Preferences: A Principled Framework for Reward Modeling with Ordinal Feedback
Reward modeling is crucial for aligning large language models with human preferences, yet current approaches lack a principled mathematical framework for leveraging ordinal preference data. When human annotators provide …
Beyond Ordinal Preferences: Why Alignment Needs Cardinal Human Feedback
Alignment techniques for LLMs rely on optimizing preference-based objectives -- where these preferences are typically elicited as ordinal, binary choices between responses. Recent work has focused on improving label qual…
Unambiguous Efficiency of Random Allocations
In the problem of allocating indivisible objects via lottery, a social planner often knows only agents' ordinal preferences over objects, but not their complete preferences over lotteries. Such an informationally constra…
FairnessThe Vigilant Eating Rule: A General Approach for Probabilistic Economic Design with Constraints
We consider the problem of probabilistic allocation of objects under ordinal preferences. We devise an allocation mechanism, called the vigilant eating rule (VER), that applies to nearly arbitrary feasibility constraints…
Intensinist Social Welfare and Ordinal Intensity-Efficient Allocations
This paper studies social welfare and allocation efficiency in situations where, in addition to having ordinal preferences, agents also have *ordinal intensities*: they can make comparisons such as "I prefer a to b more …