Choosing the Right Evaluation Metric: Why Use Log Loss and Threshold Values?

-

When working on classification models in data science, one of the most important decisions you’ll make is choosing an evaluation metric. Two common concepts you’ll encounter are Log Loss and threshold values. Let’s break these down simply.

1. What is Log Loss?

Log Loss (Logarithmic Loss) measures the uncertainty of your predictions based on how far they are from the actual label. It doesn’t just check if the prediction was correct; it also penalizes overconfident wrong predictions.

Formula:

Log Loss=−1N∑i=1N[yilog⁡(pi)+(1−yi)log⁡(1−pi)]\text{Log Loss} = -\frac{1}{N} \sum_{i=1}^N [y_i \log(p_i) + (1-y_i) \log(1-p_i)]

  • Low Log Loss → Predictions are accurate and confident.

  • High Log Loss → Predictions are wrong or overconfident.

Example:
If the real label is 1 and your model predicts 0.99, great! If it predicts 0.51, not so confident. If it predicts 0.01, that’s very wrong, and log loss will penalize heavily.

When to use:

2. Why Use a Certain Threshold Value?

Classification models often output probabilities (e.g., 0.7 means 70% chance of being class 1). To turn these into actual predictions, we set a threshold.

Default: 0.5 → If probability > 0.5 → Class 1; else → Class 0.

Why change it?

Example:

  • Medical screening: Threshold = 0.3 (better to test more patients than miss one sick person).

  • Spam filter: Threshold = 0.8 (better to miss some spam than flag important emails).

Quick Code Example:

from sklearn.metrics import log_loss
import numpy as np

# Actual labels
y_true = [1, 0, 1, 1]

# Predicted probabilities
y_pred = [0.9, 0.1, 0.8, 0.4]

# Calculate log loss
print("Log Loss:", log_loss(y_true, y_pred))

# Threshold example
threshold = 0.7
predicted_labels = [1 if p > threshold else 0 for p in y_pred]
print("Predicted Labels:", predicted_labels)

✅ Key Takeaway:

  • Use Log Loss when probabilities matter and you want to penalize overconfident mistakes.

  • Adjust the threshold to match the risk tolerance and business goals of your application.

Comments

Post a Comment

Popular posts from this blog

Understanding Data Leakage in Machine Learning: Causes, Examples, and Prevention

-
When building machine learning models, achieving high accuracy on your training or validation data is exciting — but sometimes, that success can be misleading. One common trap that causes overly optimistic results is data leakage . In this blog, we will explore: What is data leakage? Why is it harmful? Real-world examples to understand leakage better How to prevent data leakage in your projects What is Data Leakage? Data leakage happens when your machine learning model has access to information during training that it wouldn’t realistically have when making predictions in the real world. This extra information “leaks” from the future or from the test set, causing the model to cheat. When leakage occurs, your model's performance metrics (like accuracy, R², or F1-score ) look great, but this performance won’t generalize to new, unseen data. Why is Data Leakage a Problem? Overfitting to training data : The model learns shortcuts rather than meaningful pattern...
Read more

🌳 Understanding Maximum Leaf Nodes in Decision Trees (Scikit-Learn)

-
When working with decision trees in machine learning , one of the most common questions is: 👉 How many leaf nodes can a decision tree have, given certain constraints? Let’s walk through a real example. 📌 The Question We initialize a decision tree as follows: from sklearn.tree import DecisionTreeClassifier clf = DecisionTreeClassifier( max_depth =4, random_state =42) We’re told: The dataset has 100 samples and 10 features . The tree is a perfectly balanced binary tree . No pruning is applied. No additional stopping criteria (like min_samples_split , min_samples_leaf , or max_leaf_nodes ). 👉 What is the maximum possible number of leaf nodes in the decision tree? 🌲 Key Concepts 1. Depth vs. Levels A binary tree with max_depth = d has at most d splits from the root to a leaf. Depth d = 4 means there can be 4 splits from the root node down to a leaf node. 2. Maximum Leaf Nodes Formula In a perfectly balanced binary tree : Number of leaf n...
Read more

Linear Regression with and without Intercept: Explained Simply

-
If you’re new to machine learning, linear regression is one of the easiest models to understand. It tries to draw a straight line (or a flat plane, if there are more features) that best fits the data. When we use scikit-learn’s LinearRegression , we can decide whether the line should include an intercept (a constant number added at the end of the equation) or not. The Example Code import numpy as np from sklearn.linear_model import LinearRegression X = np.array([[12, 13], [23, 24], [24, 25], [35, 36], [36, 37], [37, 38]]) # Create target values y y = np.dot(X, np.array([4, 5])) + 6 reg1 = LinearRegression(fit_intercept=True).fit(X, y) s1 = reg1.score(X, y) reg2 = LinearRegression(fit_intercept=False).fit(X, y) s2 = reg2.score(X, y) What’s Happening Here? X is our input data (two features per row). y is the output we want to predict. We made it using this formula: y = 4 ∗ x 0 + 5 ∗ x 1 + 6 y = 4 * x_0 + 5 * x_1 + 6 This formula clearly has an intercept = 6 . Case 1: Wi...
Read more