Multivariate Probability Calibration with Isotonic Bernstein Polynomials

被引:0
作者
Wang, Yongqiao [1 ]
Liu, Xudong [2 ]
机构
[1] Zhejiang Gongshang Univ, Coll Finance, Hangzhou, Peoples R China
[2] Univ North Florida, Sch Comp, Jacksonville, FL USA
来源
PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE | 2020年
关键词
ONLINE;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multivariate probability calibration is the problem of predicting class membership probabilities from classification scores of multiple classifiers. To achieve better performance, the calibrating function is often required to be coordinate-wise non-decreasing; that is, for every classifier, the higher the score, the higher the probability of the class labeling being positive. To this end, we propose a multivariate regression method based on shape-restricted Bernstein polynomials. This method is universally flexible: it can approximate any continuous calibrating function with any specified error, as the polynomial degree increases to infinite. Moreover, it is universally consistent: the estimated calibrating function converges to any continuous calibrating function, as the training size increases to infinity. Our empirical study shows that the proposed method achieves better calibrating performance than benchmark methods.
引用
收藏
页码:2547 / 2553
页数:7
相关论文
共 23 条
  • [1] [Anonymous], 1993, Constructive Approximation
  • [2] Ben-Tal Aharon, 2019, TECHNICAL REPORT
  • [3] Dua Dheeru, 2017, UCI Machine Learning Repository
  • [4] Grant M., 2014, CVX: Matlab software for disciplined convex programming
  • [5] GYORFI L., 2006, A distribution-free theory of nonparametric regression, DOI 10.1007/b97848
  • [6] He JZ, 2015, AAAI CONF ARTIF INTE, P1749
  • [7] Jiang Xiaoqian, 2011, AMIA Jt Summits Transl Sci Proc, V2011, P16
  • [8] Kuleshov V., 2018, Proceedings of Machine Learning Research, P2801
  • [9] Kuleshov V, 2017, AAAI CONF ARTIF INTE, P2110
  • [10] Kuleshov V, 2015, ADV NEUR IN, V28