arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2308.03376cs.AI
收藏

面向带交互子集比较的鲁棒有序回归

Robust Ordinal Regression for Subsets Comparisons with Interactions

Sorbonne Université(索邦大学);CNRS(法国国家科学研究中心);Université Paris Dauphine(巴黎多芬大学);PSL Research University(PSL研究大学)

Hugo Gilbert, Mohamed Ouaguenouni, Meltem Ozturk, Olivier Spanjaard

AI总结:

本文提出一种鲁棒有序回归方法,通过学习带元素交互的子集偏好模型,并基于奥卡姆剃刀原则和不确定集进行可靠预测,从而在无法可靠判断时弃权(不执行)预测。

摘要:

本文致力于提出一种鲁棒的有序方法,用于学习决策者在子集之间的偏好。该决策模型源自 Fishburn 和 LaValle (1996),其参数由我们学习得到;由于考虑了元素之间可能存在的交互作用,该模型具有足够的通用性,能够与子集上的任意严格弱序相容。此外,如果可用的偏好数据无法支持可靠的预测,我们允许不对某些偏好进行预测。若所有能够解释偏好数据的最简单模型(奥卡姆剃刀原则)都对该预测达成一致,则该预测偏好被视为可靠。遵循鲁棒有序回归方法,我们的预测基于一个包含模型参数可能取值的不确定集。我们定义了子集之间的鲁棒有序占优关系,并设计了一种程序来确定该占优关系是否成立。在合成数据和真实世界数据上进行了数值实验,以评估所生成偏好预测的丰富性和可靠性。

英文摘要:

This paper is dedicated to a robust ordinal method for learning the preferences of a decision maker between subsets. The decision model, derived from Fishburn and LaValle (1996) and whose parameters we learn, is general enough to be compatible with any strict weak order on subsets, thanks to the consideration of possible interactions between elements. Moreover, we accept not to predict some preferences if the available preference data are not compatible with a reliable prediction. A predicted preference is considered reliable if all the simplest models (Occam's razor) explaining the preference data agree on it. Following the robust ordinal regression methodology, our predictions are based on an uncertainty set encompassing the possible values of the model parameters. We define a robust ordinal dominance relation between subsets and we design a procedure to determine whether this dominance relation holds. Numerical tests are provided on synthetic and real-world data to evaluate the richness and reliability of the preference predictions made.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑