The Many-to-Many Mapping Between the Concordance Correlation Coefficient and the Mean Square Error

We derive the mapping between two of the most pervasive utility functions, the mean square error () and the concordance correlation coefficient (CCC, ). Despite its drawbacks, is one of the most popular performance metrics (and a loss function); along with lately in many of the sequence prediction challenges. Despite the ever-growing simultaneous usage, e.g., inter-rater agreement, assay validation, a mapping between the two metrics is missing, till date. While minimisation of norm of the errors or of its positive powers (e.g., ) is aimed at maximisation, we reason the often-witnessed ineffectiveness of this popular loss function with graphical illustrations. The discovered formula uncovers not only the counterintuitive revelation that `' does not imply `', but also provides the precise range for the metric for a given . We discover the conditions for optimisation for a given ; and as a logical next step, for a given set of errors. We generalise and discover the conditions for any given norm, for an even p. We present newly discovered, albeit apparent, mathematical paradoxes. The study inspires and anticipates a growing use of -inspired loss functions e.g., , replacing the traditional -norm loss functions in multivariate regressions.
View on arXiv