Optimizing positional scoring rules for rank aggregation
원문 초록
Nowadays, several crowdsourcing projects exploit social choice methods for computing an aggregate ranking of alternatives given individual rankings provided by workers. Motivated by such systems, we consider a setting where each worker is asked to rank a fixed (small) number of alternatives and, then, a positional scoring rule is used to compute the aggregate ranking. Among the apparently infinite such rules, what is the best one to use? To answer this question, we assume that we have partial access to an underlying true ranking. Then, the important optimization problem to be solved is to compute the positional scoring rule whose outcome, when applied to the profile of individual rankings, is as close as possible to the part of the underlying true ranking we know. We study this fundamental problem from a theoretical viewpoint and present positive and negative complexity results and, furthermore, complement our theoretical findings with experiments on real-world and synthetic data.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
h-calibration: Rethinking Classifier Recalibration with Probabilistic Error-Bounded Objective
Enforcing tail calibration when training probabilistic forecast models
Harnessing Superclasses for Learning from Hierarchical Databases
Bayesian Autoregressive Online Change-Point Detection with Time-Varying Parameters
Improving probabilistic forecasts of extreme wind speeds by training statistical post-processing models with weighted scoring rules
Distributional Regression U-Nets for the Postprocessing of Precipitation Ensemble Forecasts
토론
이 논문과 연결된 포럼 글이 아직 없습니다.