Thresholding Classifiers to Maximize F1 Score
This paper provides new insight into maximizing F1 scores in the context of binary classification and also in the context of multilabel classification. The harmonic mean of precision and recall, F1 score is widely used to measure the success of a binary classifier when one class is rare. Micro average, macro average, and per instance average F1 scores are used in multilabel classification. For any classifier that produces a real-valued output, we derive the relationship between the best achievable F1 score and the decision-making threshold that achieves this optimum. As a special case, if the classifier outputs are well-calibrated conditional probabilities, then the optimal threshold is half the optimal F1 score. As another special case, if the classifier is completely uninformative, then the optimal behavior is to classify all examples as positive. Since the actual prevalence of positive examples typically is low, this behavior can be considered undesirable. As a case study, we discuss the results, which can be surprising, of applying this procedure when predicting 26,853 labels for Medline documents.
Code (1)
Tasks
Binary ClassificationClassificationDecision MakingGeneral ClassificationSimilar Papers 제목 키워드 기반
RAPT: Retrieval-Augmented Post-hoc Thresholding for Multi-Label Classification
Industrial multi-label document understanding pipelines score candidate labels and threshold or rank them to form a label set per document. This early selection step directly affects the accuracy of downstream informatio…
Multi-Label ClassificationInformation ExtractionMetric LearningFair Bayes-Optimal Classifiers Under Predictive Parity
Increasing concerns about disparate effects of AI have motivated a great deal of work on fair machine learning. Existing works mainly focus on independence- and separation-based measures (e.g., demographic parity, equali…
Fair Decisions from Calibrated Scores: Achieving Optimal Classification While Satisfying Sufficiency
Binary classification based on predicted probabilities (scores) is a fundamental task in supervised machine learning. While thresholding scores is Bayes-optimal in the unconstrained setting, using a single threshold gene…
Binary ClassificationTHORS: An Efficient Approach for Making Classifiers Cost-sensitive
In this paper, we propose an effective THresholding method based on ORder Statistic, called THORS, to convert an arbitrary scoring-type classifier, which can induce a continuous cumulative distribution function of the sc…
General ClassificationDeep Hashing with Hash Center Update for Efficient Image Retrieval
In this paper, we propose an approach for learning binary hash codes for image retrieval. Canonical Correlation Analysis (CCA) is used to design two loss functions for training a neural network such that the correlation …
Deep HashingImage RetrievalRetrieval