A risk profile for information fusion algorithms
Kenric P. Nelson, Brian J. Scannell, Herbert Landau

TL;DR
This paper introduces a risk profile framework for information fusion algorithms based on nonlinear statistical coupling, balancing robustness and accuracy through a generalized entropy measure, and evaluates a two-parameter fusion method.
Contribution
It develops a novel risk metric using Tsallis entropy generalization to quantify robustness and decisiveness in information fusion algorithms.
Findings
The coupled-surprisal metric effectively assesses robustness and accuracy.
The two-parameter fusion algorithm models correlation and smoothing effects.
The framework provides a trade-off analysis between robustness and decisiveness.
Abstract
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, -ln_k (p)=-(p^k-1)/k, 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 k=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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
