paper-with-me

홈 › Papers

Reformulating van Rijsbergen's $F_β$ metric for weighted binary cross-entropy

2022-10-29 · Satesh Ramdhani

The separation of performance metrics from gradient based loss functions may not always give optimal results and may miss vital aggregate information. This paper investigates incorporating a performance metric alongside differentiable loss functions to inform training outcomes. The goal is to guide model performance and interpretation by assuming statistical distributions on this performance metric for dynamic weighting. The focus is on van Rijsbergens $F_{\beta}$ metric -- a popular choice for gauging classification performance. Through distributional assumptions on the $F_{\beta}$, an intermediary link can be established to the standard binary cross-entropy via dynamic penalty weights. First, the $F_{\beta}$ metric is reformulated to facilitate assuming statistical distributions with accompanying proofs for the cumulative density function. These probabilities are used within a knee curve algorithm to find an optimal $\beta$ or $\beta_{opt}$. This $\beta_{opt}$ is used as a weight or penalty in the proposed weighted binary cross-entropy. Experimentation on publicly available data along with benchmark analysis mostly yields better and interpretable results as compared to the baseline for both imbalanced and balanced classes. For example, for the IMDB text data with known labeling errors, a 14% boost in $F_1$ score is shown. The results also reveal commonalities between the penalty model families derived in this paper and the suitability of recall-centric or precision-centric parameters used in the optimization. The flexibility of this methodology can enhance interpretation.

📄 PDF Abstract BibTeX arXiv:2210.16458

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Combining Evaluation Metrics via the Unanimous Improvement Ratio and its Application to Clustering Tasks

2014-01-18 · Enrique Amigó, Julio Gonzalo, Javier Artiles, Felisa Verdejo

Many Artificial Intelligence tasks cannot be evaluated with a single quality criterion and some sort of weighted combination is needed to provide system rankings. A problem of weighted combination measures is that slight…

ClusteringText Clustering

Bayesian Volumetric Autoregressive generative models for better semisupervised learning

2019-07-26 · Guilherme Pombo, Robert Gray, Tom Varsavsky, John Ashburner 외

Deep generative models are rapidly gaining traction in medical imaging. Nonetheless, most generative architectures struggle to capture the underlying probability distributions of volumetric data, exhibit convergence prob…

General ClassificationSemantic Segmentation

Relative Depth Estimation as a Ranking Problem

2020-10-14 · Alican Mertan, Damien Jade Duff, Gozde Unal

We present a formulation of the relative depth estimation from a single image problem, as a ranking problem. By reformulating the problem this way, we were able to utilize literature on the ranking problem, and apply the…

Depth Estimation

The Real-World-Weight Cross-Entropy Loss Function: Modeling the Costs of Mislabeling

2020-01-03 · Yaoshiang Ho, Samuel Wookey

In this paper, we propose a new metric to measure goodness-of-fit for classifiers, the Real World Cost function. This metric factors in information about a real world problem, such as financial impact, that other measure…

BIG-bench Machine LearningDiagnosticGeneral Classification

Efficient Querying from Weighted Binary Codes

2019-11-21 · Zhenyu Weng, Yuesheng Zhu

Binary codes are widely used to represent the data due to their small storage and efficient computation. However, there exists an ambiguity problem that lots of binary codes share the same Hamming distance to a query. To…