A Risk Profile for Information Fusion Algorithms

Entropy

Kenric P. Nelson¹  Brian J. Scannell¹ 

[1] Raytheon Integrated Defense Systems, 235 Presidential Way, Woburn, MA 01801, USA; E-Mail:

关键词: Tsallis entropy;    proper scoring rules;    information fusion;    machine learning;   

DOI  :  10.3390/e13081518

来源: mdpi

【 摘 要 】

E.T. Jaynes, originator of the maximum entropy interpretation of statistical mechanics, emphasized that there is an inevitable trade-off between the conflicting requirements of robustness and accuracy for any inferencing algorithm. This is because robustness requires discarding of information in order to reduce the sensitivity to outliers. The principal of nonlinear statistical coupling, which is an interpretation of the Tsallis entropy generalization, can be used to quantify this trade-off. The coupled-surprisal, , is a generalization of Shannon surprisal or the logarithmic scoring rule, given a forecast p of a true event by an inferencing algorithm. The coupling parameter κ = 1 − q, where q is the Tsallis entropy index, is the degree of nonlinear coupling between statistical states. Positive (negative) values of nonlinear coupling decrease (increase) the surprisal information metric and thereby biases the risk in favor of decisive (robust) algorithms relative to the Shannon surprisal (κ = 0). We show that translating the average coupled-surprisal to an effective probability is equivalent to using the generalized mean of the true event probabilities as a scoring rule. The metric is used to assess the robustness, accuracy, and decisiveness of a fusion algorithm. We use a two-parameter fusion algorithm to combine input probabilities from N sources. The generalized mean parameter ‘alpha’ varies the degree of smoothing and raising to a power N^β with β between 0 and 1 provides a model of correlation.

【 授权许可】

CC BY   
© 2011 by the authors; licensee MDPI, Basel, Switzerland.