An exact lower bound on the misclassification probability

12/03/2017
by   Iosif Pinelis, et al.
0

A lower bound on the misclassification probability for a finite number of classes is obtained in terms of the total variation norms of the differences between the sub-distributions over the classes. This bound, which is shown to be exact in a certain rather strong sense, is based on an exact upper bound on the difference between the maximum and the mean of a finite set of real numbers, in terms of the sum of the absolute values of the pairwise differences between the numbers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/03/2017

Exact upper and lower bounds on the misclassification probability

Exact lower and upper bounds on the best possible misclassification prob...
research
10/27/2014

Exact Expression For Information Distance

Information distance can be defined not only between two strings but als...
research
07/17/2017

The PSLQ Algorithm for Empirical Data

The celebrated integer relation finding algorithm PSLQ has been successf...
research
12/05/2022

On the exact region determined by Spearman's rho and Spearman's footrule

We determine the lower bound for possible values of Spearman's rho of a ...
research
02/03/2020

A lower bound on the number of inequivalent APN functions

In this paper, we establish a lower bound on the total number of inequiv...
research
09/05/2022

Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings

The purpose of this article is to study the algorithmic complexity of th...
research
10/09/2020

Exact Minimax Estimation for Phase Synchronization

We study the phase synchronization problem with measurements Y=z^*z^*H+σ...

Please sign up or login with your details

Forgot password? Click here to reset