Optimal Scoring Rule Design under Partial Knowledge
원문 초록
This paper studies the design of optimal proper scoring rules when the principal has partial knowledge of an agent's signal distribution. Recent work characterizes the proper scoring rules that maximize the increase of an agent's payoff when the agent chooses to access a costly signal to refine a posterior belief from her prior prediction, under the assumption that the agent's signal distribution is fully known to the principal. In our setting, the principal only knows about a set of distributions where the agent's signal distribution belongs. We formulate the scoring rule design problem as a max-min optimization that maximizes the worst-case increase in payoff across the set of distributions. We propose an efficient algorithm to compute an optimal scoring rule when the set of distributions is finite, and devise a fully polynomial-time approximation scheme that accommodates various infinite sets of distributions. We further remark that widely used scoring rules, such as the quadratic and log rules, as well as previously identified optimal scoring rules under full knowledge, can be far from optimal in our partial knowledge settings.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.