Post-hoc Selection of Pareto-Optimal Solutions in Search and Recommendation

被引:3
作者
Paparella, Vincenzo [1 ]
Anelli, Vito Walter [1 ]
Nardini, Franco Maria [2 ]
Perego, Raffaele [2 ]
Di Noia, Tommaso [1 ]
机构
[1] Politecn Bari, Bari, Italy
[2] ISTI CNR, Pisa, Italy
来源
PROCEEDINGS OF THE 32ND ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2023 | 2023年
关键词
Pareto optimality; Information Retrieval; Recommender Systems; OPTIMIZATION; QUALITY; DESIGN;
D O I
10.1145/3583780.3615010
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Information Retrieval (IR) and Recommender Systems (RSs) tasks are moving from computing a ranking of final results based on a single metric to multi-objective problems. Solving these problems leads to a set of Pareto-optimal solutions, known as Pareto frontier, in which no objective can be further improved without hurting the others. In principle, all the points on the Pareto frontier are potential candidates to represent the best model selected with respect to the combination of two, or more, metrics. To our knowledge, there are no well-recognized strategies to decide which point should be selected on the frontier in IR and RSs. In this paper, we propose a novel, post-hoc, theoretically-justified technique, named "Population Distance from Utopia" (PDU), to identify and select the one-best Pareto-optimal solution. PDU considers fine-grained utopia points, and measures how far each point is from its utopia point, allowing to select solutions tailored to user preferences, a novel feature we call "calibration". We compare PDU against state-of-the-art strategies through extensive experiments on tasks from both IR and RS, showing that PDU combined with calibration notably impacts the solution selection.
引用
收藏
页码:2013 / 2023
页数:11
相关论文
共 53 条
[1]   Multistakeholder recommendation: Survey and research directions [J].
Abdollahpouri, Himan ;
Adomavicius, Gediminas ;
Burke, Robin ;
Guy, Ido ;
Jannach, Dietmar ;
Kamishima, Toshihiro ;
Krasnodebski, Jan ;
Pizzato, Luiz .
USER MODELING AND USER-ADAPTED INTERACTION, 2020, 30 (01) :127-158
[2]   Controlling Popularity Bias in Learning-to-Rank Recommendation [J].
Abdollahpouri, Himan ;
Burke, Robin ;
Mobasher, Bamshad .
PROCEEDINGS OF THE ELEVENTH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'17), 2017, :42-46
[3]  
Abdollahpouri Himan, 2019, P 32 INT FLAIRS C
[4]   Top-N Recommendation Algorithms: A Quest for the State-of-the-Art [J].
Anelli, Vito Walter ;
Bellogin, Alejandro ;
Di Noia, Tommaso ;
Jannach, Dietmar ;
Pomo, Claudio .
PROCEEDINGS OF THE 30TH ACM CONFERENCE ON USER MODELING, ADAPTATION AND PERSONALIZATION, UMAP 2022, 2022, :121-131
[5]  
[Anonymous], 2012, P 6 ACM C RECOMMENDE, DOI DOI 10.1145/2365952.2365962
[6]  
[Anonymous], 2016, KNOWL BASED SYST, DOI DOI 10.1016/J.KN0SYS.2016.04.018
[7]  
[Anonymous], 2011, P 5 ACM C REC SYST C
[8]  
[Anonymous], 2012, P 21 ACM INT C INFOR
[9]   Finding knees in multi-objective optimization [J].
Branke, E ;
Deb, K ;
Dierolf, H ;
Osswald, M .
PARALLEL PROBLEM SOLVING FROM NATURE - PPSN VIII, 2004, 3242 :722-731
[10]  
Burges C.J., 2010, Learning, V11, P81