Number of the records: 1  

Performance of Kullback-Leibler Based Expert Opinion Pooling for Unlikely Events

  1. 1.
    0479432 - ÚTIA 2018 RIV ES eng C - Conference Paper (international conference)
    Sečkárová, Vladimíra
    Performance of Kullback-Leibler Based Expert Opinion Pooling for Unlikely Events.
    Proceedings of the NIPS 2016 Workshop on Imperfect Decision Makers. Cambridge: JMLR, 2017 - (Guy, T.; Kárný, M.; Rios-Insua, D.; Wolpert, D.), s. 41-50. Proceedings of Machine Learning Research, volume 58. E-ISSN 1938-7228.
    [NIPS 2016 Workshop on Imperfect Decision Makers. Barcelona (ES), 09.12.2016-09.12.2016]
    R&D Projects: GA ČR(CZ) GA16-09848S
    Institutional support: RVO:67985556
    Keywords : Opinion Pooling * Combining Probability Distributions * Minimum KullbackLeibler Divergence
    OECD category: Statistics and probability
    http://library.utia.cas.cz/separaty/2017/AS/seckarova-0479432.pdf

    The aggregation of available information is of great importance in many branches of economics,
    social sciences. Often, we can only rely on experts’ opinions, i.e. probabilities assigned to possible events. To deal with opinions in probabilistic form, we focus on the Kullback-Leibler (KL) divergence based pools: linear, logarithmic and KL-pool (Seckarova, 2015). Since occurrence of events is subject to random influences of the real world, it is important to address events assigned lower probabilities (unlikely events). This is done by choosing pooling with a higher entropy than standard linear or logarithmic options, i.e. the KL-pool. We show how well the mentioned pools perform on real data using absolute error, KL-divergence and quadratic reward. In cases favoring events assigned higher probabilities, the KL-pool performs similarly to the linear pool and outperforms the logarithmic pool. When unlikely events occur, the KL-pool outperforms both pools, which makes it a reasonable way of pooling.

    Permanent Link: http://hdl.handle.net/11104/0275502

     
     
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.