信息融合算法的风险分析
A risk profile for information fusion algorithms
摘要:
E.T. Jaynes是统计力学最大熵解释的创始人,他强调,对于任何推理算法,鲁棒性和准确性的冲突要求之间存在不可避免的权衡。这是因为鲁棒性要求丢弃信息,以降低对离群值的敏感性。非线性统计耦合的原理是对Tsallis熵概括的一种解释,可以用来量化这种权衡。耦合概率,-ln_k(p)=-(p^k-1)/k,是香农概率或对数评分规则的推广,通过推理算法给出真实事件的预测p。耦合参数k=1-q,其中q是Tsallis熵指数,是统计状态之间的非线性耦合程度。非线性耦合的正(负)值减少(增加)的统计信息度量,从而偏向于相对于香农统计(k=0)的决定性(鲁棒)算法的风险。我们表明,翻译的平均耦合的有效概率是等效于使用的广义平均值的真实事件概率作为评分规则。该度量用于评估融合算法的鲁棒性、准确性和决策性。我们使用一个双参数融合算法来结合来自N个源的输入概率。广义平均参数“alpha”改变平滑的程度,并且提高到幂N^beta,其中beta在0和1之间,提供了相关性的模型。
英文摘要:
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 information metric and thereby biases the risk in favor of decisive (robust) algorithms relative to the Shannon surprisal (k=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^beta with beta between 0 and 1 provides a model of correlation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。