An Arbitrarily Tight Lower Bound for the Bhattacharyya Upper Bound on Bayes Error
摘要
This study introduces a novel upper bound for the Bayes error that is a lower bound for the traditional Bhattacharyya bound for binary classifiers. We demonstrate its superior tightness through analytical comparisons and empirical evaluations against known bounds.